./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.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/dll2n_insert_unequal.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 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:54:32,568 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:54:32,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:54:32,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:54:32,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:54:32,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:54:32,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:54:32,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:54:32,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:54:32,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:54:32,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:54:32,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:54:32,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:54:32,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:54:32,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:54:32,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:54:32,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:54:32,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:54:32,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:54:32,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:54:32,619 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:54:32,620 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:54:32,621 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:54:32,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:54:32,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:54:32,623 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:54:32,623 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:54:32,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:54:32,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:54:32,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:54:32,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:54:32,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:54:32,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:54:32,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:54:32,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:54:32,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:54:32,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:54:32,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:54:32,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:54:32,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:54:32,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:54:32,638 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:54:32,652 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:54:32,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:54:32,655 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:54:32,655 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:54:32,656 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:54:32,656 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:54:32,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:54:32,657 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:54:32,657 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:54:32,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:54:32,658 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:54:32,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:54:32,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:54:32,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:54:32,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:54:32,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:54:32,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:54:32,658 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:54:32,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:54:32,659 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:54:32,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:54:32,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:54:32,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:54:32,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:54:32,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:32,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:54:32,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:54:32,660 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:54:32,660 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:54:32,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:54:32,660 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:54:32,661 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:54:32,661 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:54:32,661 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2022-02-20 16:54:32,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:54:32,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:54:32,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:54:32,873 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:54:32,878 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:54:32,879 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2022-02-20 16:54:32,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5134fd921/2db20216fa094b069415c6a1ad0f6e4e/FLAG55e909096 [2022-02-20 16:54:33,380 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:54:33,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2022-02-20 16:54:33,405 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5134fd921/2db20216fa094b069415c6a1ad0f6e4e/FLAG55e909096 [2022-02-20 16:54:33,713 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5134fd921/2db20216fa094b069415c6a1ad0f6e4e [2022-02-20 16:54:33,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:54:33,721 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:54:33,734 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:33,734 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:54:33,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:54:33,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:33" (1/1) ... [2022-02-20 16:54:33,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b3eef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:33, skipping insertion in model container [2022-02-20 16:54:33,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:33" (1/1) ... [2022-02-20 16:54:33,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:54:33,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:54:34,189 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/dll2n_insert_unequal.i[24989,25002] [2022-02-20 16:54:34,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:34,198 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:54:34,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i[24989,25002] [2022-02-20 16:54:34,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:34,309 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:54:34,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:34 WrapperNode [2022-02-20 16:54:34,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:34,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:34,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:54:34,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:54:34,329 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:54:34" (1/1) ... [2022-02-20 16:54:34,364 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:54:34" (1/1) ... [2022-02-20 16:54:34,391 INFO L137 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 165 [2022-02-20 16:54:34,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:34,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:54:34,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:54:34,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:54:34,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:34" (1/1) ... [2022-02-20 16:54:34,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:34" (1/1) ... [2022-02-20 16:54:34,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:34" (1/1) ... [2022-02-20 16:54:34,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:34" (1/1) ... [2022-02-20 16:54:34,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:34" (1/1) ... [2022-02-20 16:54:34,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:34" (1/1) ... [2022-02-20 16:54:34,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:34" (1/1) ... [2022-02-20 16:54:34,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:54:34,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:54:34,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:54:34,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:54:34,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:34" (1/1) ... [2022-02-20 16:54:34,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:34,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:34,544 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:54:34,581 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:54:34,622 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-02-20 16:54:34,623 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-02-20 16:54:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:54:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:54:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:54:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:54:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:54:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:54:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:54:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:54:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 16:54:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:54:34,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:54:34,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:54:34,750 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:54:34,752 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:54:34,792 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-02-20 16:54:34,995 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:54:35,000 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:54:35,000 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 16:54:35,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:35 BoogieIcfgContainer [2022-02-20 16:54:35,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:54:35,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:54:35,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:54:35,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:54:35,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:54:33" (1/3) ... [2022-02-20 16:54:35,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da6947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:35, skipping insertion in model container [2022-02-20 16:54:35,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:34" (2/3) ... [2022-02-20 16:54:35,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da6947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:35, skipping insertion in model container [2022-02-20 16:54:35,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:35" (3/3) ... [2022-02-20 16:54:35,007 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2022-02-20 16:54:35,010 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:54:35,011 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:54:35,038 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:54:35,043 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:54:35,043 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:54:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:35,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:54:35,062 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:35,062 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:35,063 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:35,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:35,070 INFO L85 PathProgramCache]: Analyzing trace with hash -504255867, now seen corresponding path program 1 times [2022-02-20 16:54:35,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:35,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973523867] [2022-02-20 16:54:35,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:35,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:35,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {39#true} is VALID [2022-02-20 16:54:35,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~post18#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~post24#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {39#true} is VALID [2022-02-20 16:54:35,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume !true; {40#false} is VALID [2022-02-20 16:54:35,240 INFO L290 TraceCheckUtils]: 3: Hoare triple {40#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {40#false} is VALID [2022-02-20 16:54:35,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {40#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_insert } true;dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset, dll_insert_#in~data#1, dll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset, dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset, dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset, dll_insert_#t~post10#1, dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset, dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset, dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset, dll_insert_~head#1.base, dll_insert_~head#1.offset, dll_insert_~data#1, dll_insert_~index#1, dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset;dll_insert_~head#1.base, dll_insert_~head#1.offset := dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset;dll_insert_~data#1 := dll_insert_#in~data#1;dll_insert_~index#1 := dll_insert_#in~index#1;assume { :begin_inline_node_create } true;node_create_#in~data#1 := dll_insert_~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(12);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; {40#false} is VALID [2022-02-20 16:54:35,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#false} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {40#false} is VALID [2022-02-20 16:54:35,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#false} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 8 + 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; {40#false} is VALID [2022-02-20 16:54:35,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#false} dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset := dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset := 0, 0;call dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset := dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset;havoc dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset; {40#false} is VALID [2022-02-20 16:54:35,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#false} assume !(dll_insert_~index#1 > 0); {40#false} is VALID [2022-02-20 16:54:35,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume dll_insert_~snd_to_last~0#1.base != 0 || dll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, 4 + dll_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~new_node~0#1.base, 8 + dll_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset, dll_insert_~new_node~0#1.base, 4 + dll_insert_~new_node~0#1.offset, 4); {40#false} is VALID [2022-02-20 16:54:35,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {40#false} assume dll_insert_~last~0#1.base != 0 || dll_insert_~last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~last~0#1.base, 8 + dll_insert_~last~0#1.offset, 4); {40#false} is VALID [2022-02-20 16:54:35,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} assume { :end_inline_dll_insert } true;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;main_~count~0#1 := 0; {40#false} is VALID [2022-02-20 16:54:35,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !!((main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0) && main_~count~0#1 != main_~mid_index~0#1);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4);main_~temp~2#1.base, main_~temp~2#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1 := read~int(main_~ptr~0#1.base, main_~ptr~0#1.offset, 4); {40#false} is VALID [2022-02-20 16:54:35,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#false} assume main_~data~0#1 != main_#t~mem17#1;havoc main_#t~mem17#1; {40#false} is VALID [2022-02-20 16:54:35,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-02-20 16:54:35,244 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:54:35,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:35,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973523867] [2022-02-20 16:54:35,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973523867] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:35,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:35,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:54:35,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160889982] [2022-02-20 16:54:35,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:35,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-02-20 16:54:35,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:35,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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:54:35,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:35,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:54:35,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:35,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:54:35,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:54:35,306 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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:54:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:35,365 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2022-02-20 16:54:35,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:54:35,366 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-02-20 16:54:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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:54:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2022-02-20 16:54:35,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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:54:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2022-02-20 16:54:35,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 98 transitions. [2022-02-20 16:54:35,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:35,516 INFO L225 Difference]: With dead ends: 64 [2022-02-20 16:54:35,517 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 16:54:35,519 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:54:35,521 INFO L933 BasicCegarLoop]: 49 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, 49 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:54:35,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:35,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 16:54:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 16:54:35,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:35,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 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:54:35,540 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 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:54:35,540 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 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:54:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:35,543 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-02-20 16:54:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-02-20 16:54:35,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:35,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:35,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 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 27 states. [2022-02-20 16:54:35,544 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 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 27 states. [2022-02-20 16:54:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:35,545 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-02-20 16:54:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-02-20 16:54:35,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:35,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:35,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:35,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 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:54:35,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-02-20 16:54:35,549 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 15 [2022-02-20 16:54:35,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:35,549 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-02-20 16:54:35,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 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:54:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-02-20 16:54:35,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:54:35,550 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:35,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:35,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:54:35,551 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:35,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash 775433970, now seen corresponding path program 1 times [2022-02-20 16:54:35,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:35,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784382025] [2022-02-20 16:54:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:35,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:35,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {219#true} is VALID [2022-02-20 16:54:35,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~post18#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~post24#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {221#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 16:54:35,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {221#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !(dll_create_~len#1 > 0); {220#false} is VALID [2022-02-20 16:54:35,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {220#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {220#false} is VALID [2022-02-20 16:54:35,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {220#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_insert } true;dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset, dll_insert_#in~data#1, dll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset, dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset, dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset, dll_insert_#t~post10#1, dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset, dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset, dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset, dll_insert_~head#1.base, dll_insert_~head#1.offset, dll_insert_~data#1, dll_insert_~index#1, dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset;dll_insert_~head#1.base, dll_insert_~head#1.offset := dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset;dll_insert_~data#1 := dll_insert_#in~data#1;dll_insert_~index#1 := dll_insert_#in~index#1;assume { :begin_inline_node_create } true;node_create_#in~data#1 := dll_insert_~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(12);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; {220#false} is VALID [2022-02-20 16:54:35,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#false} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {220#false} is VALID [2022-02-20 16:54:35,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {220#false} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 8 + 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; {220#false} is VALID [2022-02-20 16:54:35,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#false} dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset := dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset := 0, 0;call dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset := dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset;havoc dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset; {220#false} is VALID [2022-02-20 16:54:35,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#false} assume !(dll_insert_~index#1 > 0); {220#false} is VALID [2022-02-20 16:54:35,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#false} assume dll_insert_~snd_to_last~0#1.base != 0 || dll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, 4 + dll_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~new_node~0#1.base, 8 + dll_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset, dll_insert_~new_node~0#1.base, 4 + dll_insert_~new_node~0#1.offset, 4); {220#false} is VALID [2022-02-20 16:54:35,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {220#false} assume dll_insert_~last~0#1.base != 0 || dll_insert_~last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~last~0#1.base, 8 + dll_insert_~last~0#1.offset, 4); {220#false} is VALID [2022-02-20 16:54:35,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {220#false} assume { :end_inline_dll_insert } true;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;main_~count~0#1 := 0; {220#false} is VALID [2022-02-20 16:54:35,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {220#false} assume !!((main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0) && main_~count~0#1 != main_~mid_index~0#1);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4);main_~temp~2#1.base, main_~temp~2#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1 := read~int(main_~ptr~0#1.base, main_~ptr~0#1.offset, 4); {220#false} is VALID [2022-02-20 16:54:35,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {220#false} assume main_~data~0#1 != main_#t~mem17#1;havoc main_#t~mem17#1; {220#false} is VALID [2022-02-20 16:54:35,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-02-20 16:54:35,603 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:54:35,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:35,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784382025] [2022-02-20 16:54:35,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784382025] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:35,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:35,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:54:35,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900297718] [2022-02-20 16:54:35,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:35,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-02-20 16:54:35,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:35,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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:54:35,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:35,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:54:35,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:35,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:54:35,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:54:35,619 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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:54:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:35,669 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2022-02-20 16:54:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:54:35,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-02-20 16:54:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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:54:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-02-20 16:54:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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:54:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-02-20 16:54:35,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-02-20 16:54:35,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:35,727 INFO L225 Difference]: With dead ends: 52 [2022-02-20 16:54:35,727 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:54:35,728 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:54:35,729 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 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:54:35,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:54:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:54:35,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:35,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 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:54:35,732 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 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:54:35,733 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 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:54:35,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:35,734 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-02-20 16:54:35,734 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-02-20 16:54:35,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:35,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:35,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 16:54:35,735 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 16:54:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:35,736 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-02-20 16:54:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-02-20 16:54:35,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:35,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:35,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:35,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:35,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 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:54:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-02-20 16:54:35,739 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2022-02-20 16:54:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:35,739 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-02-20 16:54:35,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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:54:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-02-20 16:54:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:54:35,740 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:35,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:35,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:54:35,740 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:35,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:35,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1038406110, now seen corresponding path program 1 times [2022-02-20 16:54:35,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:35,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177787327] [2022-02-20 16:54:35,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:35,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:35,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {390#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {390#true} is VALID [2022-02-20 16:54:35,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {390#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~post18#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~post24#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {392#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:54:35,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {392#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {392#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:54:35,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {392#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {392#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:54:35,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {392#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); {392#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:54:35,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {392#(and (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0;call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); {391#false} is VALID [2022-02-20 16:54:35,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {391#false} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {391#false} is VALID [2022-02-20 16:54:35,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {391#false} assume !(dll_create_~len#1 > 0); {391#false} is VALID [2022-02-20 16:54:35,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {391#false} is VALID [2022-02-20 16:54:35,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_insert } true;dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset, dll_insert_#in~data#1, dll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset, dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset, dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset, dll_insert_#t~post10#1, dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset, dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset, dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset, dll_insert_~head#1.base, dll_insert_~head#1.offset, dll_insert_~data#1, dll_insert_~index#1, dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset;dll_insert_~head#1.base, dll_insert_~head#1.offset := dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset;dll_insert_~data#1 := dll_insert_#in~data#1;dll_insert_~index#1 := dll_insert_#in~index#1;assume { :begin_inline_node_create } true;node_create_#in~data#1 := dll_insert_~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(12);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; {391#false} is VALID [2022-02-20 16:54:35,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {391#false} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {391#false} is VALID [2022-02-20 16:54:35,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {391#false} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 8 + 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; {391#false} is VALID [2022-02-20 16:54:35,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {391#false} dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset := dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset := 0, 0;call dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset := dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset;havoc dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset; {391#false} is VALID [2022-02-20 16:54:35,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {391#false} assume !(dll_insert_~index#1 > 0); {391#false} is VALID [2022-02-20 16:54:35,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {391#false} assume dll_insert_~snd_to_last~0#1.base != 0 || dll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, 4 + dll_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~new_node~0#1.base, 8 + dll_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset, dll_insert_~new_node~0#1.base, 4 + dll_insert_~new_node~0#1.offset, 4); {391#false} is VALID [2022-02-20 16:54:35,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {391#false} assume dll_insert_~last~0#1.base != 0 || dll_insert_~last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~last~0#1.base, 8 + dll_insert_~last~0#1.offset, 4); {391#false} is VALID [2022-02-20 16:54:35,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {391#false} assume { :end_inline_dll_insert } true;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;main_~count~0#1 := 0; {391#false} is VALID [2022-02-20 16:54:35,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {391#false} assume !!((main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0) && main_~count~0#1 != main_~mid_index~0#1);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4);main_~temp~2#1.base, main_~temp~2#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1 := read~int(main_~ptr~0#1.base, main_~ptr~0#1.offset, 4); {391#false} is VALID [2022-02-20 16:54:35,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {391#false} assume main_~data~0#1 != main_#t~mem17#1;havoc main_#t~mem17#1; {391#false} is VALID [2022-02-20 16:54:35,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {391#false} assume !false; {391#false} is VALID [2022-02-20 16:54:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:54:35,803 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:35,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177787327] [2022-02-20 16:54:35,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177787327] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:35,804 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:35,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:54:35,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221525131] [2022-02-20 16:54:35,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:35,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 16:54:35,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:35,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:54:35,821 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:54:35,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:54:35,822 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:35,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:54:35,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:54:35,823 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:54:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:35,875 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-02-20 16:54:35,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:54:35,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 16:54:35,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:54:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-02-20 16:54:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:54:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-02-20 16:54:35,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2022-02-20 16:54:35,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:35,940 INFO L225 Difference]: With dead ends: 57 [2022-02-20 16:54:35,940 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:54:35,941 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:54:35,942 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:35,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 66 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:35,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:54:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-02-20 16:54:35,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:35,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 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:54:35,945 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 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:54:35,946 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 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:54:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:35,947 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-20 16:54:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-02-20 16:54:35,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:35,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:35,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 16:54:35,948 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 16:54:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:35,949 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-02-20 16:54:35,949 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-02-20 16:54:35,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:35,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:35,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:35,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 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:54:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-02-20 16:54:35,951 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2022-02-20 16:54:35,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:35,952 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-02-20 16:54:35,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:54:35,952 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-02-20 16:54:35,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:54:35,953 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:35,953 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:35,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:54:35,954 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:35,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:35,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1976697508, now seen corresponding path program 1 times [2022-02-20 16:54:35,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:35,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977750649] [2022-02-20 16:54:35,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:35,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:36,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {570#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {570#true} is VALID [2022-02-20 16:54:36,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {570#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~post18#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~post24#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {572#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 16:54:36,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {572#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {572#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 16:54:36,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {572#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {572#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 16:54:36,011 INFO L290 TraceCheckUtils]: 4: Hoare triple {572#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); {572#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 16:54:36,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {572#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {572#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 16:54:36,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {572#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {573#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:36,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {573#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {571#false} is VALID [2022-02-20 16:54:36,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {571#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {571#false} is VALID [2022-02-20 16:54:36,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_insert } true;dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset, dll_insert_#in~data#1, dll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset, dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset, dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset, dll_insert_#t~post10#1, dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset, dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset, dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset, dll_insert_~head#1.base, dll_insert_~head#1.offset, dll_insert_~data#1, dll_insert_~index#1, dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset;dll_insert_~head#1.base, dll_insert_~head#1.offset := dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset;dll_insert_~data#1 := dll_insert_#in~data#1;dll_insert_~index#1 := dll_insert_#in~index#1;assume { :begin_inline_node_create } true;node_create_#in~data#1 := dll_insert_~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(12);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; {571#false} is VALID [2022-02-20 16:54:36,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#false} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {571#false} is VALID [2022-02-20 16:54:36,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {571#false} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 8 + 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; {571#false} is VALID [2022-02-20 16:54:36,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {571#false} dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset := dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset := 0, 0;call dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset := dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset;havoc dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset; {571#false} is VALID [2022-02-20 16:54:36,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {571#false} assume !(dll_insert_~index#1 > 0); {571#false} is VALID [2022-02-20 16:54:36,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {571#false} assume dll_insert_~snd_to_last~0#1.base != 0 || dll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, 4 + dll_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~new_node~0#1.base, 8 + dll_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset, dll_insert_~new_node~0#1.base, 4 + dll_insert_~new_node~0#1.offset, 4); {571#false} is VALID [2022-02-20 16:54:36,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {571#false} assume dll_insert_~last~0#1.base != 0 || dll_insert_~last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~last~0#1.base, 8 + dll_insert_~last~0#1.offset, 4); {571#false} is VALID [2022-02-20 16:54:36,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {571#false} assume { :end_inline_dll_insert } true;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;main_~count~0#1 := 0; {571#false} is VALID [2022-02-20 16:54:36,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {571#false} assume !!((main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0) && main_~count~0#1 != main_~mid_index~0#1);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4);main_~temp~2#1.base, main_~temp~2#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1 := read~int(main_~ptr~0#1.base, main_~ptr~0#1.offset, 4); {571#false} is VALID [2022-02-20 16:54:36,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {571#false} assume main_~data~0#1 != main_#t~mem17#1;havoc main_#t~mem17#1; {571#false} is VALID [2022-02-20 16:54:36,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {571#false} assume !false; {571#false} is VALID [2022-02-20 16:54:36,015 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:54:36,016 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:36,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977750649] [2022-02-20 16:54:36,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977750649] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:36,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700268960] [2022-02-20 16:54:36,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:36,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:36,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:36,018 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:54:36,060 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:54:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:36,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:54:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:36,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:36,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {570#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {570#true} is VALID [2022-02-20 16:54:36,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {570#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~post18#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~post24#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:36,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:36,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:36,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:36,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:36,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {573#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:36,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {573#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {571#false} is VALID [2022-02-20 16:54:36,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {571#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {571#false} is VALID [2022-02-20 16:54:36,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_insert } true;dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset, dll_insert_#in~data#1, dll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset, dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset, dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset, dll_insert_#t~post10#1, dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset, dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset, dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset, dll_insert_~head#1.base, dll_insert_~head#1.offset, dll_insert_~data#1, dll_insert_~index#1, dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset;dll_insert_~head#1.base, dll_insert_~head#1.offset := dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset;dll_insert_~data#1 := dll_insert_#in~data#1;dll_insert_~index#1 := dll_insert_#in~index#1;assume { :begin_inline_node_create } true;node_create_#in~data#1 := dll_insert_~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(12);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; {571#false} is VALID [2022-02-20 16:54:36,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#false} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {571#false} is VALID [2022-02-20 16:54:36,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {571#false} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 8 + 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; {571#false} is VALID [2022-02-20 16:54:36,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {571#false} dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset := dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset := 0, 0;call dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset := dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset;havoc dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset; {571#false} is VALID [2022-02-20 16:54:36,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {571#false} assume !(dll_insert_~index#1 > 0); {571#false} is VALID [2022-02-20 16:54:36,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {571#false} assume dll_insert_~snd_to_last~0#1.base != 0 || dll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, 4 + dll_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~new_node~0#1.base, 8 + dll_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset, dll_insert_~new_node~0#1.base, 4 + dll_insert_~new_node~0#1.offset, 4); {571#false} is VALID [2022-02-20 16:54:36,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {571#false} assume dll_insert_~last~0#1.base != 0 || dll_insert_~last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~last~0#1.base, 8 + dll_insert_~last~0#1.offset, 4); {571#false} is VALID [2022-02-20 16:54:36,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {571#false} assume { :end_inline_dll_insert } true;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;main_~count~0#1 := 0; {571#false} is VALID [2022-02-20 16:54:36,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {571#false} assume !!((main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0) && main_~count~0#1 != main_~mid_index~0#1);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4);main_~temp~2#1.base, main_~temp~2#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1 := read~int(main_~ptr~0#1.base, main_~ptr~0#1.offset, 4); {571#false} is VALID [2022-02-20 16:54:36,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {571#false} assume main_~data~0#1 != main_#t~mem17#1;havoc main_#t~mem17#1; {571#false} is VALID [2022-02-20 16:54:36,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {571#false} assume !false; {571#false} is VALID [2022-02-20 16:54:36,309 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:54:36,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:36,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {571#false} assume !false; {571#false} is VALID [2022-02-20 16:54:36,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {571#false} assume main_~data~0#1 != main_#t~mem17#1;havoc main_#t~mem17#1; {571#false} is VALID [2022-02-20 16:54:36,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {571#false} assume !!((main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0) && main_~count~0#1 != main_~mid_index~0#1);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4);main_~temp~2#1.base, main_~temp~2#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1 := read~int(main_~ptr~0#1.base, main_~ptr~0#1.offset, 4); {571#false} is VALID [2022-02-20 16:54:36,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {571#false} assume { :end_inline_dll_insert } true;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;main_~count~0#1 := 0; {571#false} is VALID [2022-02-20 16:54:36,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {571#false} assume dll_insert_~last~0#1.base != 0 || dll_insert_~last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~last~0#1.base, 8 + dll_insert_~last~0#1.offset, 4); {571#false} is VALID [2022-02-20 16:54:36,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {571#false} assume dll_insert_~snd_to_last~0#1.base != 0 || dll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, 4 + dll_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~new_node~0#1.base, 8 + dll_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset, dll_insert_~new_node~0#1.base, 4 + dll_insert_~new_node~0#1.offset, 4); {571#false} is VALID [2022-02-20 16:54:36,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {571#false} assume !(dll_insert_~index#1 > 0); {571#false} is VALID [2022-02-20 16:54:36,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {571#false} dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset := dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset := 0, 0;call dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset := dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset;havoc dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset; {571#false} is VALID [2022-02-20 16:54:36,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {571#false} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 8 + 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; {571#false} is VALID [2022-02-20 16:54:36,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {571#false} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {571#false} is VALID [2022-02-20 16:54:36,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {571#false} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_insert } true;dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset, dll_insert_#in~data#1, dll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset, dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset, dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset, dll_insert_#t~post10#1, dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset, dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset, dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset, dll_insert_~head#1.base, dll_insert_~head#1.offset, dll_insert_~data#1, dll_insert_~index#1, dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset;dll_insert_~head#1.base, dll_insert_~head#1.offset := dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset;dll_insert_~data#1 := dll_insert_#in~data#1;dll_insert_~index#1 := dll_insert_#in~index#1;assume { :begin_inline_node_create } true;node_create_#in~data#1 := dll_insert_~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(12);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; {571#false} is VALID [2022-02-20 16:54:36,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {571#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {571#false} is VALID [2022-02-20 16:54:36,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {573#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {571#false} is VALID [2022-02-20 16:54:36,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {573#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:36,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:36,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:36,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:36,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:36,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {570#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~post18#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~post24#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {580#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:36,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {570#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {570#true} is VALID [2022-02-20 16:54:36,397 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:54:36,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700268960] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:54:36,397 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:54:36,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-02-20 16:54:36,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542016154] [2022-02-20 16:54:36,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:36,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 16:54:36,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:36,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:36,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:36,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:54:36,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:36,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:54:36,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:54:36,419 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:36,505 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2022-02-20 16:54:36,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:54:36,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 16:54:36,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:36,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-02-20 16:54:36,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:36,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-02-20 16:54:36,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2022-02-20 16:54:36,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:36,568 INFO L225 Difference]: With dead ends: 53 [2022-02-20 16:54:36,568 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 16:54:36,568 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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:54:36,569 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 101 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:54:36,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 101 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 16:54:36,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 16:54:36,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:36,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:36,572 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:36,573 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:36,573 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-20 16:54:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 16:54:36,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:36,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:36,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 16:54:36,574 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 16:54:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:36,575 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-20 16:54:36,576 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 16:54:36,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:36,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:36,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:36,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-02-20 16:54:36,578 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2022-02-20 16:54:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:36,578 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-02-20 16:54:36,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:36,578 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 16:54:36,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:54:36,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:36,579 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:36,600 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:54:36,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:36,797 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:36,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:36,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1871980112, now seen corresponding path program 1 times [2022-02-20 16:54:36,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:36,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570842139] [2022-02-20 16:54:36,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:36,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:36,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {867#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {867#true} is VALID [2022-02-20 16:54:36,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {867#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~post18#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~post24#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {867#true} is VALID [2022-02-20 16:54:36,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {867#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {867#true} is VALID [2022-02-20 16:54:36,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {867#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {867#true} is VALID [2022-02-20 16:54:36,902 INFO L290 TraceCheckUtils]: 4: Hoare triple {867#true} call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); {867#true} is VALID [2022-02-20 16:54:36,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {867#true} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {867#true} is VALID [2022-02-20 16:54:36,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {867#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {867#true} is VALID [2022-02-20 16:54:36,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {867#true} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {867#true} is VALID [2022-02-20 16:54:36,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {867#true} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {867#true} is VALID [2022-02-20 16:54:36,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#true} call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); {867#true} is VALID [2022-02-20 16:54:36,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {867#true} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0;call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); {867#true} is VALID [2022-02-20 16:54:36,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {867#true} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {867#true} is VALID [2022-02-20 16:54:36,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#true} assume !(dll_create_~len#1 > 0); {867#true} is VALID [2022-02-20 16:54:36,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#true} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {867#true} is VALID [2022-02-20 16:54:36,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {867#true} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_insert } true;dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset, dll_insert_#in~data#1, dll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset, dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset, dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset, dll_insert_#t~post10#1, dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset, dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset, dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset, dll_insert_~head#1.base, dll_insert_~head#1.offset, dll_insert_~data#1, dll_insert_~index#1, dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset;dll_insert_~head#1.base, dll_insert_~head#1.offset := dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset;dll_insert_~data#1 := dll_insert_#in~data#1;dll_insert_~index#1 := dll_insert_#in~index#1;assume { :begin_inline_node_create } true;node_create_#in~data#1 := dll_insert_~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(12);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; {867#true} is VALID [2022-02-20 16:54:36,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {867#true} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {867#true} is VALID [2022-02-20 16:54:36,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {867#true} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 8 + 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; {867#true} is VALID [2022-02-20 16:54:36,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {867#true} dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset := dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset := 0, 0;call dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset := dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset;havoc dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset; {869#(and (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| 0))} is VALID [2022-02-20 16:54:36,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {869#(and (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| 0))} assume !(dll_insert_~index#1 > 0); {869#(and (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| 0))} is VALID [2022-02-20 16:54:36,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {869#(and (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| 0))} assume dll_insert_~snd_to_last~0#1.base != 0 || dll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, 4 + dll_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~new_node~0#1.base, 8 + dll_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset, dll_insert_~new_node~0#1.base, 4 + dll_insert_~new_node~0#1.offset, 4); {868#false} is VALID [2022-02-20 16:54:36,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {868#false} assume dll_insert_~last~0#1.base != 0 || dll_insert_~last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~last~0#1.base, 8 + dll_insert_~last~0#1.offset, 4); {868#false} is VALID [2022-02-20 16:54:36,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {868#false} assume { :end_inline_dll_insert } true;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;main_~count~0#1 := 0; {868#false} is VALID [2022-02-20 16:54:36,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {868#false} assume !!((main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0) && main_~count~0#1 != main_~mid_index~0#1);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4);main_~temp~2#1.base, main_~temp~2#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1 := read~int(main_~ptr~0#1.base, main_~ptr~0#1.offset, 4); {868#false} is VALID [2022-02-20 16:54:36,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {868#false} assume main_~data~0#1 != main_#t~mem17#1;havoc main_#t~mem17#1; {868#false} is VALID [2022-02-20 16:54:36,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {868#false} assume !false; {868#false} is VALID [2022-02-20 16:54:36,915 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:54:36,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:36,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570842139] [2022-02-20 16:54:36,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570842139] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:36,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:36,916 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:54:36,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880381046] [2022-02-20 16:54:36,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:36,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 25 [2022-02-20 16:54:36,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:36,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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:54:36,931 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:54:36,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:54:36,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:36,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:54:36,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:54:36,933 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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:54:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:36,988 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2022-02-20 16:54:36,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:54:36,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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 25 [2022-02-20 16:54:36,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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:54:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-02-20 16:54:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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:54:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-02-20 16:54:36,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-02-20 16:54:37,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:37,053 INFO L225 Difference]: With dead ends: 56 [2022-02-20 16:54:37,053 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 16:54:37,054 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:54:37,054 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 18 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:37,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 65 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 16:54:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2022-02-20 16:54:37,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:37,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 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:54:37,058 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 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:54:37,058 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 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:54:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:37,060 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-02-20 16:54:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-02-20 16:54:37,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:37,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:37,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states. [2022-02-20 16:54:37,061 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 45 states. [2022-02-20 16:54:37,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:37,062 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-02-20 16:54:37,062 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-02-20 16:54:37,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:37,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:37,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:37,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 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:54:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-02-20 16:54:37,063 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 25 [2022-02-20 16:54:37,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:37,064 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-02-20 16:54:37,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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:54:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-02-20 16:54:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 16:54:37,064 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:37,064 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:37,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:54:37,065 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:37,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:37,065 INFO L85 PathProgramCache]: Analyzing trace with hash 835167343, now seen corresponding path program 1 times [2022-02-20 16:54:37,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:37,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859684669] [2022-02-20 16:54:37,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:37,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:37,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {1079#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {1079#true} is VALID [2022-02-20 16:54:37,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {1079#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~post18#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~post24#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {1081#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 16:54:37,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {1081#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1081#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 16:54:37,162 INFO L290 TraceCheckUtils]: 3: Hoare triple {1081#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1081#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 16:54:37,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {1081#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); {1081#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 16:54:37,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {1081#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {1081#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} is VALID [2022-02-20 16:54:37,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {1081#(and (= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0) (= (+ (* (- 1) |ULTIMATE.start_main_~len~0#1|) |ULTIMATE.start_dll_create_~len#1|) 0))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0;call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_insert } true;dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset, dll_insert_#in~data#1, dll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset, dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset, dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset, dll_insert_#t~post10#1, dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset, dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset, dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset, dll_insert_~head#1.base, dll_insert_~head#1.offset, dll_insert_~data#1, dll_insert_~index#1, dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset;dll_insert_~head#1.base, dll_insert_~head#1.offset := dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset;dll_insert_~data#1 := dll_insert_#in~data#1;dll_insert_~index#1 := dll_insert_#in~index#1;assume { :begin_inline_node_create } true;node_create_#in~data#1 := dll_insert_~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(12);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; {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} is VALID [2022-02-20 16:54:37,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} is VALID [2022-02-20 16:54:37,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 8 + 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; {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} is VALID [2022-02-20 16:54:37,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset := dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset := 0, 0;call dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset := dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset;havoc dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset; {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} is VALID [2022-02-20 16:54:37,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} assume !(dll_insert_~index#1 > 0); {1080#false} is VALID [2022-02-20 16:54:37,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {1080#false} assume !(dll_insert_~snd_to_last~0#1.base != 0 || dll_insert_~snd_to_last~0#1.offset != 0);call dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);call write~$Pointer$(dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset, dll_insert_~new_node~0#1.base, 4 + dll_insert_~new_node~0#1.offset, 4);havoc dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset;call dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4); {1080#false} is VALID [2022-02-20 16:54:37,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {1080#false} assume dll_insert_#t~mem12#1.base != 0 || dll_insert_#t~mem12#1.offset != 0;havoc dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset;call dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_#t~mem13#1.base, 8 + dll_insert_#t~mem13#1.offset, 4);havoc dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset; {1080#false} is VALID [2022-02-20 16:54:37,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {1080#false} call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~head#1.base, dll_insert_~head#1.offset, 4); {1080#false} is VALID [2022-02-20 16:54:37,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {1080#false} assume { :end_inline_dll_insert } true;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;main_~count~0#1 := 0; {1080#false} is VALID [2022-02-20 16:54:37,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {1080#false} assume !!((main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0) && main_~count~0#1 != main_~mid_index~0#1);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4);main_~temp~2#1.base, main_~temp~2#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1 := read~int(main_~ptr~0#1.base, main_~ptr~0#1.offset, 4); {1080#false} is VALID [2022-02-20 16:54:37,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {1080#false} assume main_~data~0#1 != main_#t~mem17#1;havoc main_#t~mem17#1; {1080#false} is VALID [2022-02-20 16:54:37,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {1080#false} assume !false; {1080#false} is VALID [2022-02-20 16:54:37,171 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:54:37,171 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:37,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859684669] [2022-02-20 16:54:37,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859684669] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:37,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292432081] [2022-02-20 16:54:37,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:37,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:37,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:37,188 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:54:37,189 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:54:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:37,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:54:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:37,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:37,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {1079#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {1079#true} is VALID [2022-02-20 16:54:37,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {1079#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~post18#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~post24#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0;call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:37,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {1082#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_insert } true;dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset, dll_insert_#in~data#1, dll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset, dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset, dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset, dll_insert_#t~post10#1, dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset, dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset, dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset, dll_insert_~head#1.base, dll_insert_~head#1.offset, dll_insert_~data#1, dll_insert_~index#1, dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset;dll_insert_~head#1.base, dll_insert_~head#1.offset := dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset;dll_insert_~data#1 := dll_insert_#in~data#1;dll_insert_~index#1 := dll_insert_#in~index#1;assume { :begin_inline_node_create } true;node_create_#in~data#1 := dll_insert_~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(12);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; {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} is VALID [2022-02-20 16:54:37,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} is VALID [2022-02-20 16:54:37,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 8 + 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; {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} is VALID [2022-02-20 16:54:37,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset := dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset := 0, 0;call dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset := dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset;havoc dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset; {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} is VALID [2022-02-20 16:54:37,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {1083#(<= 1 |ULTIMATE.start_dll_insert_~index#1|)} assume !(dll_insert_~index#1 > 0); {1080#false} is VALID [2022-02-20 16:54:37,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {1080#false} assume !(dll_insert_~snd_to_last~0#1.base != 0 || dll_insert_~snd_to_last~0#1.offset != 0);call dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);call write~$Pointer$(dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset, dll_insert_~new_node~0#1.base, 4 + dll_insert_~new_node~0#1.offset, 4);havoc dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset;call dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4); {1080#false} is VALID [2022-02-20 16:54:37,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {1080#false} assume dll_insert_#t~mem12#1.base != 0 || dll_insert_#t~mem12#1.offset != 0;havoc dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset;call dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_#t~mem13#1.base, 8 + dll_insert_#t~mem13#1.offset, 4);havoc dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset; {1080#false} is VALID [2022-02-20 16:54:37,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {1080#false} call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~head#1.base, dll_insert_~head#1.offset, 4); {1080#false} is VALID [2022-02-20 16:54:37,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {1080#false} assume { :end_inline_dll_insert } true;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;main_~count~0#1 := 0; {1080#false} is VALID [2022-02-20 16:54:37,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {1080#false} assume !!((main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0) && main_~count~0#1 != main_~mid_index~0#1);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4);main_~temp~2#1.base, main_~temp~2#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1 := read~int(main_~ptr~0#1.base, main_~ptr~0#1.offset, 4); {1080#false} is VALID [2022-02-20 16:54:37,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {1080#false} assume main_~data~0#1 != main_#t~mem17#1;havoc main_#t~mem17#1; {1080#false} is VALID [2022-02-20 16:54:37,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {1080#false} assume !false; {1080#false} is VALID [2022-02-20 16:54:37,591 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:54:37,591 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:54:37,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292432081] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:37,591 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 16:54:37,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-20 16:54:37,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368110455] [2022-02-20 16:54:37,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:37,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 16:54:37,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:37,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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:54:37,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:37,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:54:37,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:37,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:54:37,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:54:37,610 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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:54:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:37,674 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2022-02-20 16:54:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:54:37,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 16:54:37,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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:54:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 16:54:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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:54:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 16:54:37,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2022-02-20 16:54:37,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:37,717 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:54:37,717 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:54:37,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:54:37,718 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:37,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 65 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:54:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 16:54:37,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:37,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 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:54:37,727 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 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:54:37,727 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 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:54:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:37,728 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-20 16:54:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 16:54:37,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:37,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:37,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 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 34 states. [2022-02-20 16:54:37,729 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 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 34 states. [2022-02-20 16:54:37,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:37,730 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-20 16:54:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 16:54:37,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:37,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:37,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:37,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 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:54:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-02-20 16:54:37,731 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 26 [2022-02-20 16:54:37,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:37,731 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-02-20 16:54:37,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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:54:37,732 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 16:54:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 16:54:37,732 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:37,732 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:37,751 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:54:37,943 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,SelfDestructingSolverStorable5 [2022-02-20 16:54:37,943 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339204, now seen corresponding path program 1 times [2022-02-20 16:54:37,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:37,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365791751] [2022-02-20 16:54:37,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:37,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:38,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {1335#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {1335#true} is VALID [2022-02-20 16:54:38,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {1335#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~post18#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~post24#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {1337#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= 2 |ULTIMATE.start_dll_create_~len#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_create_~len#1|))} is VALID [2022-02-20 16:54:38,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {1337#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= 2 |ULTIMATE.start_dll_create_~len#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_create_~len#1|))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1338#(and (= 2 |ULTIMATE.start_dll_create_~len#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (div |ULTIMATE.start_main_~len~0#1| 2) (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_create_~len#1|))} is VALID [2022-02-20 16:54:38,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {1338#(and (= 2 |ULTIMATE.start_dll_create_~len#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (div |ULTIMATE.start_main_~len~0#1| 2) (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_create_~len#1|))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1338#(and (= 2 |ULTIMATE.start_dll_create_~len#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (div |ULTIMATE.start_main_~len~0#1| 2) (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_create_~len#1|))} is VALID [2022-02-20 16:54:38,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {1338#(and (= 2 |ULTIMATE.start_dll_create_~len#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (div |ULTIMATE.start_main_~len~0#1| 2) (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_create_~len#1|))} call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); {1338#(and (= 2 |ULTIMATE.start_dll_create_~len#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (div |ULTIMATE.start_main_~len~0#1| 2) (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_create_~len#1|))} is VALID [2022-02-20 16:54:38,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {1338#(and (= 2 |ULTIMATE.start_dll_create_~len#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (div |ULTIMATE.start_main_~len~0#1| 2) (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_create_~len#1|))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {1338#(and (= 2 |ULTIMATE.start_dll_create_~len#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (div |ULTIMATE.start_main_~len~0#1| 2) (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_create_~len#1|))} is VALID [2022-02-20 16:54:38,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {1338#(and (= 2 |ULTIMATE.start_dll_create_~len#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (div |ULTIMATE.start_main_~len~0#1| 2) (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_dll_create_~len#1|))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {1339#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (div |ULTIMATE.start_main_~len~0#1| 2) (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (div |ULTIMATE.start_main_~len~0#1| 2) 1) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} is VALID [2022-02-20 16:54:38,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {1339#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (div |ULTIMATE.start_main_~len~0#1| 2) (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (div |ULTIMATE.start_main_~len~0#1| 2) 1) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1340#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} is VALID [2022-02-20 16:54:38,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {1340#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1340#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} is VALID [2022-02-20 16:54:38,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {1340#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); {1341#(and (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) |ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:54:38,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {1341#(and (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) |ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0;call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); {1342#(and (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) |ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:54:38,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {1342#(and (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) |ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {1343#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 16:54:38,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {1343#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(dll_create_~len#1 > 0); {1343#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 16:54:38,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {1343#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {1344#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) 1) (not (= |ULTIMATE.start_dll_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_create_#res#1.base|) 0) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_create_#res#1.offset| 0))} is VALID [2022-02-20 16:54:38,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {1344#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) 1) (not (= |ULTIMATE.start_dll_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_dll_create_#res#1.base|) 0) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_create_#res#1.offset| 0))} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_insert } true;dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset, dll_insert_#in~data#1, dll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset, dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset, dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset, dll_insert_#t~post10#1, dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset, dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset, dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset, dll_insert_~head#1.base, dll_insert_~head#1.offset, dll_insert_~data#1, dll_insert_~index#1, dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset;dll_insert_~head#1.base, dll_insert_~head#1.offset := dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset;dll_insert_~data#1 := dll_insert_#in~data#1;dll_insert_~index#1 := dll_insert_#in~index#1;assume { :begin_inline_node_create } true;node_create_#in~data#1 := dll_insert_~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(12);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; {1345#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (not (= |ULTIMATE.start_dll_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 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) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |ULTIMATE.start_dll_insert_~head#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|)) 4))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_dll_insert_~index#1| 0)) (= |ULTIMATE.start_dll_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 16:54:38,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {1345#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (not (= |ULTIMATE.start_dll_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 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) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |ULTIMATE.start_dll_insert_~head#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|)) 4))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_dll_insert_~index#1| 0)) (= |ULTIMATE.start_dll_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {1345#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (not (= |ULTIMATE.start_dll_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 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) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |ULTIMATE.start_dll_insert_~head#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|)) 4))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_dll_insert_~index#1| 0)) (= |ULTIMATE.start_dll_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 16:54:38,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {1345#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_node_create_~temp~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (not (= |ULTIMATE.start_dll_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_node_create_~temp~0#1.offset| 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) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |ULTIMATE.start_dll_insert_~head#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|)) 4))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_dll_insert_~index#1| 0)) (= |ULTIMATE.start_dll_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 4 + node_create_~temp~0#1.offset, 4);call write~$Pointer$(0, 0, node_create_~temp~0#1.base, 8 + 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; {1346#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_insert_~head#1.base|) |ULTIMATE.start_dll_insert_~head#1.offset|) 0) (= |ULTIMATE.start_dll_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~head#1.base|) |ULTIMATE.start_dll_insert_~head#1.offset|)) 0)) (not (= |ULTIMATE.start_dll_insert_~head#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~head#1.base|) |ULTIMATE.start_dll_insert_~head#1.offset|)) 4))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~head#1.base|) |ULTIMATE.start_dll_insert_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~head#1.base|) |ULTIMATE.start_dll_insert_~head#1.offset|)) 4))) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~head#1.base|) |ULTIMATE.start_dll_insert_~head#1.offset|) |ULTIMATE.start_dll_insert_~head#1.base|)) (= |ULTIMATE.start_dll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~head#1.base|) |ULTIMATE.start_dll_insert_~head#1.offset|) |ULTIMATE.start_node_create_#res#1.base|)) (not (= |ULTIMATE.start_dll_insert_~head#1.base| |ULTIMATE.start_node_create_#res#1.base|))) (<= |ULTIMATE.start_dll_insert_~index#1| 0)))} is VALID [2022-02-20 16:54:38,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {1346#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_insert_~head#1.base|) |ULTIMATE.start_dll_insert_~head#1.offset|) 0) (= |ULTIMATE.start_dll_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~head#1.base|) |ULTIMATE.start_dll_insert_~head#1.offset|)) 0)) (not (= |ULTIMATE.start_dll_insert_~head#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~head#1.base|) |ULTIMATE.start_dll_insert_~head#1.offset|)) 4))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~head#1.base|) |ULTIMATE.start_dll_insert_~head#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~head#1.base|) |ULTIMATE.start_dll_insert_~head#1.offset|)) 4))) (= |ULTIMATE.start_node_create_#res#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~head#1.base|) |ULTIMATE.start_dll_insert_~head#1.offset|) |ULTIMATE.start_dll_insert_~head#1.base|)) (= |ULTIMATE.start_dll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~head#1.base|) |ULTIMATE.start_dll_insert_~head#1.offset|) |ULTIMATE.start_node_create_#res#1.base|)) (not (= |ULTIMATE.start_dll_insert_~head#1.base| |ULTIMATE.start_node_create_#res#1.base|))) (<= |ULTIMATE.start_dll_insert_~index#1| 0)))} dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset := dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset := 0, 0;call dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset := dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset;havoc dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset; {1347#(and (= |ULTIMATE.start_dll_insert_~last~0#1.offset| 0) (or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_dll_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_insert_~last~0#1.base|) 0)) (= |ULTIMATE.start_dll_insert_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_insert_~new_node~0#1.offset| 0) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| |ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (<= |ULTIMATE.start_dll_insert_~index#1| 0)))} is VALID [2022-02-20 16:54:38,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {1347#(and (= |ULTIMATE.start_dll_insert_~last~0#1.offset| 0) (or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_dll_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_insert_~last~0#1.base|) 0)) (= |ULTIMATE.start_dll_insert_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_insert_~new_node~0#1.offset| 0) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| |ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (<= |ULTIMATE.start_dll_insert_~index#1| 0)))} assume !!(dll_insert_~index#1 > 0);dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset := dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset;call dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset := read~$Pointer$(dll_insert_~last~0#1.base, 4 + dll_insert_~last~0#1.offset, 4);dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset := dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset;havoc dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset;dll_insert_#t~post10#1 := dll_insert_~index#1;dll_insert_~index#1 := dll_insert_#t~post10#1 - 1;havoc dll_insert_#t~post10#1; {1348#(or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (not (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_dll_insert_~new_node~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_dll_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|)) (not (= (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) 0)) (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1|)))} is VALID [2022-02-20 16:54:38,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {1348#(or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (not (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_dll_insert_~new_node~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_dll_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|)) (not (= (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) 0)) (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1|)))} assume !(dll_insert_~index#1 > 0); {1348#(or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (not (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_dll_insert_~new_node~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_dll_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|)) (not (= (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) 0)) (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1|)))} is VALID [2022-02-20 16:54:38,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {1348#(or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (not (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_dll_insert_~new_node~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_dll_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|)) (not (= (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) 0)) (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1|)))} assume dll_insert_~snd_to_last~0#1.base != 0 || dll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, 4 + dll_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~new_node~0#1.base, 8 + dll_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset, dll_insert_~new_node~0#1.base, 4 + dll_insert_~new_node~0#1.offset, 4); {1349#(or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|)))} is VALID [2022-02-20 16:54:38,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {1349#(or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|)))} assume dll_insert_~last~0#1.base != 0 || dll_insert_~last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~last~0#1.base, 8 + dll_insert_~last~0#1.offset, 4); {1350#(or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|)))} is VALID [2022-02-20 16:54:38,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {1350#(or (= |ULTIMATE.start_main_~mid_index~0#1| 0) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|)))} assume { :end_inline_dll_insert } true;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;main_~count~0#1 := 0; {1351#(or (= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~mid_index~0#1|) (and (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))))} is VALID [2022-02-20 16:54:38,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {1351#(or (= |ULTIMATE.start_main_~count~0#1| |ULTIMATE.start_main_~mid_index~0#1|) (and (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) |ULTIMATE.start_main_~ptr~0#1.offset|))))} assume !!((main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0) && main_~count~0#1 != main_~mid_index~0#1);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4);main_~temp~2#1.base, main_~temp~2#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1 := read~int(main_~ptr~0#1.base, main_~ptr~0#1.offset, 4); {1352#(= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem17#1|)} is VALID [2022-02-20 16:54:38,959 INFO L290 TraceCheckUtils]: 24: Hoare triple {1352#(= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem17#1|)} assume main_~data~0#1 != main_#t~mem17#1;havoc main_#t~mem17#1; {1336#false} is VALID [2022-02-20 16:54:38,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {1336#false} assume !false; {1336#false} is VALID [2022-02-20 16:54:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:54:38,960 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:38,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365791751] [2022-02-20 16:54:38,960 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365791751] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:38,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190332885] [2022-02-20 16:54:38,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:38,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:38,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:38,961 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:54:38,962 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:54:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:39,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 101 conjunts are in the unsatisfiable core [2022-02-20 16:54:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:39,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:39,418 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:54:39,616 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 16:54:39,616 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:54:39,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:39,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-02-20 16:54:39,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:39,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:39,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:39,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-02-20 16:54:39,870 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 16:54:39,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 52 [2022-02-20 16:54:39,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-02-20 16:54:40,196 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-02-20 16:54:40,197 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 28 treesize of output 30 [2022-02-20 16:54:40,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:40,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 16:54:40,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:40,380 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-02-20 16:54:40,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 64 [2022-02-20 16:54:40,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-20 16:54:41,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:41,028 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-02-20 16:54:41,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 141 treesize of output 110 [2022-02-20 16:54:41,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:41,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-02-20 16:54:41,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:41,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:41,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-02-20 16:54:41,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:54:41,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2022-02-20 16:54:41,227 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 18 treesize of output 20 [2022-02-20 16:54:41,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:41,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-02-20 16:54:41,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-20 16:54:41,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:41,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 16:54:41,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-02-20 16:54:41,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:54:41,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:54:41,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {1335#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(23, 2); {1335#true} is VALID [2022-02-20 16:54:41,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {1335#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret14#1.base, main_#t~ret14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~post18#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~post21#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~post24#1, main_~temp~3#1.base, main_~temp~3#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_dll_create } true;dll_create_#in~len#1, dll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc dll_create_#res#1.base, dll_create_#res#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset, dll_create_#t~post5#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~len#1, dll_create_~data#1, dll_create_~head~0#1.base, dll_create_~head~0#1.offset;dll_create_~len#1 := dll_create_#in~len#1;dll_create_~data#1 := dll_create_#in~data#1;dll_create_~head~0#1.base, dll_create_~head~0#1.offset := 0, 0; {1359#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} is VALID [2022-02-20 16:54:41,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {1359#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1363#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} is VALID [2022-02-20 16:54:41,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {1363#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1363#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} is VALID [2022-02-20 16:54:41,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {1363#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); {1363#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} is VALID [2022-02-20 16:54:41,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {1363#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {1363#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} is VALID [2022-02-20 16:54:41,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {1363#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {1376#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} is VALID [2022-02-20 16:54:41,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {1376#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} assume !!(dll_create_~len#1 > 0);call dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset := dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset;havoc dll_create_#t~malloc4#1.base, dll_create_#t~malloc4#1.offset; {1380#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} is VALID [2022-02-20 16:54:41,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {1380#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1380#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} is VALID [2022-02-20 16:54:41,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {1380#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_dll_create_~data#1|))} call write~int(dll_create_~data#1, dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(dll_create_~head~0#1.base, dll_create_~head~0#1.offset, dll_create_~new_head~0#1.base, 4 + dll_create_~new_head~0#1.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0#1.base, 8 + dll_create_~new_head~0#1.offset, 4); {1387#(and (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) |ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:54:41,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {1387#(and (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) |ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0;call write~$Pointer$(dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset, dll_create_~head~0#1.base, 8 + dll_create_~head~0#1.offset, 4); {1391#(and (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) |ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) 1))} is VALID [2022-02-20 16:54:41,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {1391#(and (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) |ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (< |ULTIMATE.start_dll_create_~new_head~0#1.base| |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) 1))} dll_create_~head~0#1.base, dll_create_~head~0#1.offset := dll_create_~new_head~0#1.base, dll_create_~new_head~0#1.offset;dll_create_#t~post5#1 := dll_create_~len#1;dll_create_~len#1 := dll_create_#t~post5#1 - 1;havoc dll_create_#t~post5#1; {1395#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 16:54:41,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {1395#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} assume !(dll_create_~len#1 > 0); {1395#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} is VALID [2022-02-20 16:54:41,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {1395#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) |#StackHeapBarrier|) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 1) (< |ULTIMATE.start_dll_create_~head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~data~0#1| (select (select |#memory_int| |ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {1402#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) 1) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) (= (select (select |#memory_int| |ULTIMATE.start_dll_create_#res#1.base|) 0) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (< |ULTIMATE.start_dll_create_#res#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4)) 1))} is VALID [2022-02-20 16:54:41,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {1402#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4) |#StackHeapBarrier|) (= (select |#valid| |ULTIMATE.start_dll_create_#res#1.base|) 1) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4))) (= (select (select |#memory_int| |ULTIMATE.start_dll_create_#res#1.base|) 0) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (< |ULTIMATE.start_dll_create_#res#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4)) 1))} main_#t~ret14#1.base, main_#t~ret14#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret14#1.base, main_#t~ret14#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret14#1.base, main_#t~ret14#1.offset;main_~uneq~0#1 := 5;main_~mid_index~0#1 := (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);assume { :begin_inline_dll_insert } true;dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset, dll_insert_#in~data#1, dll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~uneq~0#1, main_~mid_index~0#1;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset, dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset, dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset, dll_insert_#t~post10#1, dll_insert_#t~mem11#1.base, dll_insert_#t~mem11#1.offset, dll_insert_#t~mem12#1.base, dll_insert_#t~mem12#1.offset, dll_insert_#t~mem13#1.base, dll_insert_#t~mem13#1.offset, dll_insert_~head#1.base, dll_insert_~head#1.offset, dll_insert_~data#1, dll_insert_~index#1, dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset;dll_insert_~head#1.base, dll_insert_~head#1.offset := dll_insert_#in~head#1.base, dll_insert_#in~head#1.offset;dll_insert_~data#1 := dll_insert_#in~data#1;dll_insert_~index#1 := dll_insert_#in~index#1;assume { :begin_inline_node_create } true;node_create_#in~data#1 := dll_insert_~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(12);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; {1406#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 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_node_create_~temp~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |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|))) (= |ULTIMATE.start_dll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_node_create_~temp~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|)) 4) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (< (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:41,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {1406#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 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_node_create_~temp~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |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|))) (= |ULTIMATE.start_dll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_node_create_~temp~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|)) 4) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (< (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !(0 == node_create_~temp~0#1.base && 0 == node_create_~temp~0#1.offset); {1406#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 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_node_create_~temp~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |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|))) (= |ULTIMATE.start_dll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_node_create_~temp~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|)) 4) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (< (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:41,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {1406#(and (= |ULTIMATE.start_node_create_~temp~0#1.offset| 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_node_create_~temp~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |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|))) (= |ULTIMATE.start_dll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_node_create_~temp~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|)) 4) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~data~0#1| 1) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (< (+ |ULTIMATE.start_node_create_~temp~0#1.base| 1) |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~$Pointer$(0, 0, node_create_~temp~0#1.base, 8 + 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; {1413#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (< (+ |ULTIMATE.start_node_create_#res#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_node_create_#res#1.offset| 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) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_dll_insert_~head#1.base| |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|)) 4) 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_node_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= (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_node_create_#res#1.base|)) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 16:54:41,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {1413#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (< (+ |ULTIMATE.start_node_create_#res#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_node_create_#res#1.offset| 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) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_dll_insert_~head#1.base| |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|)) 4) 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_node_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (not (= (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_node_create_#res#1.base|)) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_insert_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset := node_create_#res#1.base, node_create_#res#1.offset;assume { :end_inline_node_create } true;dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset := dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;havoc dll_insert_#t~ret7#1.base, dll_insert_#t~ret7#1.offset;dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset := 0, 0;call dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset := read~$Pointer$(dll_insert_~head#1.base, dll_insert_~head#1.offset, 4);dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset := dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset;havoc dll_insert_#t~mem8#1.base, dll_insert_#t~mem8#1.offset; {1417#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |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|))) (= |ULTIMATE.start_dll_insert_~last~0#1.base| (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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) |ULTIMATE.start_dll_insert_~new_node~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|)) 4) 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_insert_~last~0#1.offset|) (< (+ |ULTIMATE.start_dll_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:41,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {1417#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |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|))) (= |ULTIMATE.start_dll_insert_~last~0#1.base| (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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) |ULTIMATE.start_dll_insert_~new_node~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|)) 4) 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_insert_~last~0#1.offset|) (< (+ |ULTIMATE.start_dll_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !!(dll_insert_~index#1 > 0);dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset := dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset;call dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset := read~$Pointer$(dll_insert_~last~0#1.base, 4 + dll_insert_~last~0#1.offset, 4);dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset := dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset;havoc dll_insert_#t~mem9#1.base, dll_insert_#t~mem9#1.offset;dll_insert_#t~post10#1 := dll_insert_~index#1;dll_insert_~index#1 := dll_insert_#t~post10#1 - 1;havoc dll_insert_#t~post10#1; {1421#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 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) (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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) |ULTIMATE.start_dll_insert_~new_node~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|)) 4) 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_insert_~last~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|)) (+ (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|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (< (+ |ULTIMATE.start_dll_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:41,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {1421#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 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) (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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) |ULTIMATE.start_dll_insert_~new_node~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|)) 4) 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_insert_~last~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|)) (+ (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|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (< (+ |ULTIMATE.start_dll_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume !(dll_insert_~index#1 > 0); {1421#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 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) (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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) |ULTIMATE.start_dll_insert_~new_node~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|)) 4) 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_insert_~last~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|)) (+ (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|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (< (+ |ULTIMATE.start_dll_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:54:41,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {1421#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 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) (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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) |ULTIMATE.start_dll_insert_~new_node~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|)) 4) 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_insert_~new_node~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_dll_insert_~last~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|)) (+ (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|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|) (= |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (< (+ |ULTIMATE.start_dll_insert_~new_node~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|))} assume dll_insert_~snd_to_last~0#1.base != 0 || dll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~snd_to_last~0#1.base, 4 + dll_insert_~snd_to_last~0#1.offset, 4);call write~$Pointer$(dll_insert_~snd_to_last~0#1.base, dll_insert_~snd_to_last~0#1.offset, dll_insert_~new_node~0#1.base, 8 + dll_insert_~new_node~0#1.offset, 4);call write~$Pointer$(dll_insert_~last~0#1.base, dll_insert_~last~0#1.offset, dll_insert_~new_node~0#1.base, 4 + dll_insert_~new_node~0#1.offset, 4); {1428#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (< (+ |ULTIMATE.start_dll_insert_~last~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|))} is VALID [2022-02-20 16:54:41,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {1428#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (< (+ |ULTIMATE.start_dll_insert_~last~0#1.base| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_dll_insert_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~data~0#1| 1) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|))} assume dll_insert_~last~0#1.base != 0 || dll_insert_~last~0#1.offset != 0;call write~$Pointer$(dll_insert_~new_node~0#1.base, dll_insert_~new_node~0#1.offset, dll_insert_~last~0#1.base, 8 + dll_insert_~last~0#1.offset, 4); {1432#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_main_~data~0#1| 1) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|))} is VALID [2022-02-20 16:54:41,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {1432#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |ULTIMATE.start_main_~data~0#1| 1) (< (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 0) |ULTIMATE.start_main_~data~0#1|))} assume { :end_inline_dll_insert } true;call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem15#1.base, main_#t~mem15#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset;main_~count~0#1 := 0; {1436#(and (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1|))} is VALID [2022-02-20 16:54:41,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {1436#(and (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 0) |ULTIMATE.start_main_~data~0#1|))} assume !!((main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0) && main_~count~0#1 != main_~mid_index~0#1);call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~ptr~0#1.base, 4 + main_~ptr~0#1.offset, 4);main_~temp~2#1.base, main_~temp~2#1.offset := main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;call main_#t~mem17#1 := read~int(main_~ptr~0#1.base, main_~ptr~0#1.offset, 4); {1440#(and (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem17#1|))} is VALID [2022-02-20 16:54:41,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {1440#(and (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_main_#t~mem17#1|))} assume main_~data~0#1 != main_#t~mem17#1;havoc main_#t~mem17#1; {1336#false} is VALID [2022-02-20 16:54:41,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {1336#false} assume !false; {1336#false} is VALID [2022-02-20 16:54:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:54:41,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:41,715 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_707) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_709) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-02-20 16:54:41,768 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4) v_ArrVal_705)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_700) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_707) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_706) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_699) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_709) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-02-20 16:54:41,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_insert_~last~0#1.base|) .cse0 v_ArrVal_705)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_700) .cse1 v_ArrVal_707) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_703) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_706) .cse1 v_ArrVal_708) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_699) .cse1 v_ArrVal_709) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-02-20 16:54:41,863 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_705 Int) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_705)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_700) .cse2 v_ArrVal_707) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_703) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_706) .cse2 v_ArrVal_708) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_704) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_699) .cse2 v_ArrVal_709) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-02-20 16:54:41,923 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_705 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_700 (Array Int Int)) (v_ArrVal_699 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_708 (Array Int Int)) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_695)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_696))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse2 (+ (select (select .cse5 |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (let ((.cse3 (select (select .cse4 .cse1) .cse2))) (select (select (store (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_698))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_705))) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_700) .cse3 v_ArrVal_707) (select (select (store (store (store .cse4 .cse1 v_ArrVal_703) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_706) .cse3 v_ArrVal_708) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store (store .cse5 .cse1 v_ArrVal_704) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_699) .cse3 v_ArrVal_709) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-02-20 16:54:42,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 545618 treesize of output 515806 [2022-02-20 16:54:42,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 515802 treesize of output 500898 [2022-02-20 16:54:43,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 500898 treesize of output 496802 [2022-02-20 16:54:43,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 496802 treesize of output 494754 [2022-02-20 16:54:43,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 494754 treesize of output 493730