./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_remove_all.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_remove_all.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 bae9bfc842bb010963d083e19e9498cfd3af182f91f0b8fa56907786a4d462dd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:56:37,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:56:37,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:56:37,627 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:56:37,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:56:37,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:56:37,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:56:37,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:56:37,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:56:37,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:56:37,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:56:37,645 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:56:37,645 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:56:37,645 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:56:37,646 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:56:37,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:56:37,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:56:37,647 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:56:37,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:56:37,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:56:37,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:56:37,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:56:37,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:56:37,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:56:37,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:56:37,657 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:56:37,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:56:37,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:56:37,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:56:37,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:56:37,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:56:37,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:56:37,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:56:37,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:56:37,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:56:37,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:56:37,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:56:37,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:56:37,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:56:37,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:56:37,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:56:37,665 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:56:37,690 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:56:37,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:56:37,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:56:37,691 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:56:37,691 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:56:37,692 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:56:37,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:56:37,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:56:37,692 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:56:37,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:56:37,693 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:56:37,693 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:56:37,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:56:37,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:56:37,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:56:37,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:56:37,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:56:37,694 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:56:37,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:56:37,694 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:56:37,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:56:37,695 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:56:37,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:56:37,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:56:37,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:56:37,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:56:37,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:56:37,696 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:56:37,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:56:37,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:56:37,696 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:56:37,697 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:56:37,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:56:37,697 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 -> bae9bfc842bb010963d083e19e9498cfd3af182f91f0b8fa56907786a4d462dd [2022-02-20 16:56:37,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:56:37,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:56:37,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:56:37,899 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:56:37,899 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:56:37,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_remove_all.i [2022-02-20 16:56:37,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b7bc90e/5cbfa144fee243cd96b232a709fda38d/FLAG97a822b01 [2022-02-20 16:56:38,392 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:56:38,392 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all.i [2022-02-20 16:56:38,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b7bc90e/5cbfa144fee243cd96b232a709fda38d/FLAG97a822b01 [2022-02-20 16:56:38,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7b7bc90e/5cbfa144fee243cd96b232a709fda38d [2022-02-20 16:56:38,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:56:38,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:56:38,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:56:38,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:56:38,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:56:38,426 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:56:38" (1/1) ... [2022-02-20 16:56:38,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4577e00b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:38, skipping insertion in model container [2022-02-20 16:56:38,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:56:38" (1/1) ... [2022-02-20 16:56:38,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:56:38,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:56:38,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all.i[23806,23819] [2022-02-20 16:56:38,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:56:38,743 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:56:38,766 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all.i[23806,23819] [2022-02-20 16:56:38,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:56:38,796 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:56:38,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:38 WrapperNode [2022-02-20 16:56:38,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:56:38,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:56:38,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:56:38,798 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:56:38,803 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:56:38" (1/1) ... [2022-02-20 16:56:38,814 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:56:38" (1/1) ... [2022-02-20 16:56:38,830 INFO L137 Inliner]: procedures = 126, calls = 25, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 83 [2022-02-20 16:56:38,830 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:56:38,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:56:38,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:56:38,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:56:38,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:38" (1/1) ... [2022-02-20 16:56:38,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:38" (1/1) ... [2022-02-20 16:56:38,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:38" (1/1) ... [2022-02-20 16:56:38,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:38" (1/1) ... [2022-02-20 16:56:38,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:38" (1/1) ... [2022-02-20 16:56:38,866 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:38" (1/1) ... [2022-02-20 16:56:38,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:38" (1/1) ... [2022-02-20 16:56:38,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:56:38,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:56:38,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:56:38,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:56:38,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:38" (1/1) ... [2022-02-20 16:56:38,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:56:38,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:38,902 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:56:38,919 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:56:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:56:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:56:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:56:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:56:38,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:56:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:56:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:56:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 16:56:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:56:38,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:56:38,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:56:39,043 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:56:39,044 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:56:39,197 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:56:39,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:56:39,202 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 16:56:39,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:56:39 BoogieIcfgContainer [2022-02-20 16:56:39,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:56:39,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:56:39,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:56:39,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:56:39,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:56:38" (1/3) ... [2022-02-20 16:56:39,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@915a4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:56:39, skipping insertion in model container [2022-02-20 16:56:39,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:38" (2/3) ... [2022-02-20 16:56:39,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@915a4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:56:39, skipping insertion in model container [2022-02-20 16:56:39,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:56:39" (3/3) ... [2022-02-20 16:56:39,223 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all.i [2022-02-20 16:56:39,226 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:56:39,227 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:56:39,263 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:56:39,271 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:56:39,271 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:56:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 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:56:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:56:39,285 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:39,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:39,287 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:39,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:39,296 INFO L85 PathProgramCache]: Analyzing trace with hash -409335067, now seen corresponding path program 1 times [2022-02-20 16:56:39,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:39,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538724656] [2022-02-20 16:56:39,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:39,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:39,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#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(19, 2); {23#true} is VALID [2022-02-20 16:56:39,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {23#true} is VALID [2022-02-20 16:56:39,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-02-20 16:56:39,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {24#false} is VALID [2022-02-20 16:56:39,452 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {24#false} is VALID [2022-02-20 16:56:39,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#false} assume !(main_~i~0#1 >= 0); {24#false} is VALID [2022-02-20 16:56:39,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {24#false} is VALID [2022-02-20 16:56:39,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {24#false} is VALID [2022-02-20 16:56:39,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 16:56:39,461 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:56:39,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:39,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538724656] [2022-02-20 16:56:39,463 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538724656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:39,463 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:56:39,463 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:56:39,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080928198] [2022-02-20 16:56:39,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:39,471 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:56:39,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:39,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:56:39,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:39,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:56:39,488 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:39,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:56:39,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:56:39,508 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 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 has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:56:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:39,545 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-02-20 16:56:39,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:56:39,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:56:39,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:56:39,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2022-02-20 16:56:39,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:56:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2022-02-20 16:56:39,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 39 transitions. [2022-02-20 16:56:39,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:39,611 INFO L225 Difference]: With dead ends: 32 [2022-02-20 16:56:39,611 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 16:56:39,613 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:56:39,616 INFO L933 BasicCegarLoop]: 22 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, 22 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:56:39,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:39,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 16:56:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 16:56:39,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:39,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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:56:39,637 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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:56:39,638 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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:56:39,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:39,646 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 16:56:39,646 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 16:56:39,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:39,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:39,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 16 states. [2022-02-20 16:56:39,647 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 16 states. [2022-02-20 16:56:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:39,649 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 16:56:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 16:56:39,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:39,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:39,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:39,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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:56:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-02-20 16:56:39,653 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 9 [2022-02-20 16:56:39,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:39,654 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-02-20 16:56:39,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:56:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 16:56:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:56:39,655 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:39,655 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:39,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:56:39,658 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:39,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:39,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1724492075, now seen corresponding path program 1 times [2022-02-20 16:56:39,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:39,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764987149] [2022-02-20 16:56:39,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:39,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:39,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {123#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(19, 2); {123#true} is VALID [2022-02-20 16:56:39,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {123#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {125#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:56:39,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !(sll_create_~len#1 > 0); {124#false} is VALID [2022-02-20 16:56:39,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {124#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {124#false} is VALID [2022-02-20 16:56:39,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {124#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {124#false} is VALID [2022-02-20 16:56:39,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {124#false} assume !(main_~i~0#1 >= 0); {124#false} is VALID [2022-02-20 16:56:39,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {124#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {124#false} is VALID [2022-02-20 16:56:39,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {124#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {124#false} is VALID [2022-02-20 16:56:39,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {124#false} assume !false; {124#false} is VALID [2022-02-20 16:56:39,737 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:56:39,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:39,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764987149] [2022-02-20 16:56:39,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764987149] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:39,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:56:39,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:56:39,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284465265] [2022-02-20 16:56:39,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:39,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-02-20 16:56:39,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:39,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:56:39,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:39,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:56:39,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:39,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:56:39,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:56:39,752 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:56:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:39,783 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 16:56:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:56:39,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-02-20 16:56:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:56:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-02-20 16:56:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:56:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-02-20 16:56:39,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-02-20 16:56:39,821 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:56:39,822 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:56:39,823 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 16:56:39,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:56:39,827 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:39,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:39,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 16:56:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2022-02-20 16:56:39,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:39,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:56:39,832 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:56:39,832 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:56:39,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:39,833 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 16:56:39,833 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 16:56:39,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:39,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:39,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 21 states. [2022-02-20 16:56:39,834 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 21 states. [2022-02-20 16:56:39,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:39,836 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 16:56:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 16:56:39,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:39,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:39,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:39,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:56:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-02-20 16:56:39,839 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2022-02-20 16:56:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:39,841 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-02-20 16:56:39,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:56:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-20 16:56:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:56:39,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:39,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:39,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:56:39,844 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:39,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:39,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1461985389, now seen corresponding path program 1 times [2022-02-20 16:56:39,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:39,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965847500] [2022-02-20 16:56:39,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:39,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:39,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {233#true} is VALID [2022-02-20 16:56:39,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {235#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:56:39,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {235#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:56:39,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {235#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {235#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:56:39,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {235#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {235#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:56:39,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {235#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {235#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:56:39,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {235#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {236#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:39,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {234#false} is VALID [2022-02-20 16:56:39,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {234#false} is VALID [2022-02-20 16:56:39,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {234#false} is VALID [2022-02-20 16:56:39,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {234#false} assume !(main_~i~0#1 >= 0); {234#false} is VALID [2022-02-20 16:56:39,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {234#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {234#false} is VALID [2022-02-20 16:56:39,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {234#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {234#false} is VALID [2022-02-20 16:56:39,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {234#false} assume !false; {234#false} is VALID [2022-02-20 16:56:39,925 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:56:39,925 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:39,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965847500] [2022-02-20 16:56:39,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965847500] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:56:39,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606837924] [2022-02-20 16:56:39,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:39,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:39,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:39,927 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:56:39,939 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:56:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:40,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:56:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:40,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:40,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {233#true} is VALID [2022-02-20 16:56:40,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:40,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:40,153 INFO L290 TraceCheckUtils]: 3: Hoare triple {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:40,154 INFO L290 TraceCheckUtils]: 4: Hoare triple {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:40,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:40,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {236#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:40,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {234#false} is VALID [2022-02-20 16:56:40,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {234#false} is VALID [2022-02-20 16:56:40,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {234#false} is VALID [2022-02-20 16:56:40,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {234#false} assume !(main_~i~0#1 >= 0); {234#false} is VALID [2022-02-20 16:56:40,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {234#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {234#false} is VALID [2022-02-20 16:56:40,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {234#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {234#false} is VALID [2022-02-20 16:56:40,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {234#false} assume !false; {234#false} is VALID [2022-02-20 16:56:40,156 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:56:40,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:56:40,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {234#false} assume !false; {234#false} is VALID [2022-02-20 16:56:40,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {234#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {234#false} is VALID [2022-02-20 16:56:40,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {234#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {234#false} is VALID [2022-02-20 16:56:40,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {234#false} assume !(main_~i~0#1 >= 0); {234#false} is VALID [2022-02-20 16:56:40,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {234#false} is VALID [2022-02-20 16:56:40,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {234#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {234#false} is VALID [2022-02-20 16:56:40,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {236#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {234#false} is VALID [2022-02-20 16:56:40,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {236#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:40,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:40,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:40,256 INFO L290 TraceCheckUtils]: 3: Hoare triple {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:40,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:40,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {233#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {243#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:40,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {233#true} is VALID [2022-02-20 16:56:40,257 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:56:40,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606837924] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:56:40,257 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:56:40,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-02-20 16:56:40,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429863439] [2022-02-20 16:56:40,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:56:40,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:56:40,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:40,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:56:40,274 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:56:40,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:56:40,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:40,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:56:40,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:56:40,278 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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:56:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:40,322 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-02-20 16:56:40,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:56:40,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:56:40,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:56:40,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-02-20 16:56:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:56:40,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-02-20 16:56:40,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-02-20 16:56:40,346 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:56:40,347 INFO L225 Difference]: With dead ends: 31 [2022-02-20 16:56:40,347 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:56:40,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:56:40,349 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:40,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 41 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:56:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:56:40,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:40,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:56:40,355 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:56:40,355 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:56:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:40,356 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 16:56:40,356 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 16:56:40,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:40,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:40,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:56:40,357 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:56:40,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:40,357 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 16:56:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 16:56:40,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:40,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:40,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:40,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:40,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:56:40,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-02-20 16:56:40,359 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2022-02-20 16:56:40,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:40,359 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-02-20 16:56:40,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:56:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 16:56:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:56:40,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:40,360 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:40,379 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:56:40,578 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:56:40,579 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:40,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:40,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1187812821, now seen corresponding path program 2 times [2022-02-20 16:56:40,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:40,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838787348] [2022-02-20 16:56:40,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:40,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:40,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {434#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(19, 2); {434#true} is VALID [2022-02-20 16:56:40,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {436#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 16:56:40,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {436#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {436#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 16:56:40,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {436#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {436#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 16:56:40,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {436#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {436#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 16:56:40,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {436#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {436#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 16:56:40,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {436#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_create_~len#1 > 0); {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {438#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:40,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {438#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {435#false} is VALID [2022-02-20 16:56:40,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {435#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {435#false} is VALID [2022-02-20 16:56:40,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {435#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {435#false} is VALID [2022-02-20 16:56:40,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-02-20 16:56:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:56:40,667 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:40,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838787348] [2022-02-20 16:56:40,667 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838787348] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:56:40,667 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520223264] [2022-02-20 16:56:40,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:56:40,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:40,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:40,668 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:56:40,669 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:56:40,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 16:56:40,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:56:40,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:56:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:40,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:40,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {434#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(19, 2); {434#true} is VALID [2022-02-20 16:56:40,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,847 INFO L290 TraceCheckUtils]: 4: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_create_~len#1 > 0); {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:40,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {437#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {438#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:40,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {438#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {435#false} is VALID [2022-02-20 16:56:40,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {435#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {435#false} is VALID [2022-02-20 16:56:40,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {435#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {435#false} is VALID [2022-02-20 16:56:40,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {435#false} assume !false; {435#false} is VALID [2022-02-20 16:56:40,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:56:40,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:56:40,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520223264] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:40,853 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 16:56:40,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-20 16:56:40,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570203920] [2022-02-20 16:56:40,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:40,853 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 19 [2022-02-20 16:56:40,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:40,854 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:56:40,864 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:56:40,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:56:40,865 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:40,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:56:40,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:56:40,868 INFO L87 Difference]: Start difference. First operand 22 states and 23 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:56:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:40,925 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-02-20 16:56:40,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:56:40,926 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 19 [2022-02-20 16:56:40,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:40,926 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:56:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 16:56:40,926 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:56:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 16:56:40,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-02-20 16:56:40,959 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:56:40,960 INFO L225 Difference]: With dead ends: 29 [2022-02-20 16:56:40,960 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:56:40,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:56:40,961 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:40,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:56:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-02-20 16:56:40,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:40,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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:56:40,972 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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:56:40,972 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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:56:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:40,973 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-20 16:56:40,973 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-20 16:56:40,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:40,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:40,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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 25 states. [2022-02-20 16:56:40,974 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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 25 states. [2022-02-20 16:56:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:40,975 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-20 16:56:40,975 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-20 16:56:40,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:40,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:40,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:40,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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:56:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-02-20 16:56:40,976 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2022-02-20 16:56:40,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:40,976 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-02-20 16:56:40,977 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:56:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-02-20 16:56:40,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:56:40,977 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:40,977 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:40,993 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:56:41,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 16:56:41,183 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:41,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:41,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1492503821, now seen corresponding path program 1 times [2022-02-20 16:56:41,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:41,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316138384] [2022-02-20 16:56:41,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:41,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:41,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {618#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(19, 2); {618#true} is VALID [2022-02-20 16:56:41,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {618#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {620#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 16:56:41,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {620#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 16:56:41,267 INFO L290 TraceCheckUtils]: 3: Hoare triple {620#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {620#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 16:56:41,268 INFO L290 TraceCheckUtils]: 4: Hoare triple {620#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {620#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 16:56:41,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {620#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} is VALID [2022-02-20 16:56:41,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {620#(and (= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_sll_create_~len#1|) 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_create_~len#1 > 0); {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:41,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_first } true;sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset, sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset, sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset;sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset := sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset;call sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4);call sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset := read~$Pointer$(sll_remove_first_#t~mem6#1.base, 4 + sll_remove_first_#t~mem6#1.offset, 4);sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset := sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset;havoc sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;call sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4);call ULTIMATE.dealloc(sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset);havoc sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset;call write~$Pointer$(sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4); {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:41,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_sll_remove_first } true; {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:41,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {623#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:41,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {619#false} is VALID [2022-02-20 16:56:41,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {619#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {619#false} is VALID [2022-02-20 16:56:41,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {619#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {619#false} is VALID [2022-02-20 16:56:41,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {619#false} assume !false; {619#false} is VALID [2022-02-20 16:56:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:56:41,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:41,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316138384] [2022-02-20 16:56:41,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316138384] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:56:41,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416975891] [2022-02-20 16:56:41,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:41,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:41,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:41,279 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:56:41,280 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:56:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:41,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:56:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:41,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:41,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {618#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(19, 2); {618#true} is VALID [2022-02-20 16:56:41,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {618#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,443 INFO L290 TraceCheckUtils]: 4: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_create_~len#1 > 0); {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:41,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_first } true;sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset, sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset, sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset;sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset := sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset;call sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4);call sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset := read~$Pointer$(sll_remove_first_#t~mem6#1.base, 4 + sll_remove_first_#t~mem6#1.offset, 4);sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset := sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset;havoc sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;call sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4);call ULTIMATE.dealloc(sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset);havoc sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset;call write~$Pointer$(sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4); {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:41,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_sll_remove_first } true; {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:41,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {623#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:41,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {619#false} is VALID [2022-02-20 16:56:41,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {619#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {619#false} is VALID [2022-02-20 16:56:41,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {619#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {619#false} is VALID [2022-02-20 16:56:41,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {619#false} assume !false; {619#false} is VALID [2022-02-20 16:56:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:56:41,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:56:41,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {619#false} assume !false; {619#false} is VALID [2022-02-20 16:56:41,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {619#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {619#false} is VALID [2022-02-20 16:56:41,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {619#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {619#false} is VALID [2022-02-20 16:56:41,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {619#false} is VALID [2022-02-20 16:56:41,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {623#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:41,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_sll_remove_first } true; {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:41,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_first } true;sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset, sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset, sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset;sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset := sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset;call sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4);call sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset := read~$Pointer$(sll_remove_first_#t~mem6#1.base, 4 + sll_remove_first_#t~mem6#1.offset, 4);sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset := sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset;havoc sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;call sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4);call ULTIMATE.dealloc(sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset);havoc sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset;call write~$Pointer$(sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4); {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:41,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {622#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:56:41,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(sll_create_~len#1 > 0); {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,534 INFO L290 TraceCheckUtils]: 3: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {618#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {621#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:41,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {618#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(19, 2); {618#true} is VALID [2022-02-20 16:56:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:56:41,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416975891] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:56:41,536 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:56:41,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-02-20 16:56:41,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227148456] [2022-02-20 16:56:41,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:56:41,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:56:41,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:41,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:56:41,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:41,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:56:41,553 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:41,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:56:41,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:56:41,554 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:56:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:41,649 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-02-20 16:56:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:56:41,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:56:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:56:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-02-20 16:56:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:56:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-02-20 16:56:41,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-02-20 16:56:41,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:41,678 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:56:41,678 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:56:41,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:56:41,679 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:41,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 33 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:41,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:56:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:56:41,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:41,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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:56:41,689 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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:56:41,689 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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:56:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:41,690 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 16:56:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 16:56:41,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:41,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:41,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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 26 states. [2022-02-20 16:56:41,690 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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 26 states. [2022-02-20 16:56:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:41,691 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 16:56:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 16:56:41,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:41,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:41,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:41,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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:56:41,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-20 16:56:41,693 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2022-02-20 16:56:41,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:41,693 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-20 16:56:41,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:56:41,693 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 16:56:41,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:56:41,694 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:41,694 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:41,711 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:56:41,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:41,897 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:41,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:41,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1018778923, now seen corresponding path program 2 times [2022-02-20 16:56:41,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:41,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850304632] [2022-02-20 16:56:41,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:41,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:42,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {885#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(19, 2); {885#true} is VALID [2022-02-20 16:56:42,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {887#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:56:42,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {887#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {888#(and (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:56:42,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {888#(and (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {888#(and (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:56:42,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {888#(and (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0))} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {889#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:56:42,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {889#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {890#(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|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:42,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {890#(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|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {890#(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|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:42,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {890#(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|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {891#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:42,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {891#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {891#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:42,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {891#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {892#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:42,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {892#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {893#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~#s~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|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-20 16:56:42,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {893#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~#s~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|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {893#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~#s~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|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-20 16:56:42,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {893#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~#s~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|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} assume !(sll_create_~len#1 > 0); {893#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~#s~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|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-20 16:56:42,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {893#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~#s~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|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {894#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4)) 4) 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:42,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {894#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4)) 4) 0) (= |ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)))} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {895#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 4) 0))} is VALID [2022-02-20 16:56:42,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 4) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_first } true;sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset, sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset, sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset;sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset := sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset;call sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4);call sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset := read~$Pointer$(sll_remove_first_#t~mem6#1.base, 4 + sll_remove_first_#t~mem6#1.offset, 4);sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset := sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset;havoc sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;call sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4);call ULTIMATE.dealloc(sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset);havoc sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset;call write~$Pointer$(sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4); {896#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-20 16:56:42,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {896#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} assume { :end_inline_sll_remove_first } true; {896#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-20 16:56:42,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {896#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {896#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-20 16:56:42,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {896#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_first } true;sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset, sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset, sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset;sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset := sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset;call sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4);call sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset := read~$Pointer$(sll_remove_first_#t~mem6#1.base, 4 + sll_remove_first_#t~mem6#1.offset, 4);sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset := sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset;havoc sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;call sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4);call ULTIMATE.dealloc(sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset);havoc sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset;call write~$Pointer$(sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4); {897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 16:56:42,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} assume { :end_inline_sll_remove_first } true; {897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 16:56:42,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 16:56:42,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} assume !(main_~i~0#1 >= 0); {897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 16:56:42,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {897#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {898#(and (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (= |ULTIMATE.start_main_#t~mem11#1.base| 0))} is VALID [2022-02-20 16:56:42,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {898#(and (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (= |ULTIMATE.start_main_#t~mem11#1.base| 0))} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {886#false} is VALID [2022-02-20 16:56:42,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {886#false} assume !false; {886#false} is VALID [2022-02-20 16:56:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:56:42,336 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:42,336 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850304632] [2022-02-20 16:56:42,336 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850304632] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:56:42,337 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787185278] [2022-02-20 16:56:42,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:56:42,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:42,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:42,338 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:56:42,339 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:56:42,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:56:42,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:56:42,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 103 conjunts are in the unsatisfiable core [2022-02-20 16:56:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:42,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:42,497 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:56:42,552 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 16:56:42,552 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:56:42,650 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 13 treesize of output 9 [2022-02-20 16:56:42,657 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 13 treesize of output 9 [2022-02-20 16:56:42,730 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-20 16:56:42,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 16:56:42,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 16:56:42,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 16:56:42,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-20 16:56:42,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-02-20 16:56:43,249 INFO L356 Elim1Store]: treesize reduction 114, result has 15.6 percent of original size [2022-02-20 16:56:43,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 173 treesize of output 104 [2022-02-20 16:56:43,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 65 [2022-02-20 16:56:43,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 73 [2022-02-20 16:56:43,952 INFO L356 Elim1Store]: treesize reduction 91, result has 14.2 percent of original size [2022-02-20 16:56:43,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 83 [2022-02-20 16:56:44,721 INFO L356 Elim1Store]: treesize reduction 42, result has 2.3 percent of original size [2022-02-20 16:56:44,722 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 2 case distinctions, treesize of input 102 treesize of output 55 [2022-02-20 16:56:44,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-02-20 16:56:44,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {885#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(19, 2); {885#true} is VALID [2022-02-20 16:56:44,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {905#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:56:44,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {905#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {909#(and (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:56:44,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {909#(and (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {909#(and (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:56:44,898 INFO L290 TraceCheckUtils]: 4: Hoare triple {909#(and (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {916#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1))} is VALID [2022-02-20 16:56:44,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {916#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_sll_create_~head~0#1.base| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) 1))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {920#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#s~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| 4)) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:44,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {920#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#s~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| 4)) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {920#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#s~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| 4)) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:44,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#s~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| 4)) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!(sll_create_~len#1 > 0);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {927#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:44,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {927#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {927#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:44,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {927#(and (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~int(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {934#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:44,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {934#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);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; {938#(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| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 4)) 0) (not (= |ULTIMATE.start_sll_create_~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| 4)))) (= (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| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 4)) 0) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:44,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {938#(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| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 4)) 0) (not (= |ULTIMATE.start_sll_create_~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| 4)))) (= (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| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 4)) 0) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {938#(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| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 4)) 0) (not (= |ULTIMATE.start_sll_create_~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| 4)))) (= (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| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 4)) 0) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:44,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {938#(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| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 4)) 0) (not (= |ULTIMATE.start_sll_create_~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| 4)))) (= (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| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 4)) 0) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !(sll_create_~len#1 > 0); {938#(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| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 4)) 0) (not (= |ULTIMATE.start_sll_create_~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| 4)))) (= (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| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 4)) 0) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:44,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {938#(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| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 4)) 0) (not (= |ULTIMATE.start_sll_create_~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| 4)))) (= (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| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)) 4)) 0) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (+ |ULTIMATE.start_sll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {948#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)) 4)) 0) (= |ULTIMATE.start_main_~#s~0#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| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)) 4)) 0) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|)))} is VALID [2022-02-20 16:56:44,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {948#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)) 4)) 0) (= |ULTIMATE.start_main_~#s~0#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| 4))) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) (+ |ULTIMATE.start_sll_create_#res#1.offset| 4)) 4)) 0) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|)))} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {952#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:56:44,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {952#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 4)) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_first } true;sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset, sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset, sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset;sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset := sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset;call sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4);call sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset := read~$Pointer$(sll_remove_first_#t~mem6#1.base, 4 + sll_remove_first_#t~mem6#1.offset, 4);sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset := sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset;havoc sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;call sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4);call ULTIMATE.dealloc(sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset);havoc sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset;call write~$Pointer$(sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4); {956#(and (exists ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (not (= v_arrayElimCell_11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))} is VALID [2022-02-20 16:56:44,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {956#(and (exists ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (not (= v_arrayElimCell_11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))} assume { :end_inline_sll_remove_first } true; {956#(and (exists ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (not (= v_arrayElimCell_11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))} is VALID [2022-02-20 16:56:44,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {956#(and (exists ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (not (= v_arrayElimCell_11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {956#(and (exists ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (not (= v_arrayElimCell_11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))} is VALID [2022-02-20 16:56:44,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {956#(and (exists ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (not (= v_arrayElimCell_11 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_sll_remove_first } true;sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset, sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset, sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset;sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset := sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset;call sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4);call sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset := read~$Pointer$(sll_remove_first_#t~mem6#1.base, 4 + sll_remove_first_#t~mem6#1.offset, 4);sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset := sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset;havoc sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;call sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4);call ULTIMATE.dealloc(sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset);havoc sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset;call write~$Pointer$(sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4); {966#(and (exists ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (and (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) v_arrayElimCell_11)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 16:56:44,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {966#(and (exists ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (and (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) v_arrayElimCell_11)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} assume { :end_inline_sll_remove_first } true; {966#(and (exists ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (and (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) v_arrayElimCell_11)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 16:56:44,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {966#(and (exists ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (and (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) v_arrayElimCell_11)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {966#(and (exists ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (and (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) v_arrayElimCell_11)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 16:56:44,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {966#(and (exists ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (and (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) v_arrayElimCell_11)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} assume !(main_~i~0#1 >= 0); {966#(and (exists ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (and (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) v_arrayElimCell_11)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 16:56:44,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {966#(and (exists ((v_arrayElimCell_15 Int) (v_arrayElimCell_11 Int)) (and (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) v_arrayElimCell_11)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15))) (+ (select (select |#memory_$Pointer$.offset| v_arrayElimCell_11) (+ 4 v_arrayElimCell_15)) 4)) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {898#(and (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (= |ULTIMATE.start_main_#t~mem11#1.base| 0))} is VALID [2022-02-20 16:56:44,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {898#(and (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (= |ULTIMATE.start_main_#t~mem11#1.base| 0))} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {886#false} is VALID [2022-02-20 16:56:44,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {886#false} assume !false; {886#false} is VALID [2022-02-20 16:56:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:56:44,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:56:45,456 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:56:45,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 341 treesize of output 212 [2022-02-20 16:56:45,463 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:56:45,463 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 1 case distinctions, treesize of input 16 treesize of output 15 [2022-02-20 16:56:45,580 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_325 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_1)) (.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_325))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse6 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (let ((.cse2 (select (select .cse0 .cse7) .cse8))) (let ((.cse3 (select (select .cse5 .cse7) .cse8)) (.cse4 (+ .cse2 4))) (and (= 0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset| .cse2)) .cse3) .cse4)) (= (select (select (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset| .cse3)) .cse3) .cse4) 0)))) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse7)) (not (= (select v_ArrVal_325 .cse8) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select v_arrayElimArr_1 .cse8)))))))) is different from false [2022-02-20 16:56:46,407 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:56:46,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 427 treesize of output 317 [2022-02-20 16:56:46,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:56:46,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 346 treesize of output 226 [2022-02-20 16:56:46,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:56:46,507 INFO L356 Elim1Store]: treesize reduction 34, result has 67.0 percent of original size [2022-02-20 16:56:46,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1038 treesize of output 1022 [2022-02-20 16:56:47,149 INFO L356 Elim1Store]: treesize reduction 92, result has 81.1 percent of original size [2022-02-20 16:56:47,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 15 new quantified variables, introduced 45 case distinctions, treesize of input 4744 treesize of output 4436 [2022-02-20 16:56:47,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:56:47,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 4346 treesize of output 3758 [2022-02-20 16:56:47,745 INFO L356 Elim1Store]: treesize reduction 8, result has 91.8 percent of original size [2022-02-20 16:56:47,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3594 treesize of output 3220 [2022-02-20 16:56:48,040 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 16:56:48,069 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:56:48,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:48,260 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:56:48,264 INFO L158 Benchmark]: Toolchain (without parser) took 9843.15ms. Allocated memory was 83.9MB in the beginning and 197.1MB in the end (delta: 113.2MB). Free memory was 50.3MB in the beginning and 154.8MB in the end (delta: -104.6MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2022-02-20 16:56:48,264 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 54.0MB in the beginning and 54.0MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:56:48,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.42ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 50.1MB in the beginning and 80.2MB in the end (delta: -30.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:56:48,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.01ms. Allocated memory is still 113.2MB. Free memory was 80.2MB in the beginning and 78.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:56:48,264 INFO L158 Benchmark]: Boogie Preprocessor took 37.71ms. Allocated memory is still 113.2MB. Free memory was 78.1MB in the beginning and 76.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:56:48,265 INFO L158 Benchmark]: RCFGBuilder took 334.19ms. Allocated memory is still 113.2MB. Free memory was 76.3MB in the beginning and 62.3MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:56:48,265 INFO L158 Benchmark]: TraceAbstraction took 9058.44ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 61.7MB in the beginning and 154.8MB in the end (delta: -93.1MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2022-02-20 16:56:48,266 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory was 54.0MB in the beginning and 54.0MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.42ms. Allocated memory was 83.9MB in the beginning and 113.2MB in the end (delta: 29.4MB). Free memory was 50.1MB in the beginning and 80.2MB in the end (delta: -30.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.01ms. Allocated memory is still 113.2MB. Free memory was 80.2MB in the beginning and 78.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.71ms. Allocated memory is still 113.2MB. Free memory was 78.1MB in the beginning and 76.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 334.19ms. Allocated memory is still 113.2MB. Free memory was 76.3MB in the beginning and 62.3MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9058.44ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 61.7MB in the beginning and 154.8MB in the end (delta: -93.1MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:56:48,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_remove_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bae9bfc842bb010963d083e19e9498cfd3af182f91f0b8fa56907786a4d462dd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:56:49,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:56:49,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:56:49,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:56:49,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:56:49,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:56:49,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:56:50,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:56:50,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:56:50,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:56:50,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:56:50,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:56:50,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:56:50,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:56:50,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:56:50,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:56:50,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:56:50,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:56:50,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:56:50,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:56:50,028 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:56:50,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:56:50,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:56:50,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:56:50,033 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:56:50,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:56:50,034 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:56:50,035 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:56:50,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:56:50,037 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:56:50,037 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:56:50,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:56:50,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:56:50,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:56:50,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:56:50,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:56:50,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:56:50,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:56:50,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:56:50,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:56:50,043 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:56:50,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:56:50,068 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:56:50,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:56:50,069 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:56:50,069 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:56:50,070 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:56:50,070 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:56:50,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:56:50,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:56:50,071 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:56:50,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:56:50,072 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:56:50,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:56:50,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:56:50,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:56:50,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:56:50,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:56:50,073 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:56:50,073 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:56:50,073 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:56:50,073 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:56:50,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:56:50,074 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:56:50,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:56:50,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:56:50,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:56:50,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:56:50,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:56:50,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:56:50,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:56:50,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:56:50,075 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:56:50,075 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:56:50,075 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:56:50,076 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:56:50,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:56:50,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:56:50,076 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> bae9bfc842bb010963d083e19e9498cfd3af182f91f0b8fa56907786a4d462dd [2022-02-20 16:56:50,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:56:50,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:56:50,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:56:50,369 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:56:50,369 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:56:50,370 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_remove_all.i [2022-02-20 16:56:50,423 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71cdfc960/f69ad6e5ae8b47ff8fa1fee175554444/FLAG966146243 [2022-02-20 16:56:50,808 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:56:50,809 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all.i [2022-02-20 16:56:50,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71cdfc960/f69ad6e5ae8b47ff8fa1fee175554444/FLAG966146243 [2022-02-20 16:56:51,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71cdfc960/f69ad6e5ae8b47ff8fa1fee175554444 [2022-02-20 16:56:51,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:56:51,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:56:51,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:56:51,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:56:51,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:56:51,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:56:51" (1/1) ... [2022-02-20 16:56:51,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e35001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:51, skipping insertion in model container [2022-02-20 16:56:51,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:56:51" (1/1) ... [2022-02-20 16:56:51,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:56:51,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:56:51,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all.i[23806,23819] [2022-02-20 16:56:51,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:56:51,459 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:56:51,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_remove_all.i[23806,23819] [2022-02-20 16:56:51,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:56:51,534 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:56:51,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:51 WrapperNode [2022-02-20 16:56:51,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:56:51,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:56:51,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:56:51,536 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:56:51,540 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:56:51" (1/1) ... [2022-02-20 16:56:51,552 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:56:51" (1/1) ... [2022-02-20 16:56:51,571 INFO L137 Inliner]: procedures = 129, calls = 25, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 84 [2022-02-20 16:56:51,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:56:51,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:56:51,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:56:51,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:56:51,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:51" (1/1) ... [2022-02-20 16:56:51,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:51" (1/1) ... [2022-02-20 16:56:51,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:51" (1/1) ... [2022-02-20 16:56:51,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:51" (1/1) ... [2022-02-20 16:56:51,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:51" (1/1) ... [2022-02-20 16:56:51,593 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:51" (1/1) ... [2022-02-20 16:56:51,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:51" (1/1) ... [2022-02-20 16:56:51,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:56:51,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:56:51,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:56:51,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:56:51,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:51" (1/1) ... [2022-02-20 16:56:51,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:56:51,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:51,621 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:56:51,640 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:56:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:56:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:56:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:56:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:56:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:56:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:56:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:56:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 16:56:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:56:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:56:51,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:56:51,727 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:56:51,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:56:52,052 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:56:52,056 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:56:52,056 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 16:56:52,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:56:52 BoogieIcfgContainer [2022-02-20 16:56:52,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:56:52,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:56:52,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:56:52,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:56:52,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:56:51" (1/3) ... [2022-02-20 16:56:52,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5dbcac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:56:52, skipping insertion in model container [2022-02-20 16:56:52,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:51" (2/3) ... [2022-02-20 16:56:52,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c5dbcac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:56:52, skipping insertion in model container [2022-02-20 16:56:52,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:56:52" (3/3) ... [2022-02-20 16:56:52,063 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all.i [2022-02-20 16:56:52,067 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:56:52,067 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:56:52,106 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:56:52,112 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:56:52,112 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:56:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 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:56:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:56:52,127 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:52,127 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:52,128 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:52,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash -409335067, now seen corresponding path program 1 times [2022-02-20 16:56:52,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:56:52,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919043425] [2022-02-20 16:56:52,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:52,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:56:52,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:56:52,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:56:52,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:56:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:52,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:56:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:52,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:52,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {23#true} is VALID [2022-02-20 16:56:52,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {23#true} is VALID [2022-02-20 16:56:52,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-02-20 16:56:52,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {24#false} is VALID [2022-02-20 16:56:52,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := ~bvsub32(main_~len~0#1, 1bv32); {24#false} is VALID [2022-02-20 16:56:52,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#false} assume !~bvsge32(main_~i~0#1, 0bv32); {24#false} is VALID [2022-02-20 16:56:52,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32); {24#false} is VALID [2022-02-20 16:56:52,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume 0bv32 != main_#t~mem11#1.base || 0bv32 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {24#false} is VALID [2022-02-20 16:56:52,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 16:56:52,307 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:56:52,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:56:52,307 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:56:52,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919043425] [2022-02-20 16:56:52,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919043425] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:52,308 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:56:52,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:56:52,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287258956] [2022-02-20 16:56:52,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:52,313 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:56:52,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:52,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:56:52,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:52,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:56:52,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:56:52,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:56:52,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:56:52,342 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 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 has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:56:52,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:52,390 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-02-20 16:56:52,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:56:52,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:56:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:56:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2022-02-20 16:56:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:56:52,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2022-02-20 16:56:52,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 39 transitions. [2022-02-20 16:56:52,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:52,460 INFO L225 Difference]: With dead ends: 32 [2022-02-20 16:56:52,460 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 16:56:52,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:56:52,466 INFO L933 BasicCegarLoop]: 22 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, 22 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:56:52,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 16:56:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 16:56:52,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:52,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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:56:52,488 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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:56:52,488 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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:56:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:52,498 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 16:56:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 16:56:52,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:52,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:52,499 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 16 states. [2022-02-20 16:56:52,499 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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 16 states. [2022-02-20 16:56:52,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:52,501 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-20 16:56:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 16:56:52,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:52,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:52,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:52,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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:56:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-02-20 16:56:52,507 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 9 [2022-02-20 16:56:52,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:52,508 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-02-20 16:56:52,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:56:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-20 16:56:52,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:56:52,509 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:52,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:52,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:56:52,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:56:52,720 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1724492075, now seen corresponding path program 1 times [2022-02-20 16:56:52,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:56:52,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458932744] [2022-02-20 16:56:52,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:52,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:56:52,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:56:52,722 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:56:52,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:56:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:52,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:56:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:52,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:52,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {147#true} is VALID [2022-02-20 16:56:52,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {155#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:56:52,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {155#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {148#false} is VALID [2022-02-20 16:56:52,823 INFO L290 TraceCheckUtils]: 3: Hoare triple {148#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {148#false} is VALID [2022-02-20 16:56:52,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {148#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := ~bvsub32(main_~len~0#1, 1bv32); {148#false} is VALID [2022-02-20 16:56:52,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {148#false} assume !~bvsge32(main_~i~0#1, 0bv32); {148#false} is VALID [2022-02-20 16:56:52,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {148#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32); {148#false} is VALID [2022-02-20 16:56:52,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#false} assume 0bv32 != main_#t~mem11#1.base || 0bv32 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {148#false} is VALID [2022-02-20 16:56:52,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-02-20 16:56:52,824 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:56:52,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:56:52,824 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:56:52,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458932744] [2022-02-20 16:56:52,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458932744] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:52,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:56:52,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:56:52,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545051429] [2022-02-20 16:56:52,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:52,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-02-20 16:56:52,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:52,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:56:52,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:52,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:56:52,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:56:52,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:56:52,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:56:52,841 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:56:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:52,905 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 16:56:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:56:52,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-02-20 16:56:52,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:56:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-02-20 16:56:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:56:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-02-20 16:56:52,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-02-20 16:56:52,942 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:56:52,943 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:56:52,943 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 16:56:52,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:56:52,944 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:52,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:52,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 16:56:52,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2022-02-20 16:56:52,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:52,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:56:52,947 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:56:52,947 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:56:52,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:52,948 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 16:56:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 16:56:52,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:52,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:52,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 21 states. [2022-02-20 16:56:52,948 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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 21 states. [2022-02-20 16:56:52,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:52,949 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 16:56:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 16:56:52,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:52,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:52,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:52,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 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:56:52,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-02-20 16:56:52,950 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2022-02-20 16:56:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:52,950 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-02-20 16:56:52,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:56:52,950 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-02-20 16:56:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:56:52,951 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:52,951 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:52,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:56:53,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:56:53,159 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:53,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1461985389, now seen corresponding path program 1 times [2022-02-20 16:56:53,160 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:56:53,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730403181] [2022-02-20 16:56:53,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:53,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:56:53,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:56:53,161 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:56:53,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:56:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:53,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:56:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:53,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:53,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {281#true} is VALID [2022-02-20 16:56:53,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {289#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:56:53,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {289#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} assume !!~bvsgt32(sll_create_~len#1, 0bv32);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {289#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:56:53,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {289#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} assume !(0bv32 == node_create_~temp~0#1.base && 0bv32 == node_create_~temp~0#1.offset); {289#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:56:53,278 INFO L290 TraceCheckUtils]: 4: Hoare triple {289#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} call write~$Pointer$(0bv32, 0bv32, node_create_~temp~0#1.base, ~bvadd32(4bv32, node_create_~temp~0#1.offset), 4bv32);call write~intINTTYPE4(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4bv32);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {289#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:56:53,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {289#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);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; {289#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:56:53,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {289#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {305#(= (bvadd |ULTIMATE.start_sll_create_~len#1| (_ bv1 32)) (_ bv2 32))} is VALID [2022-02-20 16:56:53,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {305#(= (bvadd |ULTIMATE.start_sll_create_~len#1| (_ bv1 32)) (_ bv2 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {282#false} is VALID [2022-02-20 16:56:53,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {282#false} is VALID [2022-02-20 16:56:53,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := ~bvsub32(main_~len~0#1, 1bv32); {282#false} is VALID [2022-02-20 16:56:53,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#false} assume !~bvsge32(main_~i~0#1, 0bv32); {282#false} is VALID [2022-02-20 16:56:53,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32); {282#false} is VALID [2022-02-20 16:56:53,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#false} assume 0bv32 != main_#t~mem11#1.base || 0bv32 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {282#false} is VALID [2022-02-20 16:56:53,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-02-20 16:56:53,283 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:56:53,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:56:53,374 INFO L290 TraceCheckUtils]: 13: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-02-20 16:56:53,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#false} assume 0bv32 != main_#t~mem11#1.base || 0bv32 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {282#false} is VALID [2022-02-20 16:56:53,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32); {282#false} is VALID [2022-02-20 16:56:53,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#false} assume !~bvsge32(main_~i~0#1, 0bv32); {282#false} is VALID [2022-02-20 16:56:53,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := ~bvsub32(main_~len~0#1, 1bv32); {282#false} is VALID [2022-02-20 16:56:53,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {282#false} is VALID [2022-02-20 16:56:53,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#(bvsgt |ULTIMATE.start_sll_create_~len#1| (_ bv0 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {282#false} is VALID [2022-02-20 16:56:53,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {349#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {345#(bvsgt |ULTIMATE.start_sll_create_~len#1| (_ bv0 32))} is VALID [2022-02-20 16:56:53,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {349#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);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; {349#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 16:56:53,379 INFO L290 TraceCheckUtils]: 4: Hoare triple {349#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} call write~$Pointer$(0bv32, 0bv32, node_create_~temp~0#1.base, ~bvadd32(4bv32, node_create_~temp~0#1.offset), 4bv32);call write~intINTTYPE4(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4bv32);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {349#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 16:56:53,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {349#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} assume !(0bv32 == node_create_~temp~0#1.base && 0bv32 == node_create_~temp~0#1.offset); {349#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 16:56:53,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {349#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} assume !!~bvsgt32(sll_create_~len#1, 0bv32);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {349#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 16:56:53,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {349#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 16:56:53,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {281#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {281#true} is VALID [2022-02-20 16:56:53,381 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:56:53,387 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:56:53,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730403181] [2022-02-20 16:56:53,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730403181] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:56:53,387 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:56:53,387 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-02-20 16:56:53,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449361774] [2022-02-20 16:56:53,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:56:53,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:56:53,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:53,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:56:53,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:53,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:56:53,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:56:53,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:56:53,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:56:53,417 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:56:53,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:53,590 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-02-20 16:56:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:56:53,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:56:53,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:56:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-02-20 16:56:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:56:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-02-20 16:56:53,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-02-20 16:56:53,626 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:56:53,626 INFO L225 Difference]: With dead ends: 35 [2022-02-20 16:56:53,627 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:56:53,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:56:53,628 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:53,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 57 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:53,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:56:53,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2022-02-20 16:56:53,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:53,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:56:53,630 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:56:53,630 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:56:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:53,631 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 16:56:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 16:56:53,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:53,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:53,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 26 states. [2022-02-20 16:56:53,632 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 26 states. [2022-02-20 16:56:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:53,633 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 16:56:53,633 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 16:56:53,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:53,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:53,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:53,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:56:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-02-20 16:56:53,634 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2022-02-20 16:56:53,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:53,634 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-02-20 16:56:53,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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:56:53,634 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-02-20 16:56:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:56:53,635 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:53,635 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:53,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:56:53,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:56:53,838 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:53,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:53,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1187812821, now seen corresponding path program 2 times [2022-02-20 16:56:53,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:56:53,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541572570] [2022-02-20 16:56:53,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:56:53,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:56:53,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:56:53,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:56:53,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:56:53,901 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 16:56:53,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:56:53,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:56:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:53,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:54,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {496#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {496#true} is VALID [2022-02-20 16:56:54,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {496#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !!~bvsgt32(sll_create_~len#1, 0bv32);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !(0bv32 == node_create_~temp~0#1.base && 0bv32 == node_create_~temp~0#1.offset); {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(0bv32, 0bv32, node_create_~temp~0#1.base, ~bvadd32(4bv32, node_create_~temp~0#1.offset), 4bv32);call write~intINTTYPE4(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4bv32);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);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; {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !!~bvsgt32(sll_create_~len#1, 0bv32);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !(0bv32 == node_create_~temp~0#1.base && 0bv32 == node_create_~temp~0#1.offset); {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(0bv32, 0bv32, node_create_~temp~0#1.base, ~bvadd32(4bv32, node_create_~temp~0#1.offset), 4bv32);call write~intINTTYPE4(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4bv32);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);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; {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !~bvsgt32(sll_create_~len#1, 0bv32); {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {504#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := ~bvsub32(main_~len~0#1, 1bv32); {544#(= (_ bv2 32) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:56:54,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {544#(= (_ bv2 32) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))} assume !~bvsge32(main_~i~0#1, 0bv32); {497#false} is VALID [2022-02-20 16:56:54,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {497#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32); {497#false} is VALID [2022-02-20 16:56:54,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {497#false} assume 0bv32 != main_#t~mem11#1.base || 0bv32 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {497#false} is VALID [2022-02-20 16:56:54,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {497#false} assume !false; {497#false} is VALID [2022-02-20 16:56:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:56:54,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:56:54,036 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:56:54,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541572570] [2022-02-20 16:56:54,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541572570] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:54,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:56:54,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:56:54,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298095194] [2022-02-20 16:56:54,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:54,039 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 19 [2022-02-20 16:56:54,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:54,039 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:56:54,054 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:56:54,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:56:54,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:56:54,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:56:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:56:54,055 INFO L87 Difference]: Start difference. First operand 22 states and 23 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:56:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:54,137 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-02-20 16:56:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:56:54,137 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 19 [2022-02-20 16:56:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:54,137 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:56:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 16:56:54,138 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:56:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-02-20 16:56:54,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2022-02-20 16:56:54,165 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:56:54,166 INFO L225 Difference]: With dead ends: 29 [2022-02-20 16:56:54,166 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:56:54,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:56:54,167 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:54,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:54,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:56:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-02-20 16:56:54,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:54,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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:56:54,170 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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:56:54,170 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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:56:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:54,171 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-20 16:56:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-20 16:56:54,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:54,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:54,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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 25 states. [2022-02-20 16:56:54,171 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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 25 states. [2022-02-20 16:56:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:54,172 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-20 16:56:54,172 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-20 16:56:54,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:54,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:54,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:54,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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:56:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-02-20 16:56:54,173 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2022-02-20 16:56:54,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:54,173 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-02-20 16:56:54,174 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:56:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-02-20 16:56:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:56:54,174 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:54,174 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:54,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:56:54,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:56:54,381 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:54,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:54,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1492503821, now seen corresponding path program 1 times [2022-02-20 16:56:54,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:56:54,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76524194] [2022-02-20 16:56:54,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:54,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:56:54,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:56:54,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:56:54,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:56:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:54,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:56:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:54,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:54,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {679#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {679#true} is VALID [2022-02-20 16:56:54,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !!~bvsgt32(sll_create_~len#1, 0bv32);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !(0bv32 == node_create_~temp~0#1.base && 0bv32 == node_create_~temp~0#1.offset); {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(0bv32, 0bv32, node_create_~temp~0#1.base, ~bvadd32(4bv32, node_create_~temp~0#1.offset), 4bv32);call write~intINTTYPE4(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4bv32);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);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; {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !!~bvsgt32(sll_create_~len#1, 0bv32);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !(0bv32 == node_create_~temp~0#1.base && 0bv32 == node_create_~temp~0#1.offset); {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call write~$Pointer$(0bv32, 0bv32, node_create_~temp~0#1.base, ~bvadd32(4bv32, node_create_~temp~0#1.offset), 4bv32);call write~intINTTYPE4(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4bv32);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);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; {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !~bvsgt32(sll_create_~len#1, 0bv32); {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:54,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {687#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := ~bvsub32(main_~len~0#1, 1bv32); {727#(= (_ bv2 32) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:56:54,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {727#(= (_ bv2 32) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))} assume !!~bvsge32(main_~i~0#1, 0bv32);assume { :begin_inline_sll_remove_first } true;sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset, sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset, sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset;sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset := sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset;call sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4bv32);call sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset := read~$Pointer$(sll_remove_first_#t~mem6#1.base, ~bvadd32(4bv32, sll_remove_first_#t~mem6#1.offset), 4bv32);sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset := sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset;havoc sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;call sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4bv32);call ULTIMATE.dealloc(sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset);havoc sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset;call write~$Pointer$(sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4bv32); {727#(= (_ bv2 32) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:56:54,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {727#(= (_ bv2 32) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))} assume { :end_inline_sll_remove_first } true; {727#(= (_ bv2 32) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))} is VALID [2022-02-20 16:56:54,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {727#(= (_ bv2 32) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := ~bvsub32(main_#t~post10#1, 1bv32);havoc main_#t~post10#1; {737#(= (_ bv2 32) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))} is VALID [2022-02-20 16:56:54,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {737#(= (_ bv2 32) (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv2 32)))} assume !~bvsge32(main_~i~0#1, 0bv32); {680#false} is VALID [2022-02-20 16:56:54,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {680#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32); {680#false} is VALID [2022-02-20 16:56:54,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {680#false} assume 0bv32 != main_#t~mem11#1.base || 0bv32 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {680#false} is VALID [2022-02-20 16:56:54,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {680#false} assume !false; {680#false} is VALID [2022-02-20 16:56:54,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:56:54,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:56:54,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {680#false} assume !false; {680#false} is VALID [2022-02-20 16:56:54,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {680#false} assume 0bv32 != main_#t~mem11#1.base || 0bv32 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {680#false} is VALID [2022-02-20 16:56:54,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {680#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32); {680#false} is VALID [2022-02-20 16:56:54,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {759#(bvsge |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !~bvsge32(main_~i~0#1, 0bv32); {680#false} is VALID [2022-02-20 16:56:54,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {763#(bvsge (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := ~bvsub32(main_#t~post10#1, 1bv32);havoc main_#t~post10#1; {759#(bvsge |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:56:54,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {763#(bvsge (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))} assume { :end_inline_sll_remove_first } true; {763#(bvsge (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))} is VALID [2022-02-20 16:56:54,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {763#(bvsge (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))} assume !!~bvsge32(main_~i~0#1, 0bv32);assume { :begin_inline_sll_remove_first } true;sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset, sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset, sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset;sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset := sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset;call sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4bv32);call sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset := read~$Pointer$(sll_remove_first_#t~mem6#1.base, ~bvadd32(4bv32, sll_remove_first_#t~mem6#1.offset), 4bv32);sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset := sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset;havoc sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;call sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4bv32);call ULTIMATE.dealloc(sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset);havoc sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset;call write~$Pointer$(sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4bv32); {763#(bvsge (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))} is VALID [2022-02-20 16:56:54,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := ~bvsub32(main_~len~0#1, 1bv32); {763#(bvsge (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~0#1|) (_ bv0 32))} is VALID [2022-02-20 16:56:54,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 16:56:54,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 16:56:54,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 16:56:54,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);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; {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 16:56:54,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} call write~$Pointer$(0bv32, 0bv32, node_create_~temp~0#1.base, ~bvadd32(4bv32, node_create_~temp~0#1.offset), 4bv32);call write~intINTTYPE4(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4bv32);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 16:56:54,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} assume !(0bv32 == node_create_~temp~0#1.base && 0bv32 == node_create_~temp~0#1.offset); {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 16:56:54,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvsgt32(sll_create_~len#1, 0bv32);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 16:56:54,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 16:56:54,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);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; {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 16:56:54,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} call write~$Pointer$(0bv32, 0bv32, node_create_~temp~0#1.base, ~bvadd32(4bv32, node_create_~temp~0#1.offset), 4bv32);call write~intINTTYPE4(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4bv32);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 16:56:54,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} assume !(0bv32 == node_create_~temp~0#1.base && 0bv32 == node_create_~temp~0#1.offset); {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 16:56:54,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvsgt32(sll_create_~len#1, 0bv32);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 16:56:54,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {679#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {773#(bvsge (bvadd |ULTIMATE.start_main_~len~0#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 16:56:54,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {679#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {679#true} is VALID [2022-02-20 16:56:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:56:54,722 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:56:54,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76524194] [2022-02-20 16:56:54,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76524194] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:56:54,722 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:56:54,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 16:56:54,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594628743] [2022-02-20 16:56:54,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:56:54,723 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:56:54,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:54,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:56:54,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:54,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:56:54,755 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:56:54,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:56:54,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:56:54,756 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:56:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:54,922 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-20 16:56:54,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:56:54,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:56:54,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:56:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-02-20 16:56:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:56:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-02-20 16:56:54,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-02-20 16:56:54,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:54,950 INFO L225 Difference]: With dead ends: 32 [2022-02-20 16:56:54,950 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:56:54,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:56:54,951 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:54,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 41 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:56:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-02-20 16:56:54,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:54,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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:56:54,960 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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:56:54,960 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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:56:54,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:54,961 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-20 16:56:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-02-20 16:56:54,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:54,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:54,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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 28 states. [2022-02-20 16:56:54,962 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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 28 states. [2022-02-20 16:56:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:54,963 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-20 16:56:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-02-20 16:56:54,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:54,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:54,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:54,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:54,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 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:56:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-20 16:56:54,964 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2022-02-20 16:56:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:54,965 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-20 16:56:54,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:56:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 16:56:54,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:56:54,965 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:54,966 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:54,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:56:55,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:56:55,179 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:55,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1018778923, now seen corresponding path program 2 times [2022-02-20 16:56:55,179 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:56:55,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190823426] [2022-02-20 16:56:55,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:56:55,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:56:55,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:56:55,180 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:56:55,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:56:55,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:56:55,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:56:55,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 67 conjunts are in the unsatisfiable core [2022-02-20 16:56:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:55,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:55,361 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:56:55,417 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 16:56:55,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-20 16:56:55,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 16:56:55,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 16:56:55,622 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-20 16:56:55,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2022-02-20 16:56:55,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 16:56:55,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 16:56:55,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 16:56:55,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-02-20 16:56:56,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:56:56,231 INFO L356 Elim1Store]: treesize reduction 151, result has 15.6 percent of original size [2022-02-20 16:56:56,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 128 treesize of output 91 [2022-02-20 16:56:56,256 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:56:56,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 60 [2022-02-20 16:56:56,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:56:56,566 INFO L356 Elim1Store]: treesize reduction 120, result has 14.9 percent of original size [2022-02-20 16:56:56,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 100 treesize of output 83 [2022-02-20 16:56:56,597 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:56:56,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 68 [2022-02-20 16:56:56,966 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-02-20 16:56:56,966 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 2 case distinctions, treesize of input 76 treesize of output 39 [2022-02-20 16:56:57,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2022-02-20 16:56:57,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {956#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(19bv32, 2bv32); {956#true} is VALID [2022-02-20 16:56:57,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {956#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {964#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:56:57,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {964#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32)))} assume !!~bvsgt32(sll_create_~len#1, 0bv32);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {968#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_node_create_~temp~0#1.offset|) (= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (_ bv0 1)) (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:56:57,081 INFO L290 TraceCheckUtils]: 3: Hoare triple {968#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_node_create_~temp~0#1.offset|) (= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (_ bv0 1)) (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32)))} assume !(0bv32 == node_create_~temp~0#1.base && 0bv32 == node_create_~temp~0#1.offset); {968#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_node_create_~temp~0#1.offset|) (= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (_ bv0 1)) (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:56:57,082 INFO L290 TraceCheckUtils]: 4: Hoare triple {968#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) (_ bv1 1)) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_node_create_~temp~0#1.offset|) (= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (_ bv0 1)) (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32)))} call write~$Pointer$(0bv32, 0bv32, node_create_~temp~0#1.base, ~bvadd32(4bv32, node_create_~temp~0#1.offset), 4bv32);call write~intINTTYPE4(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4bv32);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {975#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (_ bv0 1)) (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) (_ bv1 1)) (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_node_create_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:56:57,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {975#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (_ bv0 1)) (= (select |#valid| |ULTIMATE.start_node_create_#res#1.base|) (_ bv1 1)) (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_node_create_#res#1.offset| (_ bv0 32)))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);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; {979#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} is VALID [2022-02-20 16:56:57,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {979#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {979#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} is VALID [2022-02-20 16:56:57,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {979#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|)) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} assume !!~bvsgt32(sll_create_~len#1, 0bv32);assume { :begin_inline_node_create } true;node_create_#in~data#1 := sll_create_~data#1;havoc node_create_#res#1.base, node_create_#res#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset, node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset;node_create_~data#1 := node_create_#in~data#1;call node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);node_create_~temp~0#1.base, node_create_~temp~0#1.offset := node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset;havoc node_create_#t~malloc3#1.base, node_create_#t~malloc3#1.offset; {986#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_node_create_~temp~0#1.offset|) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} is VALID [2022-02-20 16:56:57,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {986#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_node_create_~temp~0#1.offset|) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} assume !(0bv32 == node_create_~temp~0#1.base && 0bv32 == node_create_~temp~0#1.offset); {986#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_node_create_~temp~0#1.offset|) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} is VALID [2022-02-20 16:56:57,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {986#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_node_create_~temp~0#1.offset|) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} call write~$Pointer$(0bv32, 0bv32, node_create_~temp~0#1.base, ~bvadd32(4bv32, node_create_~temp~0#1.offset), 4bv32);call write~intINTTYPE4(node_create_~data#1, node_create_~temp~0#1.base, node_create_~temp~0#1.offset, 4bv32);node_create_#res#1.base, node_create_#res#1.offset := node_create_~temp~0#1.base, node_create_~temp~0#1.offset; {993#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_node_create_#res#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} is VALID [2022-02-20 16:56:57,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {993#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= |ULTIMATE.start_node_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_node_create_#res#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);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; {997#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} is VALID [2022-02-20 16:56:57,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {997#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {997#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} is VALID [2022-02-20 16:56:57,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {997#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {997#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} is VALID [2022-02-20 16:56:57,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {997#(and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32))) |ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1007#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_sll_create_#res#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv4 32)) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= |ULTIMATE.start_sll_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:56:57,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {1007#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_sll_create_#res#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv4 32)) |ULTIMATE.start_sll_create_#res#1.base|)) (not (= |ULTIMATE.start_sll_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_#res#1.base|) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)))} main_#t~ret9#1.base, main_#t~ret9#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := ~bvsub32(main_~len~0#1, 1bv32); {1011#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:56:57,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {1011#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)))} assume !!~bvsge32(main_~i~0#1, 0bv32);assume { :begin_inline_sll_remove_first } true;sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset, sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset, sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset;sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset := sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset;call sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4bv32);call sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset := read~$Pointer$(sll_remove_first_#t~mem6#1.base, ~bvadd32(4bv32, sll_remove_first_#t~mem6#1.offset), 4bv32);sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset := sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset;havoc sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;call sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4bv32);call ULTIMATE.dealloc(sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset);havoc sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset;call write~$Pointer$(sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4bv32); {1015#(exists ((v_arrayElimCell_10 (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_10)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) v_arrayElimCell_10)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} is VALID [2022-02-20 16:56:57,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {1015#(exists ((v_arrayElimCell_10 (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_10)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) v_arrayElimCell_10)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} assume { :end_inline_sll_remove_first } true; {1015#(exists ((v_arrayElimCell_10 (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_10)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) v_arrayElimCell_10)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} is VALID [2022-02-20 16:56:57,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {1015#(exists ((v_arrayElimCell_10 (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_10)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) v_arrayElimCell_10)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := ~bvsub32(main_#t~post10#1, 1bv32);havoc main_#t~post10#1; {1015#(exists ((v_arrayElimCell_10 (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_10)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) v_arrayElimCell_10)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} is VALID [2022-02-20 16:56:59,503 WARN L290 TraceCheckUtils]: 18: Hoare triple {1015#(exists ((v_arrayElimCell_10 (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_10)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) v_arrayElimCell_10)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} assume !!~bvsge32(main_~i~0#1, 0bv32);assume { :begin_inline_sll_remove_first } true;sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset, sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset, sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset;sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset := sll_remove_first_#in~head#1.base, sll_remove_first_#in~head#1.offset;call sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4bv32);call sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset := read~$Pointer$(sll_remove_first_#t~mem6#1.base, ~bvadd32(4bv32, sll_remove_first_#t~mem6#1.offset), 4bv32);sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset := sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;havoc sll_remove_first_#t~mem6#1.base, sll_remove_first_#t~mem6#1.offset;havoc sll_remove_first_#t~mem7#1.base, sll_remove_first_#t~mem7#1.offset;call sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset := read~$Pointer$(sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4bv32);call ULTIMATE.dealloc(sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset);havoc sll_remove_first_#t~mem8#1.base, sll_remove_first_#t~mem8#1.offset;call write~$Pointer$(sll_remove_first_~temp~1#1.base, sll_remove_first_~temp~1#1.offset, sll_remove_first_~head#1.base, sll_remove_first_~head#1.offset, 4bv32); {1025#(exists ((v_arrayElimCell_10 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_10)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) v_arrayElimCell_10)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} is UNKNOWN [2022-02-20 16:56:59,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {1025#(exists ((v_arrayElimCell_10 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_10)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) v_arrayElimCell_10)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} assume { :end_inline_sll_remove_first } true; {1025#(exists ((v_arrayElimCell_10 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_10)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) v_arrayElimCell_10)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} is VALID [2022-02-20 16:56:59,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {1025#(exists ((v_arrayElimCell_10 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_10)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) v_arrayElimCell_10)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := ~bvsub32(main_#t~post10#1, 1bv32);havoc main_#t~post10#1; {1025#(exists ((v_arrayElimCell_10 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_10)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) v_arrayElimCell_10)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} is VALID [2022-02-20 16:56:59,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {1025#(exists ((v_arrayElimCell_10 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_10)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) v_arrayElimCell_10)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} assume !~bvsge32(main_~i~0#1, 0bv32); {1025#(exists ((v_arrayElimCell_10 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_10)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) v_arrayElimCell_10)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} is VALID [2022-02-20 16:56:59,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {1025#(exists ((v_arrayElimCell_10 (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_10)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) v_arrayElimCell_10)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_10) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_arrayElimCell_10) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32); {1038#(and (= |ULTIMATE.start_main_#t~mem11#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem11#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:56:59,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {1038#(and (= |ULTIMATE.start_main_#t~mem11#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem11#1.offset| (_ bv0 32)))} assume 0bv32 != main_#t~mem11#1.base || 0bv32 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {957#false} is VALID [2022-02-20 16:56:59,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {957#false} assume !false; {957#false} is VALID [2022-02-20 16:56:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:56:59,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:57:18,789 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 32))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse5 (select .cse4 |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select .cse0 |ULTIMATE.start_main_~#s~0#1.offset|))) (or (let ((.cse6 (bvadd (_ bv4 32) .cse7))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse5) .cse6)) (.cse3 (bvadd (_ bv4 32) .cse1))) (and (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse0 |ULTIMATE.start_main_~#s~0#1.offset| .cse1)) .cse2) .cse3)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse4 |ULTIMATE.start_main_~#s~0#1.offset| .cse2)) .cse2) .cse3) (_ bv0 32)))))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse5)) (not (= .cse7 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))))) is different from false [2022-02-20 16:57:47,663 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:57:47,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1624 treesize of output 1014