./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_length_check-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_length_check-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b1cf2dd5b4da09460afcca66f285dbd0591f4fa3369eb070fcfcc2c1d99d315 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:57:58,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:57:58,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:57:58,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:57:58,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:57:58,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:57:58,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:57:58,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:57:58,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:57:58,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:57:58,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:57:58,783 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:57:58,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:57:58,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:57:58,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:57:58,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:57:58,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:57:58,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:57:58,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:57:58,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:57:58,801 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:57:58,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:57:58,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:57:58,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:57:58,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:57:58,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:57:58,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:57:58,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:57:58,813 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:57:58,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:57:58,814 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:57:58,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:57:58,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:57:58,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:57:58,818 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:57:58,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:57:58,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:57:58,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:57:58,819 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:57:58,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:57:58,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:57:58,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:57:58,853 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:57:58,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:57:58,854 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:57:58,854 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:57:58,855 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:57:58,855 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:57:58,855 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:57:58,855 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:57:58,856 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:57:58,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:57:58,857 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:57:58,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:57:58,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:57:58,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:57:58,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:57:58,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:57:58,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:57:58,858 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:57:58,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:57:58,858 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:57:58,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:57:58,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:57:58,859 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:57:58,859 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:57:58,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:57:58,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:57:58,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:57:58,860 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:57:58,860 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:57:58,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:57:58,861 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:57:58,861 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:57:58,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:57:58,861 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b1cf2dd5b4da09460afcca66f285dbd0591f4fa3369eb070fcfcc2c1d99d315 [2022-02-20 16:57:59,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:57:59,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:57:59,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:57:59,132 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:57:59,133 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:57:59,134 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_length_check-2.i [2022-02-20 16:57:59,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf982141/7b112d21efdc490b891d3cada3c558b7/FLAGac630f68a [2022-02-20 16:57:59,657 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:57:59,658 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_length_check-2.i [2022-02-20 16:57:59,667 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf982141/7b112d21efdc490b891d3cada3c558b7/FLAGac630f68a [2022-02-20 16:57:59,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cf982141/7b112d21efdc490b891d3cada3c558b7 [2022-02-20 16:57:59,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:57:59,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:57:59,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:57:59,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:57:59,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:57:59,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:57:59" (1/1) ... [2022-02-20 16:57:59,694 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e73d87d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:57:59, skipping insertion in model container [2022-02-20 16:57:59,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:57:59" (1/1) ... [2022-02-20 16:57:59,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:57:59,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:57:59,961 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-ext3-properties/sll_length_check-2.i[23814,23827] [2022-02-20 16:57:59,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:57:59,972 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:58:00,034 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-ext3-properties/sll_length_check-2.i[23814,23827] [2022-02-20 16:58:00,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:58:00,068 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:58:00,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:00 WrapperNode [2022-02-20 16:58:00,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:58:00,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:58:00,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:58:00,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:58:00,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:00" (1/1) ... [2022-02-20 16:58:00,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:00" (1/1) ... [2022-02-20 16:58:00,122 INFO L137 Inliner]: procedures = 125, calls = 15, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 87 [2022-02-20 16:58:00,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:58:00,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:58:00,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:58:00,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:58:00,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:00" (1/1) ... [2022-02-20 16:58:00,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:00" (1/1) ... [2022-02-20 16:58:00,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:00" (1/1) ... [2022-02-20 16:58:00,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:00" (1/1) ... [2022-02-20 16:58:00,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:00" (1/1) ... [2022-02-20 16:58:00,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:00" (1/1) ... [2022-02-20 16:58:00,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:00" (1/1) ... [2022-02-20 16:58:00,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:58:00,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:58:00,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:58:00,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:58:00,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:00" (1/1) ... [2022-02-20 16:58:00,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:58:00,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:58:00,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:58:00,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:58:00,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:58:00,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:58:00,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:58:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:58:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:58:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:58:00,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:58:00,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:58:00,349 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:58:00,350 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:58:00,612 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:58:00,617 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:58:00,617 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:58:00,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:58:00 BoogieIcfgContainer [2022-02-20 16:58:00,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:58:00,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:58:00,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:58:00,631 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:58:00,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:57:59" (1/3) ... [2022-02-20 16:58:00,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e899948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:58:00, skipping insertion in model container [2022-02-20 16:58:00,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:58:00" (2/3) ... [2022-02-20 16:58:00,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e899948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:58:00, skipping insertion in model container [2022-02-20 16:58:00,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:58:00" (3/3) ... [2022-02-20 16:58:00,634 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_length_check-2.i [2022-02-20 16:58:00,639 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:58:00,640 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:58:00,690 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:58:00,702 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:58:00,702 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:58:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:00,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:58:00,721 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:00,722 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:00,723 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:00,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1050078975, now seen corresponding path program 1 times [2022-02-20 16:58:00,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:00,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073412304] [2022-02-20 16:58:00,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:00,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:00,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {26#true} is VALID [2022-02-20 16:58:00,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {26#true} is VALID [2022-02-20 16:58:00,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-02-20 16:58:00,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#false} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {27#false} is VALID [2022-02-20 16:58:00,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#false} assume !true; {27#false} is VALID [2022-02-20 16:58:00,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {27#false} is VALID [2022-02-20 16:58:00,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {27#false} is VALID [2022-02-20 16:58:00,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {27#false} is VALID [2022-02-20 16:58:00,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} sll_length_#res#1 := sll_length_~len~0#1; {27#false} is VALID [2022-02-20 16:58:00,907 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {27#false} is VALID [2022-02-20 16:58:00,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {27#false} is VALID [2022-02-20 16:58:00,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-02-20 16:58:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:00,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:00,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073412304] [2022-02-20 16:58:00,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073412304] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:58:00,912 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:58:00,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:58:00,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973533673] [2022-02-20 16:58:00,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:58:00,920 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:58:00,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:00,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:00,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:00,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:58:00,949 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:00,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:58:00,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:58:00,969 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:01,001 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2022-02-20 16:58:01,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:58:01,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:58:01,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:58:01,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2022-02-20 16:58:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2022-02-20 16:58:01,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 58 transitions. [2022-02-20 16:58:01,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:01,066 INFO L225 Difference]: With dead ends: 41 [2022-02-20 16:58:01,067 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 16:58:01,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:58:01,072 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:58:01,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:58:01,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 16:58:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 16:58:01,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:58:01,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,096 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,096 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:01,098 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 16:58:01,099 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 16:58:01,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:01,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:01,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 16:58:01,100 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 16:58:01,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:01,101 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 16:58:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 16:58:01,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:01,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:01,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:58:01,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:58:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-20 16:58:01,105 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2022-02-20 16:58:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:58:01,106 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-20 16:58:01,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,107 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 16:58:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:58:01,107 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:01,107 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:01,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:58:01,108 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:01,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:01,109 INFO L85 PathProgramCache]: Analyzing trace with hash 924106356, now seen corresponding path program 1 times [2022-02-20 16:58:01,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:01,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425720813] [2022-02-20 16:58:01,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:01,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:01,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {145#true} is VALID [2022-02-20 16:58:01,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {147#(= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:01,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {147#(= |ULTIMATE.start_main_~len~1#1| 2)} main_#t~short9#1 := main_~len~1#1 < 32; {147#(= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:01,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {147#(= |ULTIMATE.start_main_~len~1#1| 2)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {147#(= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:01,217 INFO L290 TraceCheckUtils]: 4: Hoare triple {147#(= |ULTIMATE.start_main_~len~1#1| 2)} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {147#(= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:01,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#(= |ULTIMATE.start_main_~len~1#1| 2)} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {148#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:58:01,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {148#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !(sll_create_~len#1 > 0); {146#false} is VALID [2022-02-20 16:58:01,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {146#false} is VALID [2022-02-20 16:58:01,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {146#false} is VALID [2022-02-20 16:58:01,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#false} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {146#false} is VALID [2022-02-20 16:58:01,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#false} sll_length_#res#1 := sll_length_~len~0#1; {146#false} is VALID [2022-02-20 16:58:01,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {146#false} is VALID [2022-02-20 16:58:01,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {146#false} is VALID [2022-02-20 16:58:01,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {146#false} assume !false; {146#false} is VALID [2022-02-20 16:58:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:01,223 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:01,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425720813] [2022-02-20 16:58:01,224 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425720813] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:58:01,224 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:58:01,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:58:01,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466155138] [2022-02-20 16:58:01,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:58:01,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:58:01,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:01,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:01,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:58:01,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:01,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:58:01,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:58:01,249 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:01,343 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-02-20 16:58:01,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:58:01,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:58:01,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:58:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-02-20 16:58:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-02-20 16:58:01,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-02-20 16:58:01,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:01,394 INFO L225 Difference]: With dead ends: 43 [2022-02-20 16:58:01,395 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 16:58:01,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:58:01,401 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:58:01,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 42 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:58:01,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 16:58:01,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2022-02-20 16:58:01,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:58:01,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,416 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,416 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:01,418 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-20 16:58:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-02-20 16:58:01,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:01,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:01,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 35 states. [2022-02-20 16:58:01,422 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 35 states. [2022-02-20 16:58:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:01,426 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-20 16:58:01,426 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-02-20 16:58:01,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:01,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:01,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:58:01,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:58:01,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-20 16:58:01,430 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 14 [2022-02-20 16:58:01,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:58:01,431 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-20 16:58:01,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:58:01,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:58:01,433 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:01,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:01,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:58:01,434 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:01,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:01,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1149244957, now seen corresponding path program 1 times [2022-02-20 16:58:01,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:01,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643012901] [2022-02-20 16:58:01,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:01,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:01,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {313#true} is VALID [2022-02-20 16:58:01,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {315#(= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:01,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#(= |ULTIMATE.start_main_~len~1#1| 2)} main_#t~short9#1 := main_~len~1#1 < 32; {315#(= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:01,527 INFO L290 TraceCheckUtils]: 3: Hoare triple {315#(= |ULTIMATE.start_main_~len~1#1| 2)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {315#(= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:01,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {315#(= |ULTIMATE.start_main_~len~1#1| 2)} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {315#(= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:01,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {315#(= |ULTIMATE.start_main_~len~1#1| 2)} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {316#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:58:01,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {316#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {316#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:58:01,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {316#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:58:01,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {316#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} call write~$Pointer$(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, 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;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; {317#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:01,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {317#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {314#false} is VALID [2022-02-20 16:58:01,531 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {314#false} is VALID [2022-02-20 16:58:01,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {314#false} is VALID [2022-02-20 16:58:01,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#false} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {314#false} is VALID [2022-02-20 16:58:01,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#false} sll_length_#res#1 := sll_length_~len~0#1; {314#false} is VALID [2022-02-20 16:58:01,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {314#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {314#false} is VALID [2022-02-20 16:58:01,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {314#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {314#false} is VALID [2022-02-20 16:58:01,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {314#false} assume !false; {314#false} is VALID [2022-02-20 16:58:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:01,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:01,534 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643012901] [2022-02-20 16:58:01,534 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643012901] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:58:01,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934951096] [2022-02-20 16:58:01,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:01,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:01,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:58:01,540 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:58:01,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 16:58:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:01,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:58:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:01,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:58:01,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {313#true} is VALID [2022-02-20 16:58:01,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:01,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} main_#t~short9#1 := main_~len~1#1 < 32; {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:01,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:01,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:01,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {337#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:01,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {337#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {337#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:01,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {337#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:01,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} call write~$Pointer$(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, 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;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; {317#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:01,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {317#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {314#false} is VALID [2022-02-20 16:58:01,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {314#false} is VALID [2022-02-20 16:58:01,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {314#false} is VALID [2022-02-20 16:58:01,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#false} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {314#false} is VALID [2022-02-20 16:58:01,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#false} sll_length_#res#1 := sll_length_~len~0#1; {314#false} is VALID [2022-02-20 16:58:01,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {314#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {314#false} is VALID [2022-02-20 16:58:01,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {314#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {314#false} is VALID [2022-02-20 16:58:01,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {314#false} assume !false; {314#false} is VALID [2022-02-20 16:58:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:01,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:58:01,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {314#false} assume !false; {314#false} is VALID [2022-02-20 16:58:01,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {314#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {314#false} is VALID [2022-02-20 16:58:01,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {314#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {314#false} is VALID [2022-02-20 16:58:01,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#false} sll_length_#res#1 := sll_length_~len~0#1; {314#false} is VALID [2022-02-20 16:58:01,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#false} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {314#false} is VALID [2022-02-20 16:58:01,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {314#false} is VALID [2022-02-20 16:58:01,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {314#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {314#false} is VALID [2022-02-20 16:58:01,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {317#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {314#false} is VALID [2022-02-20 16:58:01,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} call write~$Pointer$(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, 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;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; {317#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:01,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {337#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:01,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {337#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {337#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:01,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {337#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:01,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:01,948 INFO L290 TraceCheckUtils]: 3: Hoare triple {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:01,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} main_#t~short9#1 := main_~len~1#1 < 32; {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:01,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {324#(<= 2 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:01,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {313#true} is VALID [2022-02-20 16:58:01,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:01,953 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934951096] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:58:01,954 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:58:01,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-02-20 16:58:01,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780944771] [2022-02-20 16:58:01,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:58:01,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 16:58:01,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:01,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:01,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:01,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:58:01,982 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:01,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:58:01,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:58:01,984 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:02,136 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-02-20 16:58:02,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:58:02,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 16:58:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:58:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-02-20 16:58:02,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2022-02-20 16:58:02,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2022-02-20 16:58:02,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:02,189 INFO L225 Difference]: With dead ends: 48 [2022-02-20 16:58:02,189 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 16:58:02,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:58:02,190 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 56 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:58:02,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:58:02,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 16:58:02,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 21. [2022-02-20 16:58:02,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:58:02,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,200 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,201 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:02,202 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-02-20 16:58:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-02-20 16:58:02,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:02,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:02,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 40 states. [2022-02-20 16:58:02,203 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 40 states. [2022-02-20 16:58:02,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:02,205 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-02-20 16:58:02,205 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-02-20 16:58:02,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:02,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:02,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:58:02,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:58:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-20 16:58:02,207 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 17 [2022-02-20 16:58:02,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:58:02,207 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-20 16:58:02,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,207 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 16:58:02,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:58:02,208 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:02,208 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:02,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:58:02,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:02,428 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:02,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:02,428 INFO L85 PathProgramCache]: Analyzing trace with hash -485609004, now seen corresponding path program 2 times [2022-02-20 16:58:02,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:02,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160721986] [2022-02-20 16:58:02,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:02,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:02,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {603#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {603#true} is VALID [2022-02-20 16:58:02,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {603#true} is VALID [2022-02-20 16:58:02,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} main_#t~short9#1 := main_~len~1#1 < 32; {603#true} is VALID [2022-02-20 16:58:02,522 INFO L290 TraceCheckUtils]: 3: Hoare triple {603#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {603#true} is VALID [2022-02-20 16:58:02,522 INFO L290 TraceCheckUtils]: 4: Hoare triple {603#true} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {603#true} is VALID [2022-02-20 16:58:02,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {603#true} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {603#true} is VALID [2022-02-20 16:58:02,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#true} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {603#true} is VALID [2022-02-20 16:58:02,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#true} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {603#true} is VALID [2022-02-20 16:58:02,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {603#true} call write~$Pointer$(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, 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;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; {603#true} is VALID [2022-02-20 16:58:02,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {603#true} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {605#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 16:58:02,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {605#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {605#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 16:58:02,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {605#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} call write~$Pointer$(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, 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;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; {606#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:02,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {606#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !(sll_create_~len#1 > 0); {606#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:02,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {606#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {607#(not (= 0 |ULTIMATE.start_sll_create_#res#1.base|))} is VALID [2022-02-20 16:58:02,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {607#(not (= 0 |ULTIMATE.start_sll_create_#res#1.base|))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {608#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} is VALID [2022-02-20 16:58:02,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {608#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {604#false} is VALID [2022-02-20 16:58:02,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {604#false} sll_length_#res#1 := sll_length_~len~0#1; {604#false} is VALID [2022-02-20 16:58:02,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {604#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {604#false} is VALID [2022-02-20 16:58:02,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {604#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {604#false} is VALID [2022-02-20 16:58:02,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {604#false} assume !false; {604#false} is VALID [2022-02-20 16:58:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:58:02,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:02,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160721986] [2022-02-20 16:58:02,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160721986] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:58:02,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:58:02,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:58:02,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086127033] [2022-02-20 16:58:02,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:58:02,529 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 16:58:02,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:02,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:02,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:58:02,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:02,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:58:02,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:58:02,564 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:02,683 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-20 16:58:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:58:02,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 16:58:02,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:58:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-02-20 16:58:02,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-02-20 16:58:02,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-02-20 16:58:02,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:02,723 INFO L225 Difference]: With dead ends: 27 [2022-02-20 16:58:02,723 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:58:02,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:58:02,730 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:58:02,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 56 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:58:02,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:58:02,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:58:02,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:58:02,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,744 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,744 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:02,746 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 16:58:02,746 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 16:58:02,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:02,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:02,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 16:58:02,752 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 22 states. [2022-02-20 16:58:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:02,754 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-02-20 16:58:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 16:58:02,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:02,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:02,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:58:02,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:58:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-02-20 16:58:02,756 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2022-02-20 16:58:02,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:58:02,756 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-02-20 16:58:02,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 16:58:02,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:58:02,758 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:02,758 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:02,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:58:02,759 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:02,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash -2117322972, now seen corresponding path program 1 times [2022-02-20 16:58:02,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:02,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817979327] [2022-02-20 16:58:02,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:02,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:02,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {731#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {731#true} is VALID [2022-02-20 16:58:02,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {731#true} is VALID [2022-02-20 16:58:02,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {731#true} main_#t~short9#1 := main_~len~1#1 < 32; {731#true} is VALID [2022-02-20 16:58:02,886 INFO L290 TraceCheckUtils]: 3: Hoare triple {731#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {731#true} is VALID [2022-02-20 16:58:02,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {731#true} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {731#true} is VALID [2022-02-20 16:58:02,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {731#true} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {731#true} is VALID [2022-02-20 16:58:02,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {731#true} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {733#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 16:58:02,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {733#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {733#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 16:58:02,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {733#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} call write~$Pointer$(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, 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;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; {734#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:02,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {734#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {734#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:02,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {734#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {734#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:02,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {734#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} call write~$Pointer$(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, 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;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; {735#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:58:02,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {735#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} assume !(sll_create_~len#1 > 0); {735#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:58:02,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {735#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {736#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|) 0))} is VALID [2022-02-20 16:58:02,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {736#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|) 0))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {737#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0))} is VALID [2022-02-20 16:58:02,895 INFO L290 TraceCheckUtils]: 15: Hoare triple {737#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {738#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} is VALID [2022-02-20 16:58:02,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {738#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {732#false} is VALID [2022-02-20 16:58:02,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {732#false} sll_length_#res#1 := sll_length_~len~0#1; {732#false} is VALID [2022-02-20 16:58:02,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {732#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {732#false} is VALID [2022-02-20 16:58:02,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {732#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {732#false} is VALID [2022-02-20 16:58:02,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-02-20 16:58:02,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:02,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:02,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817979327] [2022-02-20 16:58:02,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817979327] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:58:02,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373208966] [2022-02-20 16:58:02,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:02,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:02,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:58:02,899 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:58:02,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 16:58:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:02,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 16:58:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:02,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:58:03,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:58:03,238 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 16 treesize of output 8 [2022-02-20 16:58:03,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {731#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {731#true} is VALID [2022-02-20 16:58:03,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {731#true} is VALID [2022-02-20 16:58:03,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {731#true} main_#t~short9#1 := main_~len~1#1 < 32; {731#true} is VALID [2022-02-20 16:58:03,248 INFO L290 TraceCheckUtils]: 3: Hoare triple {731#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {731#true} is VALID [2022-02-20 16:58:03,248 INFO L290 TraceCheckUtils]: 4: Hoare triple {731#true} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {731#true} is VALID [2022-02-20 16:58:03,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {731#true} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {731#true} is VALID [2022-02-20 16:58:03,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {731#true} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {733#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 16:58:03,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {733#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {733#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 16:58:03,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {733#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} call write~$Pointer$(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, 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;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; {734#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:03,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {734#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {769#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 16:58:03,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {769#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {769#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 16:58:03,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {769#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} call write~$Pointer$(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, 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;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; {776#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 16:58:03,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {776#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} assume !(sll_create_~len#1 > 0); {776#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 16:58:03,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {783#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0) 0)) (= |ULTIMATE.start_sll_create_#res#1.offset| 0))} is VALID [2022-02-20 16:58:03,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0) 0)) (= |ULTIMATE.start_sll_create_#res#1.offset| 0))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {787#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0) 0)) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} is VALID [2022-02-20 16:58:03,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {787#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0) 0)) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {738#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} is VALID [2022-02-20 16:58:03,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {738#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {732#false} is VALID [2022-02-20 16:58:03,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {732#false} sll_length_#res#1 := sll_length_~len~0#1; {732#false} is VALID [2022-02-20 16:58:03,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {732#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {732#false} is VALID [2022-02-20 16:58:03,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {732#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {732#false} is VALID [2022-02-20 16:58:03,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-02-20 16:58:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:03,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:58:03,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {732#false} assume !false; {732#false} is VALID [2022-02-20 16:58:03,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {732#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {732#false} is VALID [2022-02-20 16:58:03,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {732#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {732#false} is VALID [2022-02-20 16:58:03,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {732#false} sll_length_#res#1 := sll_length_~len~0#1; {732#false} is VALID [2022-02-20 16:58:03,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {738#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {732#false} is VALID [2022-02-20 16:58:03,364 INFO L290 TraceCheckUtils]: 15: Hoare triple {737#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {738#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} is VALID [2022-02-20 16:58:03,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {736#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|) 0))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {737#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0))} is VALID [2022-02-20 16:58:03,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {735#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {736#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|) 0))} is VALID [2022-02-20 16:58:03,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {735#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} assume !(sll_create_~len#1 > 0); {735#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:58:03,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {734#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} call write~$Pointer$(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, 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;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; {735#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:58:03,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {734#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {734#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:03,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {734#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {734#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:03,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {733#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} call write~$Pointer$(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, 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;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; {734#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:03,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {733#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {733#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 16:58:03,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {731#true} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {733#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 16:58:03,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {731#true} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {731#true} is VALID [2022-02-20 16:58:03,369 INFO L290 TraceCheckUtils]: 4: Hoare triple {731#true} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {731#true} is VALID [2022-02-20 16:58:03,369 INFO L290 TraceCheckUtils]: 3: Hoare triple {731#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {731#true} is VALID [2022-02-20 16:58:03,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {731#true} main_#t~short9#1 := main_~len~1#1 < 32; {731#true} is VALID [2022-02-20 16:58:03,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {731#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {731#true} is VALID [2022-02-20 16:58:03,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {731#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {731#true} is VALID [2022-02-20 16:58:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:03,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373208966] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:58:03,370 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:58:03,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 12 [2022-02-20 16:58:03,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261322024] [2022-02-20 16:58:03,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:58:03,372 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 16:58:03,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:03,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:03,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:03,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 16:58:03,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:03,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 16:58:03,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-02-20 16:58:03,397 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:03,684 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-02-20 16:58:03,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:58:03,684 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 16:58:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:58:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-02-20 16:58:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:03,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-02-20 16:58:03,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 33 transitions. [2022-02-20 16:58:03,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:03,713 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:58:03,713 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:58:03,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2022-02-20 16:58:03,714 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:58:03,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 100 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:58:03,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:58:03,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-02-20 16:58:03,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:58:03,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:03,735 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:03,735 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:03,737 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-02-20 16:58:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-20 16:58:03,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:03,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:03,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2022-02-20 16:58:03,738 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states. [2022-02-20 16:58:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:03,739 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-02-20 16:58:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-20 16:58:03,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:03,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:03,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:58:03,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:58:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-02-20 16:58:03,741 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 21 [2022-02-20 16:58:03,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:58:03,742 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-02-20 16:58:03,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:03,742 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-20 16:58:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:58:03,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:03,743 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:03,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:58:03,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:03,960 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:03,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:03,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1160848428, now seen corresponding path program 2 times [2022-02-20 16:58:03,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:03,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351587700] [2022-02-20 16:58:03,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:03,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:04,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {1002#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1002#true} is VALID [2022-02-20 16:58:04,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {1002#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} main_#t~short9#1 := main_~len~1#1 < 32; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} call write~$Pointer$(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, 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;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; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} call write~$Pointer$(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, 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;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; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !(sll_create_~len#1 > 0); {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {1005#(and (= |ULTIMATE.start_sll_length_~len~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} is VALID [2022-02-20 16:58:04,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {1005#(and (= |ULTIMATE.start_sll_length_~len~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1006#(and (<= 1 |ULTIMATE.start_sll_length_~len~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0) (<= |ULTIMATE.start_sll_length_~len~0#1| 1))} is VALID [2022-02-20 16:58:04,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {1006#(and (<= 1 |ULTIMATE.start_sll_length_~len~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0) (<= |ULTIMATE.start_sll_length_~len~0#1| 1))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1007#(and (<= |ULTIMATE.start_sll_length_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_length_~len~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} is VALID [2022-02-20 16:58:04,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {1007#(and (<= |ULTIMATE.start_sll_length_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_length_~len~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {1007#(and (<= |ULTIMATE.start_sll_length_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_length_~len~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} is VALID [2022-02-20 16:58:04,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {1007#(and (<= |ULTIMATE.start_sll_length_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_length_~len~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} sll_length_#res#1 := sll_length_~len~0#1; {1008#(and (<= 2 |ULTIMATE.start_sll_length_#res#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0) (<= |ULTIMATE.start_sll_length_#res#1| 2))} is VALID [2022-02-20 16:58:04,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {1008#(and (<= 2 |ULTIMATE.start_sll_length_#res#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0) (<= |ULTIMATE.start_sll_length_#res#1| 2))} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {1009#(and (<= |ULTIMATE.start_main_#t~ret12#1| 2) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_main_#t~ret12#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} is VALID [2022-02-20 16:58:04,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {1009#(and (<= |ULTIMATE.start_main_#t~ret12#1| 2) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_main_#t~ret12#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {1003#false} is VALID [2022-02-20 16:58:04,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {1003#false} assume !false; {1003#false} is VALID [2022-02-20 16:58:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:58:04,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:04,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351587700] [2022-02-20 16:58:04,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351587700] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:58:04,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40793936] [2022-02-20 16:58:04,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:58:04,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:04,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:58:04,114 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:58:04,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 16:58:04,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:58:04,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:58:04,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 16:58:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:04,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:58:04,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {1002#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1002#true} is VALID [2022-02-20 16:58:04,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {1002#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} main_#t~short9#1 := main_~len~1#1 < 32; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,447 INFO L290 TraceCheckUtils]: 4: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} call write~$Pointer$(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, 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;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; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} call write~$Pointer$(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, 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;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; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !(sll_create_~len#1 > 0); {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {1005#(and (= |ULTIMATE.start_sll_length_~len~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} is VALID [2022-02-20 16:58:04,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {1005#(and (= |ULTIMATE.start_sll_length_~len~0#1| 0) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1006#(and (<= 1 |ULTIMATE.start_sll_length_~len~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0) (<= |ULTIMATE.start_sll_length_~len~0#1| 1))} is VALID [2022-02-20 16:58:04,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {1006#(and (<= 1 |ULTIMATE.start_sll_length_~len~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0) (<= |ULTIMATE.start_sll_length_~len~0#1| 1))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1007#(and (<= |ULTIMATE.start_sll_length_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_length_~len~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} is VALID [2022-02-20 16:58:04,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {1007#(and (<= |ULTIMATE.start_sll_length_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_length_~len~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {1007#(and (<= |ULTIMATE.start_sll_length_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_length_~len~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} is VALID [2022-02-20 16:58:04,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {1007#(and (<= |ULTIMATE.start_sll_length_~len~0#1| 2) (<= 2 |ULTIMATE.start_sll_length_~len~0#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} sll_length_#res#1 := sll_length_~len~0#1; {1008#(and (<= 2 |ULTIMATE.start_sll_length_#res#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0) (<= |ULTIMATE.start_sll_length_#res#1| 2))} is VALID [2022-02-20 16:58:04,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {1008#(and (<= 2 |ULTIMATE.start_sll_length_#res#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0) (<= |ULTIMATE.start_sll_length_#res#1| 2))} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {1009#(and (<= |ULTIMATE.start_main_#t~ret12#1| 2) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_main_#t~ret12#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} is VALID [2022-02-20 16:58:04,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {1009#(and (<= |ULTIMATE.start_main_#t~ret12#1| 2) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_main_#t~ret12#1|) (= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0))} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {1003#false} is VALID [2022-02-20 16:58:04,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {1003#false} assume !false; {1003#false} is VALID [2022-02-20 16:58:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:58:04,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:58:04,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {1003#false} assume !false; {1003#false} is VALID [2022-02-20 16:58:04,572 INFO L290 TraceCheckUtils]: 20: Hoare triple {1079#(= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_main_#t~ret12#1|)} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {1003#false} is VALID [2022-02-20 16:58:04,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {1083#(= |ULTIMATE.start_sll_length_#res#1| |ULTIMATE.start_main_~len~1#1|)} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {1079#(= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_main_#t~ret12#1|)} is VALID [2022-02-20 16:58:04,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {1087#(= |ULTIMATE.start_sll_length_~len~0#1| |ULTIMATE.start_main_~len~1#1|)} sll_length_#res#1 := sll_length_~len~0#1; {1083#(= |ULTIMATE.start_sll_length_#res#1| |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:04,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {1087#(= |ULTIMATE.start_sll_length_~len~0#1| |ULTIMATE.start_main_~len~1#1|)} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {1087#(= |ULTIMATE.start_sll_length_~len~0#1| |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:04,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {1094#(= |ULTIMATE.start_main_~len~1#1| (+ |ULTIMATE.start_sll_length_~len~0#1| 1))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1087#(= |ULTIMATE.start_sll_length_~len~0#1| |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:04,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {1098#(= |ULTIMATE.start_main_~len~1#1| (+ |ULTIMATE.start_sll_length_~len~0#1| 2))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1094#(= |ULTIMATE.start_main_~len~1#1| (+ |ULTIMATE.start_sll_length_~len~0#1| 1))} is VALID [2022-02-20 16:58:04,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {1098#(= |ULTIMATE.start_main_~len~1#1| (+ |ULTIMATE.start_sll_length_~len~0#1| 2))} is VALID [2022-02-20 16:58:04,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !(sll_create_~len#1 > 0); {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} call write~$Pointer$(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, 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;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; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} call write~$Pointer$(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, 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;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; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,582 INFO L290 TraceCheckUtils]: 3: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} main_#t~short9#1 := main_~len~1#1 < 32; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {1002#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {1004#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:04,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {1002#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1002#true} is VALID [2022-02-20 16:58:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:58:04,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40793936] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:58:04,583 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:58:04,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-02-20 16:58:04,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016442085] [2022-02-20 16:58:04,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:58:04,584 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 16:58:04,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:04,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:04,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:04,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 16:58:04,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:04,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 16:58:04,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 16:58:04,608 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:04,871 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-02-20 16:58:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:58:04,872 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 16:58:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:58:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-02-20 16:58:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-02-20 16:58:04,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-02-20 16:58:04,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:04,915 INFO L225 Difference]: With dead ends: 50 [2022-02-20 16:58:04,915 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 16:58:04,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-02-20 16:58:04,916 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:58:04,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 120 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:58:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 16:58:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-02-20 16:58:04,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:58:04,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:04,939 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:04,939 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:04,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:04,941 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-02-20 16:58:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-02-20 16:58:04,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:04,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:04,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states. [2022-02-20 16:58:04,942 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states. [2022-02-20 16:58:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:04,943 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-02-20 16:58:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-02-20 16:58:04,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:04,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:04,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:58:04,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:58:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-02-20 16:58:04,946 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 22 [2022-02-20 16:58:04,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:58:04,946 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-02-20 16:58:04,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:04,946 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 16:58:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 16:58:04,947 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:04,947 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:04,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:58:05,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:05,160 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:05,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:05,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1574908636, now seen corresponding path program 3 times [2022-02-20 16:58:05,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:05,161 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094337402] [2022-02-20 16:58:05,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:05,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:05,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {1363#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1363#true} is VALID [2022-02-20 16:58:05,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {1363#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {1363#true} is VALID [2022-02-20 16:58:05,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {1363#true} main_#t~short9#1 := main_~len~1#1 < 32; {1363#true} is VALID [2022-02-20 16:58:05,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {1363#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {1363#true} is VALID [2022-02-20 16:58:05,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {1363#true} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {1363#true} is VALID [2022-02-20 16:58:05,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {1363#true} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1365#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:05,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {1365#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1366#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 16:58:05,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {1366#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1366#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 16:58:05,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {1366#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} call write~$Pointer$(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, 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;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; {1367#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:05,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {1367#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1368#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:05,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {1368#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1368#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:05,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {1368#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} call write~$Pointer$(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, 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;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; {1369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} is VALID [2022-02-20 16:58:05,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {1369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} assume !(sll_create_~len#1 > 0); {1369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} is VALID [2022-02-20 16:58:05,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {1369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1370#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) 0))} is VALID [2022-02-20 16:58:05,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {1370#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) 0))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {1371#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0))} is VALID [2022-02-20 16:58:05,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {1371#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1372#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0))} is VALID [2022-02-20 16:58:05,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {1372#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1373#(and (= |ULTIMATE.start_sll_length_~head#1.base| 0) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} is VALID [2022-02-20 16:58:05,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {1373#(and (= |ULTIMATE.start_sll_length_~head#1.base| 0) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1364#false} is VALID [2022-02-20 16:58:05,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {1364#false} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {1364#false} is VALID [2022-02-20 16:58:05,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {1364#false} sll_length_#res#1 := sll_length_~len~0#1; {1364#false} is VALID [2022-02-20 16:58:05,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {1364#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {1364#false} is VALID [2022-02-20 16:58:05,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {1364#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {1364#false} is VALID [2022-02-20 16:58:05,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {1364#false} assume !false; {1364#false} is VALID [2022-02-20 16:58:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:05,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:05,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094337402] [2022-02-20 16:58:05,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094337402] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:58:05,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249700265] [2022-02-20 16:58:05,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 16:58:05,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:05,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:58:05,369 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:58:05,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 16:58:05,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 16:58:05,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:58:05,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 62 conjunts are in the unsatisfiable core [2022-02-20 16:58:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:05,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:58:05,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 16:58:05,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:58:05,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:58:05,603 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 16:58:05,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 16:58:05,716 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 19 treesize of output 18 [2022-02-20 16:58:05,722 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 23 treesize of output 22 [2022-02-20 16:58:06,039 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-02-20 16:58:06,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2022-02-20 16:58:06,077 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 16:58:06,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-02-20 16:58:06,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {1363#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1363#true} is VALID [2022-02-20 16:58:06,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {1363#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {1363#true} is VALID [2022-02-20 16:58:06,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {1363#true} main_#t~short9#1 := main_~len~1#1 < 32; {1363#true} is VALID [2022-02-20 16:58:06,114 INFO L290 TraceCheckUtils]: 3: Hoare triple {1363#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {1363#true} is VALID [2022-02-20 16:58:06,114 INFO L290 TraceCheckUtils]: 4: Hoare triple {1363#true} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {1363#true} is VALID [2022-02-20 16:58:06,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {1363#true} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1365#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:06,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {1365#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1395#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 16:58:06,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {1395#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1395#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 16:58:06,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {1395#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} call write~$Pointer$(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, 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;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; {1402#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:06,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {1402#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1406#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:06,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {1406#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1406#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:06,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {1406#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} call write~$Pointer$(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, 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;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; {1413#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:06,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {1413#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} assume !(sll_create_~len#1 > 0); {1413#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:06,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {1413#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1420#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 0)))} is VALID [2022-02-20 16:58:06,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {1420#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0)) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 0)))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {1424#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0)) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0) |ULTIMATE.start_sll_length_~head#1.base|)) (= |ULTIMATE.start_sll_length_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0)) 0) 0))} is VALID [2022-02-20 16:58:06,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {1424#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0)) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0) |ULTIMATE.start_sll_length_~head#1.base|)) (= |ULTIMATE.start_sll_length_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0)) 0) 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1428#(exists ((|v_ULTIMATE.start_sll_length_~head#1.base_13| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_13|) 0) |v_ULTIMATE.start_sll_length_~head#1.base_13|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_13|) 0)) 0) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_13|) 0) |ULTIMATE.start_sll_length_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_length_~head#1.base_13|) 0) |ULTIMATE.start_sll_length_~head#1.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_13|) 0)) 0) 0) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_length_~head#1.base_13|) 0) 0)))} is VALID [2022-02-20 16:58:06,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {1428#(exists ((|v_ULTIMATE.start_sll_length_~head#1.base_13| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_13|) 0) |v_ULTIMATE.start_sll_length_~head#1.base_13|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_13|) 0)) 0) 0) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_13|) 0) |ULTIMATE.start_sll_length_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_length_~head#1.base_13|) 0) |ULTIMATE.start_sll_length_~head#1.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_13|) 0)) 0) 0) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_length_~head#1.base_13|) 0) 0)))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1373#(and (= |ULTIMATE.start_sll_length_~head#1.base| 0) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} is VALID [2022-02-20 16:58:06,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {1373#(and (= |ULTIMATE.start_sll_length_~head#1.base| 0) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1364#false} is VALID [2022-02-20 16:58:06,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {1364#false} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {1364#false} is VALID [2022-02-20 16:58:06,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {1364#false} sll_length_#res#1 := sll_length_~len~0#1; {1364#false} is VALID [2022-02-20 16:58:06,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {1364#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {1364#false} is VALID [2022-02-20 16:58:06,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {1364#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {1364#false} is VALID [2022-02-20 16:58:06,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {1364#false} assume !false; {1364#false} is VALID [2022-02-20 16:58:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:58:06,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:58:08,286 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0)))) is different from false [2022-02-20 16:58:08,757 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 10 treesize of output 8 [2022-02-20 16:58:08,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {1364#false} assume !false; {1364#false} is VALID [2022-02-20 16:58:08,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {1364#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {1364#false} is VALID [2022-02-20 16:58:08,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {1364#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {1364#false} is VALID [2022-02-20 16:58:08,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {1364#false} sll_length_#res#1 := sll_length_~len~0#1; {1364#false} is VALID [2022-02-20 16:58:08,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {1364#false} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {1364#false} is VALID [2022-02-20 16:58:08,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {1373#(and (= |ULTIMATE.start_sll_length_~head#1.base| 0) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1364#false} is VALID [2022-02-20 16:58:08,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {1372#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1373#(and (= |ULTIMATE.start_sll_length_~head#1.base| 0) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} is VALID [2022-02-20 16:58:08,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {1371#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1372#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0))} is VALID [2022-02-20 16:58:08,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {1370#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) 0))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {1371#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0))} is VALID [2022-02-20 16:58:08,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {1369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1370#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) 0))} is VALID [2022-02-20 16:58:08,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {1369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} assume !(sll_create_~len#1 > 0); {1369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} is VALID [2022-02-20 16:58:08,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {1483#(and (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} call write~$Pointer$(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, 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;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; {1369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} is VALID [2022-02-20 16:58:08,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {1483#(and (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1483#(and (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:58:08,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {1490#(forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0)) (and (= (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| (store (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0 |ULTIMATE.start_sll_create_~head~0#1.base|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= (select (select (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| (store (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1483#(and (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:58:08,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {1494#(forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0)) (and (or (and (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)) (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (or (not (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))))) (or (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (and (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))))))} call write~$Pointer$(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, 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;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; {1490#(forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0)) (and (= (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| (store (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0 |ULTIMATE.start_sll_create_~head~0#1.base|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= (select (select (store |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| (store (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))))} is VALID [2022-02-20 16:58:08,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {1494#(forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0)) (and (or (and (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)) (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (or (not (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))))) (or (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (and (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))))))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1494#(forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0)) (and (or (and (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)) (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (or (not (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))))) (or (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (and (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))))))} is VALID [2022-02-20 16:58:08,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {1365#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1494#(forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0)) (and (or (and (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)) (and (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (or (not (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))))) (or (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (and (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))))))} is VALID [2022-02-20 16:58:08,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {1363#true} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1365#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:08,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {1363#true} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {1363#true} is VALID [2022-02-20 16:58:08,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {1363#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {1363#true} is VALID [2022-02-20 16:58:08,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {1363#true} main_#t~short9#1 := main_~len~1#1 < 32; {1363#true} is VALID [2022-02-20 16:58:08,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {1363#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {1363#true} is VALID [2022-02-20 16:58:08,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {1363#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1363#true} is VALID [2022-02-20 16:58:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-20 16:58:08,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249700265] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:58:08,838 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:58:08,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2022-02-20 16:58:08,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573997175] [2022-02-20 16:58:08,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:58:08,840 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 16:58:08,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:08,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:08,896 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 16:58:08,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-20 16:58:08,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:08,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-20 16:58:08,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=331, Unknown=1, NotChecked=36, Total=420 [2022-02-20 16:58:08,898 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:11,058 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| Int)) (or (and (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_13|) 0)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-02-20 16:58:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:11,428 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2022-02-20 16:58:11,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 16:58:11,429 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 16:58:11,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:58:11,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:11,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-02-20 16:58:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-02-20 16:58:11,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2022-02-20 16:58:11,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:11,472 INFO L225 Difference]: With dead ends: 63 [2022-02-20 16:58:11,472 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 16:58:11,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=78, Invalid=434, Unknown=2, NotChecked=86, Total=600 [2022-02-20 16:58:11,473 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:58:11,473 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 179 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-02-20 16:58:11,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 16:58:11,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-02-20 16:58:11,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:58:11,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:11,503 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:11,503 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:11,505 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-02-20 16:58:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-02-20 16:58:11,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:11,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:11,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 52 states. [2022-02-20 16:58:11,506 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 52 states. [2022-02-20 16:58:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:11,508 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-02-20 16:58:11,509 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-02-20 16:58:11,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:11,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:11,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:58:11,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:58:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-02-20 16:58:11,511 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 23 [2022-02-20 16:58:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:58:11,511 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-02-20 16:58:11,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 21 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:11,512 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-20 16:58:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:58:11,513 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:11,513 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:11,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:58:11,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:11,729 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:11,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2090698365, now seen corresponding path program 1 times [2022-02-20 16:58:11,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:11,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185869885] [2022-02-20 16:58:11,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:11,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:11,817 INFO L290 TraceCheckUtils]: 0: Hoare triple {1792#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1792#true} is VALID [2022-02-20 16:58:11,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {1794#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:11,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {1794#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} main_#t~short9#1 := main_~len~1#1 < 32; {1794#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:11,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {1794#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {1794#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:11,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {1794#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !!main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1;main_#t~post10#1 := main_~len~1#1;main_~len~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:11,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} main_#t~short9#1 := main_~len~1#1 < 32; {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:11,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:11,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:11,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:11,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:11,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:11,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} call write~$Pointer$(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, 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;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; {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:11,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:11,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:11,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} call write~$Pointer$(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, 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;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; {1798#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:11,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {1798#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {1793#false} is VALID [2022-02-20 16:58:11,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {1793#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1793#false} is VALID [2022-02-20 16:58:11,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {1793#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {1793#false} is VALID [2022-02-20 16:58:11,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {1793#false} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1793#false} is VALID [2022-02-20 16:58:11,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {1793#false} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1793#false} is VALID [2022-02-20 16:58:11,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {1793#false} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {1793#false} is VALID [2022-02-20 16:58:11,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {1793#false} sll_length_#res#1 := sll_length_~len~0#1; {1793#false} is VALID [2022-02-20 16:58:11,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {1793#false} is VALID [2022-02-20 16:58:11,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {1793#false} is VALID [2022-02-20 16:58:11,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-02-20 16:58:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:58:11,826 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:11,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185869885] [2022-02-20 16:58:11,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185869885] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:58:11,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069056368] [2022-02-20 16:58:11,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:11,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:11,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:58:11,828 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:58:11,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 16:58:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:11,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:58:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:11,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:58:12,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {1792#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1792#true} is VALID [2022-02-20 16:58:12,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {1805#(<= 2 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:12,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {1805#(<= 2 |ULTIMATE.start_main_~len~1#1|)} main_#t~short9#1 := main_~len~1#1 < 32; {1805#(<= 2 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:12,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {1805#(<= 2 |ULTIMATE.start_main_~len~1#1|)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {1805#(<= 2 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:12,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {1805#(<= 2 |ULTIMATE.start_main_~len~1#1|)} assume !!main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1;main_#t~post10#1 := main_~len~1#1;main_~len~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:12,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} main_#t~short9#1 := main_~len~1#1 < 32; {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:12,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:12,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:12,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:12,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:12,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:12,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} call write~$Pointer$(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, 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;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; {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:12,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:12,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:12,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} call write~$Pointer$(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, 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;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; {1798#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:12,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {1798#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {1793#false} is VALID [2022-02-20 16:58:12,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {1793#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1793#false} is VALID [2022-02-20 16:58:12,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {1793#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {1793#false} is VALID [2022-02-20 16:58:12,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {1793#false} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1793#false} is VALID [2022-02-20 16:58:12,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {1793#false} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1793#false} is VALID [2022-02-20 16:58:12,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {1793#false} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {1793#false} is VALID [2022-02-20 16:58:12,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {1793#false} sll_length_#res#1 := sll_length_~len~0#1; {1793#false} is VALID [2022-02-20 16:58:12,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {1793#false} is VALID [2022-02-20 16:58:12,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {1793#false} is VALID [2022-02-20 16:58:12,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-02-20 16:58:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:58:12,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:58:12,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {1793#false} assume !false; {1793#false} is VALID [2022-02-20 16:58:12,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {1793#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {1793#false} is VALID [2022-02-20 16:58:12,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {1793#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {1793#false} is VALID [2022-02-20 16:58:12,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {1793#false} sll_length_#res#1 := sll_length_~len~0#1; {1793#false} is VALID [2022-02-20 16:58:12,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {1793#false} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {1793#false} is VALID [2022-02-20 16:58:12,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {1793#false} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1793#false} is VALID [2022-02-20 16:58:12,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {1793#false} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {1793#false} is VALID [2022-02-20 16:58:12,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {1793#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {1793#false} is VALID [2022-02-20 16:58:12,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {1793#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1793#false} is VALID [2022-02-20 16:58:12,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {1798#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {1793#false} is VALID [2022-02-20 16:58:12,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} call write~$Pointer$(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, 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;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; {1798#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:12,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:12,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:12,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} call write~$Pointer$(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, 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;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; {1797#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:12,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:12,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:12,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1796#(<= 3 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:58:12,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:12,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:12,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} main_#t~short9#1 := main_~len~1#1 < 32; {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:12,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {1805#(<= 2 |ULTIMATE.start_main_~len~1#1|)} assume !!main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1;main_#t~post10#1 := main_~len~1#1;main_~len~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1795#(<= 3 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:12,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {1805#(<= 2 |ULTIMATE.start_main_~len~1#1|)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {1805#(<= 2 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:12,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {1805#(<= 2 |ULTIMATE.start_main_~len~1#1|)} main_#t~short9#1 := main_~len~1#1 < 32; {1805#(<= 2 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:12,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {1805#(<= 2 |ULTIMATE.start_main_~len~1#1|)} is VALID [2022-02-20 16:58:12,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {1792#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {1792#true} is VALID [2022-02-20 16:58:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:58:12,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069056368] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:58:12,226 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:58:12,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-02-20 16:58:12,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641278937] [2022-02-20 16:58:12,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:58:12,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 16:58:12,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:12,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:12,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:12,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:58:12,253 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:12,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:58:12,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:58:12,254 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:12,508 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-02-20 16:58:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:58:12,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 16:58:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:58:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-02-20 16:58:12,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 58 transitions. [2022-02-20 16:58:12,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 58 transitions. [2022-02-20 16:58:12,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:12,563 INFO L225 Difference]: With dead ends: 61 [2022-02-20 16:58:12,563 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 16:58:12,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-02-20 16:58:12,564 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:58:12,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 123 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:58:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 16:58:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2022-02-20 16:58:12,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:58:12,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 43 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:12,597 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 43 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:12,597 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 43 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:12,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:12,599 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-02-20 16:58:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-02-20 16:58:12,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:12,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:12,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 16:58:12,601 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 16:58:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:12,603 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-02-20 16:58:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2022-02-20 16:58:12,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:12,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:12,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:58:12,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:58:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-02-20 16:58:12,605 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 25 [2022-02-20 16:58:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:58:12,605 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-02-20 16:58:12,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-02-20 16:58:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 16:58:12,606 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:12,606 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:12,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:58:12,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:12,819 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:12,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:12,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1224539237, now seen corresponding path program 4 times [2022-02-20 16:58:12,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:12,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666918278] [2022-02-20 16:58:12,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:12,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:12,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {2209#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2209#true} is VALID [2022-02-20 16:58:12,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {2209#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {2211#(= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:12,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {2211#(= |ULTIMATE.start_main_~len~1#1| 2)} main_#t~short9#1 := main_~len~1#1 < 32; {2211#(= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:12,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {2211#(= |ULTIMATE.start_main_~len~1#1| 2)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {2211#(= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:12,897 INFO L290 TraceCheckUtils]: 4: Hoare triple {2211#(= |ULTIMATE.start_main_~len~1#1| 2)} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {2211#(= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:12,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {2211#(= |ULTIMATE.start_main_~len~1#1| 2)} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2212#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:58:12,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {2212#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2212#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:58:12,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {2212#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2212#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:58:12,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {2212#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} call write~$Pointer$(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, 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;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; {2213#(<= |ULTIMATE.start_sll_create_~len#1| 1)} is VALID [2022-02-20 16:58:12,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {2213#(<= |ULTIMATE.start_sll_create_~len#1| 1)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2213#(<= |ULTIMATE.start_sll_create_~len#1| 1)} is VALID [2022-02-20 16:58:12,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {2213#(<= |ULTIMATE.start_sll_create_~len#1| 1)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2213#(<= |ULTIMATE.start_sll_create_~len#1| 1)} is VALID [2022-02-20 16:58:12,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {2213#(<= |ULTIMATE.start_sll_create_~len#1| 1)} call write~$Pointer$(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, 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;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; {2214#(<= |ULTIMATE.start_sll_create_~len#1| 0)} is VALID [2022-02-20 16:58:12,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {2214#(<= |ULTIMATE.start_sll_create_~len#1| 0)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2210#false} is VALID [2022-02-20 16:58:12,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {2210#false} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2210#false} is VALID [2022-02-20 16:58:12,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {2210#false} call write~$Pointer$(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, 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;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; {2210#false} is VALID [2022-02-20 16:58:12,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {2210#false} assume !(sll_create_~len#1 > 0); {2210#false} is VALID [2022-02-20 16:58:12,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {2210#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2210#false} is VALID [2022-02-20 16:58:12,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {2210#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {2210#false} is VALID [2022-02-20 16:58:12,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {2210#false} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2210#false} is VALID [2022-02-20 16:58:12,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {2210#false} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2210#false} is VALID [2022-02-20 16:58:12,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {2210#false} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2210#false} is VALID [2022-02-20 16:58:12,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {2210#false} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {2210#false} is VALID [2022-02-20 16:58:12,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {2210#false} sll_length_#res#1 := sll_length_~len~0#1; {2210#false} is VALID [2022-02-20 16:58:12,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {2210#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {2210#false} is VALID [2022-02-20 16:58:12,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {2210#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {2210#false} is VALID [2022-02-20 16:58:12,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {2210#false} assume !false; {2210#false} is VALID [2022-02-20 16:58:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:58:12,904 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:12,904 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666918278] [2022-02-20 16:58:12,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666918278] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:58:12,905 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132498390] [2022-02-20 16:58:12,905 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 16:58:12,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:12,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:58:12,906 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:58:12,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 16:58:12,966 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 16:58:12,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:58:12,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:58:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:12,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:58:13,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {2209#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2209#true} is VALID [2022-02-20 16:58:13,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {2209#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {2221#(<= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:13,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {2221#(<= |ULTIMATE.start_main_~len~1#1| 2)} main_#t~short9#1 := main_~len~1#1 < 32; {2221#(<= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:13,093 INFO L290 TraceCheckUtils]: 3: Hoare triple {2221#(<= |ULTIMATE.start_main_~len~1#1| 2)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {2221#(<= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:13,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {2221#(<= |ULTIMATE.start_main_~len~1#1| 2)} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {2221#(<= |ULTIMATE.start_main_~len~1#1| 2)} is VALID [2022-02-20 16:58:13,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {2221#(<= |ULTIMATE.start_main_~len~1#1| 2)} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2234#(<= |ULTIMATE.start_sll_create_~len#1| 2)} is VALID [2022-02-20 16:58:13,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {2234#(<= |ULTIMATE.start_sll_create_~len#1| 2)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2234#(<= |ULTIMATE.start_sll_create_~len#1| 2)} is VALID [2022-02-20 16:58:13,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {2234#(<= |ULTIMATE.start_sll_create_~len#1| 2)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2234#(<= |ULTIMATE.start_sll_create_~len#1| 2)} is VALID [2022-02-20 16:58:13,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {2234#(<= |ULTIMATE.start_sll_create_~len#1| 2)} call write~$Pointer$(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, 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;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; {2213#(<= |ULTIMATE.start_sll_create_~len#1| 1)} is VALID [2022-02-20 16:58:13,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {2213#(<= |ULTIMATE.start_sll_create_~len#1| 1)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2213#(<= |ULTIMATE.start_sll_create_~len#1| 1)} is VALID [2022-02-20 16:58:13,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {2213#(<= |ULTIMATE.start_sll_create_~len#1| 1)} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2213#(<= |ULTIMATE.start_sll_create_~len#1| 1)} is VALID [2022-02-20 16:58:13,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {2213#(<= |ULTIMATE.start_sll_create_~len#1| 1)} call write~$Pointer$(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, 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;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; {2214#(<= |ULTIMATE.start_sll_create_~len#1| 0)} is VALID [2022-02-20 16:58:13,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {2214#(<= |ULTIMATE.start_sll_create_~len#1| 0)} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2210#false} is VALID [2022-02-20 16:58:13,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {2210#false} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2210#false} is VALID [2022-02-20 16:58:13,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {2210#false} call write~$Pointer$(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, 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;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; {2210#false} is VALID [2022-02-20 16:58:13,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {2210#false} assume !(sll_create_~len#1 > 0); {2210#false} is VALID [2022-02-20 16:58:13,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {2210#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2210#false} is VALID [2022-02-20 16:58:13,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {2210#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {2210#false} is VALID [2022-02-20 16:58:13,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {2210#false} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2210#false} is VALID [2022-02-20 16:58:13,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {2210#false} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2210#false} is VALID [2022-02-20 16:58:13,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {2210#false} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2210#false} is VALID [2022-02-20 16:58:13,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {2210#false} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {2210#false} is VALID [2022-02-20 16:58:13,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {2210#false} sll_length_#res#1 := sll_length_~len~0#1; {2210#false} is VALID [2022-02-20 16:58:13,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {2210#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {2210#false} is VALID [2022-02-20 16:58:13,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {2210#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {2210#false} is VALID [2022-02-20 16:58:13,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {2210#false} assume !false; {2210#false} is VALID [2022-02-20 16:58:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:58:13,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:58:13,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132498390] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:58:13,103 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 16:58:13,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-02-20 16:58:13,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623463072] [2022-02-20 16:58:13,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:58:13,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 16:58:13,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:13,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:13,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:13,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:58:13,123 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:13,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:58:13,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:58:13,123 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:13,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:13,242 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-02-20 16:58:13,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:58:13,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 16:58:13,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:58:13,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-02-20 16:58:13,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-02-20 16:58:13,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-02-20 16:58:13,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:13,302 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:58:13,302 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:58:13,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:58:13,303 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 40 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 16:58:13,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 40 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:58:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:58:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 16:58:13,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:58:13,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:13,333 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:13,334 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:13,335 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:58:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:58:13,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:13,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:13,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 16:58:13,336 INFO L87 Difference]: Start difference. First operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 16:58:13,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:13,337 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:58:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:58:13,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:13,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:13,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:58:13,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:58:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-02-20 16:58:13,338 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 26 [2022-02-20 16:58:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:58:13,338 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-02-20 16:58:13,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:58:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 16:58:13,339 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:13,339 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:13,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:58:13,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:13,556 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:13,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:13,556 INFO L85 PathProgramCache]: Analyzing trace with hash -517577932, now seen corresponding path program 2 times [2022-02-20 16:58:13,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:13,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489010975] [2022-02-20 16:58:13,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:13,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:13,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {2473#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2473#true} is VALID [2022-02-20 16:58:13,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {2473#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {2473#true} is VALID [2022-02-20 16:58:13,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {2473#true} main_#t~short9#1 := main_~len~1#1 < 32; {2473#true} is VALID [2022-02-20 16:58:13,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {2473#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {2473#true} is VALID [2022-02-20 16:58:13,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {2473#true} assume !!main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1;main_#t~post10#1 := main_~len~1#1;main_~len~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2473#true} is VALID [2022-02-20 16:58:13,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {2473#true} main_#t~short9#1 := main_~len~1#1 < 32; {2473#true} is VALID [2022-02-20 16:58:13,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {2473#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {2473#true} is VALID [2022-02-20 16:58:13,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {2473#true} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {2473#true} is VALID [2022-02-20 16:58:13,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {2473#true} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2473#true} is VALID [2022-02-20 16:58:13,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {2473#true} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2475#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 16:58:13,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {2475#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2475#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 16:58:13,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} call write~$Pointer$(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, 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;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; {2476#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:13,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {2476#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2477#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 16:58:13,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {2477#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2477#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 16:58:13,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {2477#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} call write~$Pointer$(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, 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;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; {2478#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)))} is VALID [2022-02-20 16:58:13,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {2478#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2479#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 16:58:13,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {2479#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2479#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 16:58:13,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {2479#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} call write~$Pointer$(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, 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;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; {2480#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} is VALID [2022-02-20 16:58:13,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {2480#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} assume !(sll_create_~len#1 > 0); {2480#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} is VALID [2022-02-20 16:58:13,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {2480#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2481#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) 0))} is VALID [2022-02-20 16:58:13,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {2481#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) 0))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {2482#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0))} is VALID [2022-02-20 16:58:13,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {2482#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2483#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0))} is VALID [2022-02-20 16:58:13,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {2483#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2484#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} is VALID [2022-02-20 16:58:13,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {2484#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {2474#false} is VALID [2022-02-20 16:58:13,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {2474#false} sll_length_#res#1 := sll_length_~len~0#1; {2474#false} is VALID [2022-02-20 16:58:13,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {2474#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {2474#false} is VALID [2022-02-20 16:58:13,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {2474#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {2474#false} is VALID [2022-02-20 16:58:13,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {2474#false} assume !false; {2474#false} is VALID [2022-02-20 16:58:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:58:13,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:13,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489010975] [2022-02-20 16:58:13,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489010975] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:58:13,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359025328] [2022-02-20 16:58:13,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:58:13,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:13,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:58:13,709 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:58:13,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 16:58:13,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:58:13,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:58:13,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 56 conjunts are in the unsatisfiable core [2022-02-20 16:58:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:13,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:58:13,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 16:58:13,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:58:13,978 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 16:58:13,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 16:58:14,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:58:14,092 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 20 treesize of output 19 [2022-02-20 16:58:14,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:58:14,336 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:58:14,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2022-02-20 16:58:14,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {2473#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2473#true} is VALID [2022-02-20 16:58:14,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {2473#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {2473#true} is VALID [2022-02-20 16:58:14,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {2473#true} main_#t~short9#1 := main_~len~1#1 < 32; {2473#true} is VALID [2022-02-20 16:58:14,359 INFO L290 TraceCheckUtils]: 3: Hoare triple {2473#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {2473#true} is VALID [2022-02-20 16:58:14,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {2473#true} assume !!main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1;main_#t~post10#1 := main_~len~1#1;main_~len~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2473#true} is VALID [2022-02-20 16:58:14,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {2473#true} main_#t~short9#1 := main_~len~1#1 < 32; {2473#true} is VALID [2022-02-20 16:58:14,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {2473#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {2473#true} is VALID [2022-02-20 16:58:14,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {2473#true} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {2473#true} is VALID [2022-02-20 16:58:14,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {2473#true} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2473#true} is VALID [2022-02-20 16:58:14,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {2473#true} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2475#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 16:58:14,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {2475#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2475#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 16:58:14,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} call write~$Pointer$(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, 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;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; {2476#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:14,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {2476#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2524#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 16:58:14,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {2524#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2524#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 16:58:14,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {2524#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} call write~$Pointer$(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, 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;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; {2531#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 16:58:14,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {2531#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2535#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 16:58:14,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {2535#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2535#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 16:58:14,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {2535#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} call write~$Pointer$(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, 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;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; {2542#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:14,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {2542#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} assume !(sll_create_~len#1 > 0); {2542#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:14,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {2542#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2549#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0)) 0))))} is VALID [2022-02-20 16:58:14,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {2549#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0)) 0))))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {2553#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0)) 0) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0) |ULTIMATE.start_sll_length_~head#1.base|)) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} is VALID [2022-02-20 16:58:14,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {2553#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0)) 0) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0) |ULTIMATE.start_sll_length_~head#1.base|)) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2557#(and (exists ((|v_ULTIMATE.start_sll_length_~head#1.base_23| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_23|) 0) |v_ULTIMATE.start_sll_length_~head#1.base_23|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_23|) 0)) 0) 0)) (= |ULTIMATE.start_sll_length_~head#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_23|) 0)))) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} is VALID [2022-02-20 16:58:14,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {2557#(and (exists ((|v_ULTIMATE.start_sll_length_~head#1.base_23| Int)) (and (not (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_23|) 0) |v_ULTIMATE.start_sll_length_~head#1.base_23|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_23|) 0)) 0) 0)) (= |ULTIMATE.start_sll_length_~head#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_23|) 0)))) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2484#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} is VALID [2022-02-20 16:58:14,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {2484#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {2474#false} is VALID [2022-02-20 16:58:14,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {2474#false} sll_length_#res#1 := sll_length_~len~0#1; {2474#false} is VALID [2022-02-20 16:58:14,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {2474#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {2474#false} is VALID [2022-02-20 16:58:14,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {2474#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {2474#false} is VALID [2022-02-20 16:58:14,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {2474#false} assume !false; {2474#false} is VALID [2022-02-20 16:58:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:58:14,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:58:14,720 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 10 treesize of output 8 [2022-02-20 16:58:14,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {2474#false} assume !false; {2474#false} is VALID [2022-02-20 16:58:14,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {2474#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {2474#false} is VALID [2022-02-20 16:58:14,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {2474#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {2474#false} is VALID [2022-02-20 16:58:14,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {2474#false} sll_length_#res#1 := sll_length_~len~0#1; {2474#false} is VALID [2022-02-20 16:58:14,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {2484#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {2474#false} is VALID [2022-02-20 16:58:14,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {2483#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2484#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} is VALID [2022-02-20 16:58:14,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {2482#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2483#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0))} is VALID [2022-02-20 16:58:14,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {2481#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) 0))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {2482#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0))} is VALID [2022-02-20 16:58:14,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {2480#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2481#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) 0))} is VALID [2022-02-20 16:58:14,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {2480#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} assume !(sll_create_~len#1 > 0); {2480#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} is VALID [2022-02-20 16:58:14,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {2606#(not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} call write~$Pointer$(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, 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;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; {2480#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0))} is VALID [2022-02-20 16:58:14,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {2606#(not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2606#(not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:58:14,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {2613#(forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19|) 0)) (not (= (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| (store (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19|) 0 |ULTIMATE.start_sll_create_~head~0#1.base|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2606#(not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|) |ULTIMATE.start_sll_create_~new_head~0#1.offset| |ULTIMATE.start_sll_create_~head~0#1.base|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))} is VALID [2022-02-20 16:58:14,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {2617#(forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19|) 0)) (and (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (and (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))) (or (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (not (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))))))} call write~$Pointer$(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, 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;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; {2613#(forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19|) 0)) (not (= (select (select (store |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| (store (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19|) 0 |ULTIMATE.start_sll_create_~head~0#1.base|)) |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) 0))))} is VALID [2022-02-20 16:58:14,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {2617#(forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19|) 0)) (and (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (and (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))) (or (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (not (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))))))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2617#(forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19|) 0)) (and (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (and (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))) (or (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (not (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))))))} is VALID [2022-02-20 16:58:14,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {2476#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2617#(forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19|) 0)) (and (or (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (and (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))) (or (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (not (= |v_ULTIMATE.start_sll_create_~new_head~0#1.base_19| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))))))} is VALID [2022-02-20 16:58:14,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} call write~$Pointer$(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, 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;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; {2476#(not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:14,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {2475#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2475#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 16:58:14,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {2473#true} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2475#(not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0))} is VALID [2022-02-20 16:58:14,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {2473#true} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2473#true} is VALID [2022-02-20 16:58:14,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {2473#true} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {2473#true} is VALID [2022-02-20 16:58:14,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {2473#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {2473#true} is VALID [2022-02-20 16:58:14,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {2473#true} main_#t~short9#1 := main_~len~1#1 < 32; {2473#true} is VALID [2022-02-20 16:58:14,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {2473#true} assume !!main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1;main_#t~post10#1 := main_~len~1#1;main_~len~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2473#true} is VALID [2022-02-20 16:58:14,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {2473#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {2473#true} is VALID [2022-02-20 16:58:14,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {2473#true} main_#t~short9#1 := main_~len~1#1 < 32; {2473#true} is VALID [2022-02-20 16:58:14,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {2473#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {2473#true} is VALID [2022-02-20 16:58:14,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {2473#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2473#true} is VALID [2022-02-20 16:58:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:58:14,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359025328] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:58:14,790 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:58:14,790 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2022-02-20 16:58:14,790 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030731518] [2022-02-20 16:58:14,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:58:14,791 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 16:58:14,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:14,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:14,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:14,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 16:58:14,828 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:14,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 16:58:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2022-02-20 16:58:14,828 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:15,566 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-02-20 16:58:15,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 16:58:15,567 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 16:58:15,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:58:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2022-02-20 16:58:15,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2022-02-20 16:58:15,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 37 transitions. [2022-02-20 16:58:15,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:15,609 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:58:15,609 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:58:15,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2022-02-20 16:58:15,612 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:58:15,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 209 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 135 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-02-20 16:58:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:58:15,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-02-20 16:58:15,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:58:15,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:15,639 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:15,639 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:15,640 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-20 16:58:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 16:58:15,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:15,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:15,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 16:58:15,641 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 16:58:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:15,641 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-02-20 16:58:15,642 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-02-20 16:58:15,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:15,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:15,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:58:15,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:58:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-02-20 16:58:15,643 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 28 [2022-02-20 16:58:15,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:58:15,643 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-02-20 16:58:15,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-20 16:58:15,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 16:58:15,644 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:15,644 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:15,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 16:58:15,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:15,859 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:15,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1186607556, now seen corresponding path program 3 times [2022-02-20 16:58:15,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:15,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859872122] [2022-02-20 16:58:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:16,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {2836#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2836#true} is VALID [2022-02-20 16:58:16,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {2836#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:16,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} main_#t~short9#1 := main_~len~1#1 < 32; {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:16,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:16,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !!main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1;main_#t~post10#1 := main_~len~1#1;main_~len~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} main_#t~short9#1 := main_~len~1#1 < 32; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} call write~$Pointer$(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, 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;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; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} call write~$Pointer$(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, 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;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; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} call write~$Pointer$(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, 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;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; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !(sll_create_~len#1 > 0); {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {2840#(and (= |ULTIMATE.start_sll_length_~len~0#1| 0) (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {2840#(and (= |ULTIMATE.start_sll_length_~len~0#1| 0) (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2841#(and (<= |ULTIMATE.start_main_~len~1#1| (+ |ULTIMATE.start_sll_length_~len~0#1| 2)) (<= (+ |ULTIMATE.start_sll_length_~len~0#1| 2) |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {2841#(and (<= |ULTIMATE.start_main_~len~1#1| (+ |ULTIMATE.start_sll_length_~len~0#1| 2)) (<= (+ |ULTIMATE.start_sll_length_~len~0#1| 2) |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2842#(and (<= (+ |ULTIMATE.start_sll_length_~len~0#1| 1) |ULTIMATE.start_main_~len~1#1|) (<= |ULTIMATE.start_main_~len~1#1| (+ |ULTIMATE.start_sll_length_~len~0#1| 1)))} is VALID [2022-02-20 16:58:16,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {2842#(and (<= (+ |ULTIMATE.start_sll_length_~len~0#1| 1) |ULTIMATE.start_main_~len~1#1|) (<= |ULTIMATE.start_main_~len~1#1| (+ |ULTIMATE.start_sll_length_~len~0#1| 1)))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2843#(and (<= |ULTIMATE.start_sll_length_~len~0#1| |ULTIMATE.start_main_~len~1#1|) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_sll_length_~len~0#1|))} is VALID [2022-02-20 16:58:16,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {2843#(and (<= |ULTIMATE.start_sll_length_~len~0#1| |ULTIMATE.start_main_~len~1#1|) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_sll_length_~len~0#1|))} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {2843#(and (<= |ULTIMATE.start_sll_length_~len~0#1| |ULTIMATE.start_main_~len~1#1|) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_sll_length_~len~0#1|))} is VALID [2022-02-20 16:58:16,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {2843#(and (<= |ULTIMATE.start_sll_length_~len~0#1| |ULTIMATE.start_main_~len~1#1|) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_sll_length_~len~0#1|))} sll_length_#res#1 := sll_length_~len~0#1; {2844#(and (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_sll_length_#res#1|) (<= |ULTIMATE.start_sll_length_#res#1| |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {2844#(and (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_sll_length_#res#1|) (<= |ULTIMATE.start_sll_length_#res#1| |ULTIMATE.start_main_~len~1#1|))} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {2845#(and (< |ULTIMATE.start_main_#t~ret12#1| (+ |ULTIMATE.start_main_~len~1#1| 1)) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_main_#t~ret12#1|))} is VALID [2022-02-20 16:58:16,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {2845#(and (< |ULTIMATE.start_main_#t~ret12#1| (+ |ULTIMATE.start_main_~len~1#1| 1)) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_main_#t~ret12#1|))} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {2837#false} is VALID [2022-02-20 16:58:16,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {2837#false} assume !false; {2837#false} is VALID [2022-02-20 16:58:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 16:58:16,019 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:16,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859872122] [2022-02-20 16:58:16,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859872122] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:58:16,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850198222] [2022-02-20 16:58:16,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 16:58:16,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:16,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:58:16,020 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:58:16,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 16:58:16,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 16:58:16,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:58:16,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 16:58:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:16,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:58:16,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {2836#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2836#true} is VALID [2022-02-20 16:58:16,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {2836#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:16,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} main_#t~short9#1 := main_~len~1#1 < 32; {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:16,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:16,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !!main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1;main_#t~post10#1 := main_~len~1#1;main_~len~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} main_#t~short9#1 := main_~len~1#1 < 32; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} call write~$Pointer$(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, 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;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; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} call write~$Pointer$(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, 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;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; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} call write~$Pointer$(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, 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;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; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !(sll_create_~len#1 > 0); {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {2840#(and (= |ULTIMATE.start_sll_length_~len~0#1| 0) (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {2840#(and (= |ULTIMATE.start_sll_length_~len~0#1| 0) (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2912#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|) (= (+ (- 1) |ULTIMATE.start_sll_length_~len~0#1|) 0))} is VALID [2022-02-20 16:58:16,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {2912#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|) (= (+ (- 1) |ULTIMATE.start_sll_length_~len~0#1|) 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2916#(and (= |ULTIMATE.start_sll_length_~len~0#1| 2) (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {2916#(and (= |ULTIMATE.start_sll_length_~len~0#1| 2) (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2920#(and (= 2 (+ (- 1) |ULTIMATE.start_sll_length_~len~0#1|)) (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {2920#(and (= 2 (+ (- 1) |ULTIMATE.start_sll_length_~len~0#1|)) (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {2920#(and (= 2 (+ (- 1) |ULTIMATE.start_sll_length_~len~0#1|)) (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {2920#(and (= 2 (+ (- 1) |ULTIMATE.start_sll_length_~len~0#1|)) (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} sll_length_#res#1 := sll_length_~len~0#1; {2927#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|) (= |ULTIMATE.start_sll_length_#res#1| 3))} is VALID [2022-02-20 16:58:16,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {2927#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|) (= |ULTIMATE.start_sll_length_#res#1| 3))} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {2931#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (= 3 |ULTIMATE.start_main_#t~ret12#1|) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {2931#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (= 3 |ULTIMATE.start_main_#t~ret12#1|) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {2837#false} is VALID [2022-02-20 16:58:16,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {2837#false} assume !false; {2837#false} is VALID [2022-02-20 16:58:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 16:58:16,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:58:16,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {2837#false} assume !false; {2837#false} is VALID [2022-02-20 16:58:16,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {2845#(and (< |ULTIMATE.start_main_#t~ret12#1| (+ |ULTIMATE.start_main_~len~1#1| 1)) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_main_#t~ret12#1|))} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {2837#false} is VALID [2022-02-20 16:58:16,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {2844#(and (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_sll_length_#res#1|) (<= |ULTIMATE.start_sll_length_#res#1| |ULTIMATE.start_main_~len~1#1|))} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {2845#(and (< |ULTIMATE.start_main_#t~ret12#1| (+ |ULTIMATE.start_main_~len~1#1| 1)) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_main_#t~ret12#1|))} is VALID [2022-02-20 16:58:16,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {2843#(and (<= |ULTIMATE.start_sll_length_~len~0#1| |ULTIMATE.start_main_~len~1#1|) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_sll_length_~len~0#1|))} sll_length_#res#1 := sll_length_~len~0#1; {2844#(and (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_sll_length_#res#1|) (<= |ULTIMATE.start_sll_length_#res#1| |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {2843#(and (<= |ULTIMATE.start_sll_length_~len~0#1| |ULTIMATE.start_main_~len~1#1|) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_sll_length_~len~0#1|))} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {2843#(and (<= |ULTIMATE.start_sll_length_~len~0#1| |ULTIMATE.start_main_~len~1#1|) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_sll_length_~len~0#1|))} is VALID [2022-02-20 16:58:16,698 INFO L290 TraceCheckUtils]: 23: Hoare triple {2842#(and (<= (+ |ULTIMATE.start_sll_length_~len~0#1| 1) |ULTIMATE.start_main_~len~1#1|) (<= |ULTIMATE.start_main_~len~1#1| (+ |ULTIMATE.start_sll_length_~len~0#1| 1)))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2843#(and (<= |ULTIMATE.start_sll_length_~len~0#1| |ULTIMATE.start_main_~len~1#1|) (<= |ULTIMATE.start_main_~len~1#1| |ULTIMATE.start_sll_length_~len~0#1|))} is VALID [2022-02-20 16:58:16,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {2841#(and (<= |ULTIMATE.start_main_~len~1#1| (+ |ULTIMATE.start_sll_length_~len~0#1| 2)) (<= (+ |ULTIMATE.start_sll_length_~len~0#1| 2) |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2842#(and (<= (+ |ULTIMATE.start_sll_length_~len~0#1| 1) |ULTIMATE.start_main_~len~1#1|) (<= |ULTIMATE.start_main_~len~1#1| (+ |ULTIMATE.start_sll_length_~len~0#1| 1)))} is VALID [2022-02-20 16:58:16,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {2959#(and (<= |ULTIMATE.start_main_~len~1#1| (+ |ULTIMATE.start_sll_length_~len~0#1| 3)) (<= (+ |ULTIMATE.start_sll_length_~len~0#1| 3) |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {2841#(and (<= |ULTIMATE.start_main_~len~1#1| (+ |ULTIMATE.start_sll_length_~len~0#1| 2)) (<= (+ |ULTIMATE.start_sll_length_~len~0#1| 2) |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {2959#(and (<= |ULTIMATE.start_main_~len~1#1| (+ |ULTIMATE.start_sll_length_~len~0#1| 3)) (<= (+ |ULTIMATE.start_sll_length_~len~0#1| 3) |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !(sll_create_~len#1 > 0); {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} call write~$Pointer$(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, 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;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; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} call write~$Pointer$(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, 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;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; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} call write~$Pointer$(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, 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;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; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} main_#t~short9#1 := main_~len~1#1 < 32; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,708 INFO L290 TraceCheckUtils]: 4: Hoare triple {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume !!main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1;main_#t~post10#1 := main_~len~1#1;main_~len~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2839#(and (<= |ULTIMATE.start_main_~len~1#1| 3) (<= 3 |ULTIMATE.start_main_~len~1#1|))} is VALID [2022-02-20 16:58:16,708 INFO L290 TraceCheckUtils]: 3: Hoare triple {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:16,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} main_#t~short9#1 := main_~len~1#1 < 32; {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:16,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {2836#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {2838#(= (+ (- 2) |ULTIMATE.start_main_~len~1#1|) 0)} is VALID [2022-02-20 16:58:16,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {2836#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {2836#true} is VALID [2022-02-20 16:58:16,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 16:58:16,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850198222] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:58:16,709 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:58:16,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2022-02-20 16:58:16,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628242120] [2022-02-20 16:58:16,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:58:16,710 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 16:58:16,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:58:16,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:16,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:16,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 16:58:16,737 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:58:16,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 16:58:16,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-02-20 16:58:16,738 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:17,082 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-02-20 16:58:17,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 16:58:17,082 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 16:58:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:58:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-02-20 16:58:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-02-20 16:58:17,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 51 transitions. [2022-02-20 16:58:17,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:58:17,132 INFO L225 Difference]: With dead ends: 61 [2022-02-20 16:58:17,132 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 16:58:17,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-02-20 16:58:17,133 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:58:17,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 145 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:58:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 16:58:17,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2022-02-20 16:58:17,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:58:17,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:17,184 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:17,184 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:17,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:17,185 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-02-20 16:58:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-02-20 16:58:17,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:17,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:17,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 56 states. [2022-02-20 16:58:17,187 INFO L87 Difference]: Start difference. First operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 56 states. [2022-02-20 16:58:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:58:17,188 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-02-20 16:58:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-02-20 16:58:17,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:58:17,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:58:17,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:58:17,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:58:17,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-02-20 16:58:17,190 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 29 [2022-02-20 16:58:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:58:17,190 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-02-20 16:58:17,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:58:17,191 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-02-20 16:58:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 16:58:17,193 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:58:17,193 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:58:17,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 16:58:17,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 16:58:17,411 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:58:17,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:58:17,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1818217164, now seen corresponding path program 4 times [2022-02-20 16:58:17,412 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:58:17,412 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74527304] [2022-02-20 16:58:17,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:58:17,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:58:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:17,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {3294#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {3294#true} is VALID [2022-02-20 16:58:17,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {3294#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {3294#true} is VALID [2022-02-20 16:58:17,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {3294#true} main_#t~short9#1 := main_~len~1#1 < 32; {3294#true} is VALID [2022-02-20 16:58:17,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {3294#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {3294#true} is VALID [2022-02-20 16:58:17,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {3294#true} assume !!main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1;main_#t~post10#1 := main_~len~1#1;main_~len~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3294#true} is VALID [2022-02-20 16:58:17,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {3294#true} main_#t~short9#1 := main_~len~1#1 < 32; {3294#true} is VALID [2022-02-20 16:58:17,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {3294#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {3294#true} is VALID [2022-02-20 16:58:17,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {3294#true} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {3294#true} is VALID [2022-02-20 16:58:17,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {3294#true} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {3296#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:17,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {3296#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {3297#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 16:58:17,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {3297#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {3297#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 16:58:17,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {3297#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} call write~$Pointer$(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, 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;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; {3298#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 16:58:17,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {3298#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {3299#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 16:58:17,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {3299#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {3299#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 16:58:17,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {3299#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} call write~$Pointer$(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, 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;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; {3300#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:17,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {3300#(and (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {3301#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:17,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {3301#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {3301#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:17,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {3301#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~new_head~0#1.base|) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} call write~$Pointer$(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, 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;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; {3302#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|))) 0) 0)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) |ULTIMATE.start_sll_create_~head~0#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))))} is VALID [2022-02-20 16:58:17,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {3302#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|))) 0) 0)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) |ULTIMATE.start_sll_create_~head~0#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))))} assume !(sll_create_~len#1 > 0); {3302#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|))) 0) 0)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) |ULTIMATE.start_sll_create_~head~0#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))))} is VALID [2022-02-20 16:58:17,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {3302#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|))) 0) 0)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) |ULTIMATE.start_sll_create_~head~0#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {3303#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) 0) (or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|))) 0) 0)) (and (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) |ULTIMATE.start_sll_create_#res#1.base|))))} is VALID [2022-02-20 16:58:17,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {3303#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) 0) (or (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|))) 0) 0)) (and (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) |ULTIMATE.start_sll_create_#res#1.offset|)) |ULTIMATE.start_sll_create_#res#1.base|))))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {3304#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0) (or (and (= |ULTIMATE.start_sll_length_~head#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|))) (= |ULTIMATE.start_sll_length_~head#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|))) 0) 0))))} is VALID [2022-02-20 16:58:17,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {3304#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0) (or (and (= |ULTIMATE.start_sll_length_~head#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|))) (= |ULTIMATE.start_sll_length_~head#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|))) 0) 0))))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {3305#(and (or (and (= |ULTIMATE.start_sll_length_~head#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0) |ULTIMATE.start_sll_length_~head#1.base|)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)))} is VALID [2022-02-20 16:58:17,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {3305#(and (or (and (= |ULTIMATE.start_sll_length_~head#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0) |ULTIMATE.start_sll_length_~head#1.base|)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) 0) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {3306#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0)) (= |ULTIMATE.start_sll_length_~head#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)))) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} is VALID [2022-02-20 16:58:17,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {3306#(and (or (and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0)) (= |ULTIMATE.start_sll_length_~head#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|)))) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {3307#(or (and (= |ULTIMATE.start_sll_length_~head#1.base| 0) (= |ULTIMATE.start_sll_length_~head#1.offset| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0)))} is VALID [2022-02-20 16:58:17,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {3307#(or (and (= |ULTIMATE.start_sll_length_~head#1.base| 0) (= |ULTIMATE.start_sll_length_~head#1.offset| 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) |ULTIMATE.start_sll_length_~head#1.offset|) 0)))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {3308#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} is VALID [2022-02-20 16:58:17,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {3308#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {3295#false} is VALID [2022-02-20 16:58:17,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {3295#false} sll_length_#res#1 := sll_length_~len~0#1; {3295#false} is VALID [2022-02-20 16:58:17,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {3295#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {3295#false} is VALID [2022-02-20 16:58:17,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {3295#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {3295#false} is VALID [2022-02-20 16:58:17,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {3295#false} assume !false; {3295#false} is VALID [2022-02-20 16:58:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:58:17,837 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:58:17,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74527304] [2022-02-20 16:58:17,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74527304] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:58:17,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194860972] [2022-02-20 16:58:17,837 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 16:58:17,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:58:17,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:58:17,838 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 16:58:17,839 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 16:58:17,910 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 16:58:17,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:58:17,911 WARN L261 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 88 conjunts are in the unsatisfiable core [2022-02-20 16:58:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:58:17,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:58:17,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 16:58:17,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:58:17,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:58:18,043 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 16:58:18,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 16:58:18,176 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 19 treesize of output 18 [2022-02-20 16:58:18,182 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 23 treesize of output 22 [2022-02-20 16:58:18,269 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 16:58:18,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-02-20 16:58:18,421 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-02-20 16:58:18,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 47 [2022-02-20 16:58:18,456 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-02-20 16:58:18,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-02-20 16:58:20,523 INFO L356 Elim1Store]: treesize reduction 86, result has 7.5 percent of original size [2022-02-20 16:58:20,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 51 [2022-02-20 16:58:21,084 INFO L356 Elim1Store]: treesize reduction 63, result has 13.7 percent of original size [2022-02-20 16:58:21,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 70 treesize of output 40 [2022-02-20 16:58:21,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {3294#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2); {3294#true} is VALID [2022-02-20 16:58:21,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {3294#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post10#1, main_#t~nondet8#1, main_#t~short9#1, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1, main_~len~1#1, main_~s~0#1.base, main_~s~0#1.offset;main_~len~1#1 := 2; {3294#true} is VALID [2022-02-20 16:58:21,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {3294#true} main_#t~short9#1 := main_~len~1#1 < 32; {3294#true} is VALID [2022-02-20 16:58:21,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {3294#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {3294#true} is VALID [2022-02-20 16:58:21,124 INFO L290 TraceCheckUtils]: 4: Hoare triple {3294#true} assume !!main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1;main_#t~post10#1 := main_~len~1#1;main_~len~1#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3294#true} is VALID [2022-02-20 16:58:21,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {3294#true} main_#t~short9#1 := main_~len~1#1 < 32; {3294#true} is VALID [2022-02-20 16:58:21,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {3294#true} assume main_#t~short9#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_#t~short9#1 := 0 != main_#t~nondet8#1; {3294#true} is VALID [2022-02-20 16:58:21,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {3294#true} assume !main_#t~short9#1;havoc main_#t~nondet8#1;havoc main_#t~short9#1; {3294#true} is VALID [2022-02-20 16:58:21,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {3294#true} assume { :begin_inline_sll_create } true;sll_create_#in~len#1 := main_~len~1#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#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_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {3296#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:58:21,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {3296#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {3297#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 16:58:21,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {3297#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {3297#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} is VALID [2022-02-20 16:58:21,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {3297#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))} call write~$Pointer$(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, 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;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; {3298#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 16:58:21,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {3298#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {3348#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 16:58:21,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {3348#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {3348#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} is VALID [2022-02-20 16:58:21,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {3348#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 0) 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0))} call write~$Pointer$(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, 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;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; {3355#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 1) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:21,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {3355#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 1) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} assume !!(sll_create_~len#1 > 0);call sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4);sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset;havoc sll_create_#t~malloc3#1.base, sll_create_#t~malloc3#1.offset; {3359#(and (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 16:58:21,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {3359#(and (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} assume !(0 == sll_create_~new_head~0#1.base && 0 == sll_create_~new_head~0#1.offset); {3359#(and (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} is VALID [2022-02-20 16:58:21,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {3359#(and (not (= |ULTIMATE.start_sll_create_~new_head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~new_head~0#1.base|)))} call write~$Pointer$(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, 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;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; {3366#(and (exists ((v_arrayElimCell_26 Int)) (and (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_26) 0) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| v_arrayElimCell_26)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) v_arrayElimCell_26) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) v_arrayElimCell_26)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_26) 0) 0))) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:21,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {3366#(and (exists ((v_arrayElimCell_26 Int)) (and (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_26) 0) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| v_arrayElimCell_26)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) v_arrayElimCell_26) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) v_arrayElimCell_26)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_26) 0) 0))) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} assume !(sll_create_~len#1 > 0); {3366#(and (exists ((v_arrayElimCell_26 Int)) (and (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_26) 0) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| v_arrayElimCell_26)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) v_arrayElimCell_26) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) v_arrayElimCell_26)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_26) 0) 0))) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} is VALID [2022-02-20 16:58:21,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {3366#(and (exists ((v_arrayElimCell_26 Int)) (and (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_26) 0) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| v_arrayElimCell_26)) (or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) v_arrayElimCell_26) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) |ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|) v_arrayElimCell_26)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_26) 0) 0))) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) |ULTIMATE.start_sll_create_~head~0#1.offset|)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {3373#(and (not (= 0 |ULTIMATE.start_sll_create_#res#1.base|)) (exists ((v_arrayElimCell_26 Int)) (and (not (= v_arrayElimCell_26 |ULTIMATE.start_sll_create_#res#1.base|)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_26) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0) v_arrayElimCell_26)) (or (= v_arrayElimCell_26 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0)) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_26) 0) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0)) 0)) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 0)))} is VALID [2022-02-20 16:58:21,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {3373#(and (not (= 0 |ULTIMATE.start_sll_create_#res#1.base|)) (exists ((v_arrayElimCell_26 Int)) (and (not (= v_arrayElimCell_26 |ULTIMATE.start_sll_create_#res#1.base|)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_26) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0) v_arrayElimCell_26)) (or (= v_arrayElimCell_26 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0)) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0) |ULTIMATE.start_sll_create_#res#1.base|)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_26) 0) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 0)) 0)) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 0)))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;main_~s~0#1.base, main_~s~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_length } true;sll_length_#in~head#1.base, sll_length_#in~head#1.offset := main_~s~0#1.base, main_~s~0#1.offset;havoc sll_length_#res#1;havoc sll_length_#t~post5#1, sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset, sll_length_~head#1.base, sll_length_~head#1.offset, sll_length_~len~0#1;sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#in~head#1.base, sll_length_#in~head#1.offset;sll_length_~len~0#1 := 0; {3377#(and (exists ((v_arrayElimCell_26 Int)) (and (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_26) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0) v_arrayElimCell_26)) (not (= |ULTIMATE.start_sll_length_~head#1.base| v_arrayElimCell_26)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_26) 0) 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0) |ULTIMATE.start_sll_length_~head#1.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0)) 0) v_arrayElimCell_26)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0)) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) 0) 0) (= |ULTIMATE.start_sll_length_~head#1.offset| 0) (not (= |ULTIMATE.start_sll_length_~head#1.base| 0)))} is VALID [2022-02-20 16:58:21,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {3377#(and (exists ((v_arrayElimCell_26 Int)) (and (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_26) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0) v_arrayElimCell_26)) (not (= |ULTIMATE.start_sll_length_~head#1.base| v_arrayElimCell_26)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_26) 0) 0) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0) |ULTIMATE.start_sll_length_~head#1.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0)) 0) v_arrayElimCell_26)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_length_~head#1.base|) 0)) 0) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_length_~head#1.base|) 0) 0) (= |ULTIMATE.start_sll_length_~head#1.offset| 0) (not (= |ULTIMATE.start_sll_length_~head#1.base| 0)))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {3381#(exists ((|v_ULTIMATE.start_sll_length_~head#1.base_32| Int) (v_arrayElimCell_26 Int)) (and (= |ULTIMATE.start_sll_length_~head#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_26) 0) 0) (= |ULTIMATE.start_sll_length_~head#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) (not (= v_arrayElimCell_26 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0))) (not (= |v_ULTIMATE.start_sll_length_~head#1.base_32| v_arrayElimCell_26)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) 0) 0) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_26) 0) 0) (not (= |v_ULTIMATE.start_sll_length_~head#1.base_32| 0)) (or (= |v_ULTIMATE.start_sll_length_~head#1.base_32| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) 0) v_arrayElimCell_26))))} is VALID [2022-02-20 16:58:21,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {3381#(exists ((|v_ULTIMATE.start_sll_length_~head#1.base_32| Int) (v_arrayElimCell_26 Int)) (and (= |ULTIMATE.start_sll_length_~head#1.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_26) 0) 0) (= |ULTIMATE.start_sll_length_~head#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) (not (= v_arrayElimCell_26 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0))) (not (= |v_ULTIMATE.start_sll_length_~head#1.base_32| v_arrayElimCell_26)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) 0) 0) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_26) 0) 0) (not (= |v_ULTIMATE.start_sll_length_~head#1.base_32| 0)) (or (= |v_ULTIMATE.start_sll_length_~head#1.base_32| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) 0) v_arrayElimCell_26))))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {3385#(exists ((|v_ULTIMATE.start_sll_length_~head#1.base_32| Int) (v_arrayElimCell_26 Int)) (and (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_26) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) |ULTIMATE.start_sll_length_~head#1.offset|) (not (= v_arrayElimCell_26 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0))) (not (= |v_ULTIMATE.start_sll_length_~head#1.base_32| v_arrayElimCell_26)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) |ULTIMATE.start_sll_length_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) 0) 0) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_26) 0) 0) (not (= |v_ULTIMATE.start_sll_length_~head#1.base_32| 0)) (or (= |v_ULTIMATE.start_sll_length_~head#1.base_32| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) 0) v_arrayElimCell_26))))} is VALID [2022-02-20 16:58:21,137 INFO L290 TraceCheckUtils]: 23: Hoare triple {3385#(exists ((|v_ULTIMATE.start_sll_length_~head#1.base_32| Int) (v_arrayElimCell_26 Int)) (and (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_26) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) |ULTIMATE.start_sll_length_~head#1.offset|) (not (= v_arrayElimCell_26 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0))) (not (= |v_ULTIMATE.start_sll_length_~head#1.base_32| v_arrayElimCell_26)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) |ULTIMATE.start_sll_length_~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) 0) 0) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_26) 0) 0) (not (= |v_ULTIMATE.start_sll_length_~head#1.base_32| 0)) (or (= |v_ULTIMATE.start_sll_length_~head#1.base_32| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) 0) v_arrayElimCell_26))))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {3389#(and (exists ((|v_ULTIMATE.start_sll_length_~head#1.base_32| Int) (v_arrayElimCell_26 Int)) (and (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_26) 0) 0) (not (= v_arrayElimCell_26 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0))) (not (= |v_ULTIMATE.start_sll_length_~head#1.base_32| v_arrayElimCell_26)) (= |ULTIMATE.start_sll_length_~head#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) 0)) 0)) (not (= |v_ULTIMATE.start_sll_length_~head#1.base_32| 0)) (or (= |v_ULTIMATE.start_sll_length_~head#1.base_32| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) 0) v_arrayElimCell_26)))) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} is VALID [2022-02-20 16:58:21,138 INFO L290 TraceCheckUtils]: 24: Hoare triple {3389#(and (exists ((|v_ULTIMATE.start_sll_length_~head#1.base_32| Int) (v_arrayElimCell_26 Int)) (and (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_26) 0) 0) (not (= v_arrayElimCell_26 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0))) (not (= |v_ULTIMATE.start_sll_length_~head#1.base_32| v_arrayElimCell_26)) (= |ULTIMATE.start_sll_length_~head#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) 0)) 0)) (not (= |v_ULTIMATE.start_sll_length_~head#1.base_32| 0)) (or (= |v_ULTIMATE.start_sll_length_~head#1.base_32| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_sll_length_~head#1.base_32|) 0)) 0) v_arrayElimCell_26)))) (= |ULTIMATE.start_sll_length_~head#1.offset| 0))} assume !!(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0);sll_length_#t~post5#1 := sll_length_~len~0#1;sll_length_~len~0#1 := 1 + sll_length_#t~post5#1;havoc sll_length_#t~post5#1;call sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset := read~$Pointer$(sll_length_~head#1.base, sll_length_~head#1.offset, 4);sll_length_~head#1.base, sll_length_~head#1.offset := sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset;havoc sll_length_#t~mem6#1.base, sll_length_#t~mem6#1.offset; {3308#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} is VALID [2022-02-20 16:58:21,138 INFO L290 TraceCheckUtils]: 25: Hoare triple {3308#(not (= |ULTIMATE.start_sll_length_~head#1.base| 0))} assume !(sll_length_~head#1.base != 0 || sll_length_~head#1.offset != 0); {3295#false} is VALID [2022-02-20 16:58:21,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {3295#false} sll_length_#res#1 := sll_length_~len~0#1; {3295#false} is VALID [2022-02-20 16:58:21,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {3295#false} main_#t~ret12#1 := sll_length_#res#1;assume { :end_inline_sll_length } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {3295#false} is VALID [2022-02-20 16:58:21,139 INFO L290 TraceCheckUtils]: 28: Hoare triple {3295#false} assume main_~len~1#1 != main_#t~ret12#1;havoc main_#t~ret12#1; {3295#false} is VALID [2022-02-20 16:58:21,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {3295#false} assume !false; {3295#false} is VALID [2022-02-20 16:58:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:58:21,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:58:54,282 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:58:54,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11232 treesize of output 10728 [2022-02-20 16:58:58,645 INFO L356 Elim1Store]: treesize reduction 1848, result has 27.0 percent of original size [2022-02-20 16:58:58,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 23 select indices, 23 select index equivalence classes, 0 disjoint index pairs (out of 253 index pairs), introduced 25 new quantified variables, introduced 253 case distinctions, treesize of input 1341439 treesize of output 1257890