./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_remove_all.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_remove_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:54:53,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:54:53,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:54:53,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:54:53,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:54:53,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:54:53,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:54:53,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:54:53,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:54:53,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:54:53,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:54:53,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:54:53,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:54:53,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:54:53,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:54:53,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:54:53,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:54:53,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:54:53,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:54:53,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:54:53,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:54:53,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:54:53,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:54:53,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:54:53,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:54:53,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:54:53,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:54:53,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:54:53,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:54:53,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:54:53,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:54:53,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:54:53,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:54:53,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:54:53,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:54:53,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:54:53,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:54:53,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:54:53,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:54:53,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:54:53,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:54:53,523 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:53,545 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:54:53,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:54:53,546 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:54:53,546 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:54:53,546 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:54:53,547 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:54:53,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:54:53,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:54:53,547 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:54:53,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:54:53,548 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:54:53,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:54:53,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:54:53,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:54:53,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:54:53,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:54:53,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:54:53,549 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:54:53,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:54:53,549 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:54:53,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:54:53,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:54:53,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:54:53,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:54:53,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:53,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:54:53,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:54:53,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:54:53,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:54:53,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:54:53,551 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:54:53,551 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:54:53,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:54:53,552 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 -> b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 [2022-02-20 16:54:53,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:54:53,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:54:53,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:54:53,731 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:54:53,731 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:54:53,732 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_remove_all.i [2022-02-20 16:54:53,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13fe8c271/84c4598ab83c45b9b7758815ef4096c5/FLAG9ba9a037d [2022-02-20 16:54:54,153 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:54:54,154 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2022-02-20 16:54:54,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13fe8c271/84c4598ab83c45b9b7758815ef4096c5/FLAG9ba9a037d [2022-02-20 16:54:54,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13fe8c271/84c4598ab83c45b9b7758815ef4096c5 [2022-02-20 16:54:54,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:54:54,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:54:54,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:54,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:54:54,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:54:54,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:54" (1/1) ... [2022-02-20 16:54:54,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3b54b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:54, skipping insertion in model container [2022-02-20 16:54:54,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:54:54" (1/1) ... [2022-02-20 16:54:54,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:54:54,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:54:54,418 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_remove_all.i[24090,24103] [2022-02-20 16:54:54,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:54,431 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:54:54,475 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_remove_all.i[24090,24103] [2022-02-20 16:54:54,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:54:54,512 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:54:54,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:54 WrapperNode [2022-02-20 16:54:54,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:54:54,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:54,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:54:54,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:54:54,519 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:54" (1/1) ... [2022-02-20 16:54:54,541 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:54" (1/1) ... [2022-02-20 16:54:54,565 INFO L137 Inliner]: procedures = 126, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2022-02-20 16:54:54,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:54:54,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:54:54,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:54:54,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:54:54,571 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:54" (1/1) ... [2022-02-20 16:54:54,571 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:54" (1/1) ... [2022-02-20 16:54:54,576 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:54" (1/1) ... [2022-02-20 16:54:54,577 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:54" (1/1) ... [2022-02-20 16:54:54,582 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:54" (1/1) ... [2022-02-20 16:54:54,585 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:54" (1/1) ... [2022-02-20 16:54:54,586 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:54" (1/1) ... [2022-02-20 16:54:54,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:54:54,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:54:54,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:54:54,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:54:54,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:54" (1/1) ... [2022-02-20 16:54:54,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:54:54,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:54,616 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:54,622 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:54,640 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-02-20 16:54:54,640 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-02-20 16:54:54,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:54:54,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:54:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:54:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:54:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:54:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:54:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:54:54,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 16:54:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:54:54,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:54:54,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:54:54,749 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:54:54,750 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:54:54,798 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-02-20 16:54:54,897 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:54:54,905 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:54:54,906 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 16:54:54,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:54 BoogieIcfgContainer [2022-02-20 16:54:54,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:54:54,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:54:54,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:54:54,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:54:54,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:54:54" (1/3) ... [2022-02-20 16:54:54,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511924bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:54, skipping insertion in model container [2022-02-20 16:54:54,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:54:54" (2/3) ... [2022-02-20 16:54:54,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@511924bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:54:54, skipping insertion in model container [2022-02-20 16:54:54,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:54:54" (3/3) ... [2022-02-20 16:54:54,915 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2022-02-20 16:54:54,919 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:54:54,919 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:54:54,972 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:54:54,984 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:54,984 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:54:54,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:54:55,001 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:55,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:55,002 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:55,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:55,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1068252250, now seen corresponding path program 1 times [2022-02-20 16:54:55,014 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:55,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947828931] [2022-02-20 16:54:55,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:55,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:55,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {27#true} is VALID [2022-02-20 16:54:55,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {27#true} is VALID [2022-02-20 16:54:55,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-02-20 16:54:55,150 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {28#false} is VALID [2022-02-20 16:54:55,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {28#false} is VALID [2022-02-20 16:54:55,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-02-20 16:54:55,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {28#false} is VALID [2022-02-20 16:54:55,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {28#false} is VALID [2022-02-20 16:54:55,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-02-20 16:54:55,153 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:55,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:55,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947828931] [2022-02-20 16:54:55,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947828931] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:55,155 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:55,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:54:55,157 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584534550] [2022-02-20 16:54:55,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:55,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:54:55,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:55,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:55,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:54:55,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:55,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:54:55,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:54:55,195 INFO L87 Difference]: Start difference. First operand has 24 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 22 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:55,263 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-02-20 16:54:55,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:54:55,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:54:55,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-02-20 16:54:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-02-20 16:54:55,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2022-02-20 16:54:55,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:55,338 INFO L225 Difference]: With dead ends: 38 [2022-02-20 16:54:55,338 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 16:54:55,340 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:55,342 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:55,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 16:54:55,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 16:54:55,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:55,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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:55,363 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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:55,363 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:55,367 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 16:54:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 16:54:55,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:55,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:55,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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) Second operand 18 states. [2022-02-20 16:54:55,370 INFO L87 Difference]: Start difference. First operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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) Second operand 18 states. [2022-02-20 16:54:55,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:55,373 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-02-20 16:54:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 16:54:55,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:55,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:55,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:55,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:55,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-02-20 16:54:55,378 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 9 [2022-02-20 16:54:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:55,378 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-02-20 16:54:55,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-02-20 16:54:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:54:55,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:55,379 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:55,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:54:55,379 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:55,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:55,380 INFO L85 PathProgramCache]: Analyzing trace with hash -751399870, now seen corresponding path program 1 times [2022-02-20 16:54:55,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:55,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714975199] [2022-02-20 16:54:55,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:55,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:55,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {139#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {139#true} is VALID [2022-02-20 16:54:55,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {141#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 16:54:55,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !(dll_create_~len#1 > 0); {140#false} is VALID [2022-02-20 16:54:55,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {140#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {140#false} is VALID [2022-02-20 16:54:55,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {140#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {140#false} is VALID [2022-02-20 16:54:55,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {140#false} assume !(main_~i~0#1 >= 0); {140#false} is VALID [2022-02-20 16:54:55,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {140#false} is VALID [2022-02-20 16:54:55,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {140#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {140#false} is VALID [2022-02-20 16:54:55,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#false} assume !false; {140#false} is VALID [2022-02-20 16:54:55,438 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:55,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:55,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714975199] [2022-02-20 16:54:55,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714975199] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:55,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:55,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:54:55,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72485194] [2022-02-20 16:54:55,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:55,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:54:55,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:55,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:55,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:54:55,451 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:55,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:54:55,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:54:55,452 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:55,493 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-02-20 16:54:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:54:55,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:54:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:55,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-02-20 16:54:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-02-20 16:54:55,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2022-02-20 16:54:55,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:55,528 INFO L225 Difference]: With dead ends: 34 [2022-02-20 16:54:55,529 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:54:55,529 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:55,530 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 36 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:55,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 36 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:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:54:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2022-02-20 16:54:55,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:55,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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:55,533 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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:55,550 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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:55,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:55,551 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 16:54:55,551 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 16:54:55,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:55,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:55,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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) Second operand 23 states. [2022-02-20 16:54:55,553 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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) Second operand 23 states. [2022-02-20 16:54:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:55,557 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 16:54:55,557 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 16:54:55,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:55,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:55,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:55,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-02-20 16:54:55,560 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2022-02-20 16:54:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:55,560 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-02-20 16:54:55,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 16:54:55,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:54:55,561 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:55,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:55,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:54:55,562 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:55,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:55,562 INFO L85 PathProgramCache]: Analyzing trace with hash -799756430, now seen corresponding path program 1 times [2022-02-20 16:54:55,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:55,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263336925] [2022-02-20 16:54:55,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:55,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:55,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {256#true} is VALID [2022-02-20 16:54:55,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {258#(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:55,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {258#(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; {258#(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:55,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {258#(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); {258#(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:55,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {258#(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); {258#(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:55,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#(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); {257#false} is VALID [2022-02-20 16:54:55,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {257#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; {257#false} is VALID [2022-02-20 16:54:55,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#false} assume !(dll_create_~len#1 > 0); {257#false} is VALID [2022-02-20 16:54:55,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {257#false} is VALID [2022-02-20 16:54:55,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {257#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {257#false} is VALID [2022-02-20 16:54:55,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {257#false} assume !(main_~i~0#1 >= 0); {257#false} is VALID [2022-02-20 16:54:55,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {257#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {257#false} is VALID [2022-02-20 16:54:55,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {257#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {257#false} is VALID [2022-02-20 16:54:55,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-02-20 16:54:55,666 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:55,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:55,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263336925] [2022-02-20 16:54:55,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263336925] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:55,667 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:54:55,667 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:54:55,668 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365317014] [2022-02-20 16:54:55,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:55,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:54:55,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:55,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:55,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:54:55,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:55,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:54:55,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:54:55,684 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:55,722 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-02-20 16:54:55,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:54:55,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:54:55,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:55,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-20 16:54:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-20 16:54:55,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-02-20 16:54:55,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:55,773 INFO L225 Difference]: With dead ends: 39 [2022-02-20 16:54:55,773 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:54:55,774 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:55,783 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 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:55,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 34 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:55,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:54:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-02-20 16:54:55,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:55,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,788 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,788 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:55,789 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-20 16:54:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-20 16:54:55,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:55,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:55,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 16:54:55,790 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-20 16:54:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:55,791 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-20 16:54:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-20 16:54:55,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:55,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:55,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:55,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-02-20 16:54:55,792 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2022-02-20 16:54:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:55,792 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-02-20 16:54:55,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-02-20 16:54:55,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:54:55,793 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:55,793 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:55,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:54:55,793 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:55,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:55,793 INFO L85 PathProgramCache]: Analyzing trace with hash -119698060, now seen corresponding path program 1 times [2022-02-20 16:54:55,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:55,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355871931] [2022-02-20 16:54:55,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:55,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:55,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {382#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {382#true} is VALID [2022-02-20 16:54:55,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {384#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 16:54:55,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {384#(= (+ (- 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; {384#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 16:54:55,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {384#(= (+ (- 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); {384#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 16:54:55,851 INFO L290 TraceCheckUtils]: 4: Hoare triple {384#(= (+ (- 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); {384#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 16:54:55,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {384#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {384#(= (+ (- 2) |ULTIMATE.start_dll_create_~len#1|) 0)} is VALID [2022-02-20 16:54:55,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {384#(= (+ (- 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; {385#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:55,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {383#false} is VALID [2022-02-20 16:54:55,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {383#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {383#false} is VALID [2022-02-20 16:54:55,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {383#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {383#false} is VALID [2022-02-20 16:54:55,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {383#false} assume !(main_~i~0#1 >= 0); {383#false} is VALID [2022-02-20 16:54:55,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {383#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {383#false} is VALID [2022-02-20 16:54:55,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {383#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {383#false} is VALID [2022-02-20 16:54:55,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {383#false} assume !false; {383#false} is VALID [2022-02-20 16:54:55,854 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:55,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:55,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355871931] [2022-02-20 16:54:55,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355871931] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:55,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876053922] [2022-02-20 16:54:55,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:55,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:55,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:55,858 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:55,858 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:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:55,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:54:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:55,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:56,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {382#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {382#true} is VALID [2022-02-20 16:54:56,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:56,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {392#(<= 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; {392#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:56,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {392#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {392#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:56,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {392#(<= 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); {392#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:56,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {392#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {392#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:56,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {392#(<= 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; {385#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:56,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {383#false} is VALID [2022-02-20 16:54:56,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {383#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {383#false} is VALID [2022-02-20 16:54:56,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {383#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {383#false} is VALID [2022-02-20 16:54:56,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {383#false} assume !(main_~i~0#1 >= 0); {383#false} is VALID [2022-02-20 16:54:56,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {383#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {383#false} is VALID [2022-02-20 16:54:56,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {383#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {383#false} is VALID [2022-02-20 16:54:56,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {383#false} assume !false; {383#false} is VALID [2022-02-20 16:54:56,077 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:56,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:56,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {383#false} assume !false; {383#false} is VALID [2022-02-20 16:54:56,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {383#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {383#false} is VALID [2022-02-20 16:54:56,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {383#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {383#false} is VALID [2022-02-20 16:54:56,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {383#false} assume !(main_~i~0#1 >= 0); {383#false} is VALID [2022-02-20 16:54:56,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {383#false} main_#t~ret9#1.base, main_#t~ret9#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {383#false} is VALID [2022-02-20 16:54:56,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {383#false} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {383#false} is VALID [2022-02-20 16:54:56,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {385#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~len#1 > 0); {383#false} is VALID [2022-02-20 16:54:56,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {392#(<= 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; {385#(<= 1 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:56,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {392#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {392#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:56,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {392#(<= 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); {392#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:56,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {392#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {392#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:56,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {392#(<= 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; {392#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:56,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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#(<= 2 |ULTIMATE.start_dll_create_~len#1|)} is VALID [2022-02-20 16:54:56,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {382#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {382#true} is VALID [2022-02-20 16:54:56,176 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:56,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876053922] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:54:56,176 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:54:56,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-02-20 16:54:56,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349475029] [2022-02-20 16:54:56,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:56,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:54:56,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:56,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:56,191 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:56,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:54:56,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:56,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:54:56,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:54:56,194 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:56,246 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-02-20 16:54:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:54:56,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:54:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-02-20 16:54:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-02-20 16:54:56,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-02-20 16:54:56,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:56,277 INFO L225 Difference]: With dead ends: 35 [2022-02-20 16:54:56,278 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 16:54:56,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:54:56,279 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:56,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 40 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 16:54:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 16:54:56,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:56,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:56,283 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:56,283 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:56,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:56,284 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 16:54:56,284 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 16:54:56,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:56,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:56,284 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2022-02-20 16:54:56,285 INFO L87 Difference]: Start difference. First operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 24 states. [2022-02-20 16:54:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:56,286 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-02-20 16:54:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 16:54:56,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:56,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:56,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:56,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:56,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:56,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-02-20 16:54:56,287 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2022-02-20 16:54:56,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:56,287 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-02-20 16:54:56,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:56,288 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-02-20 16:54:56,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:54:56,288 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:56,288 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:56,311 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:56,505 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:56,506 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:56,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:56,506 INFO L85 PathProgramCache]: Analyzing trace with hash 624467328, now seen corresponding path program 1 times [2022-02-20 16:54:56,506 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:56,506 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074322139] [2022-02-20 16:54:56,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:56,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:56,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {589#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {589#true} is VALID [2022-02-20 16:54:56,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {589#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {591#(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:56,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {591#(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; {591#(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:56,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {591#(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); {591#(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:56,588 INFO L290 TraceCheckUtils]: 4: Hoare triple {591#(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); {591#(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:56,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {591#(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); {591#(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:56,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {591#(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; {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {592#(<= 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; {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#(<= 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); {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {592#(<= 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); {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {592#(<= 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; {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {592#(<= 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; {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret9#1.base, main_#t~ret9#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {593#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:56,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {593#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {590#false} is VALID [2022-02-20 16:54:56,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {590#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {590#false} is VALID [2022-02-20 16:54:56,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {590#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {590#false} is VALID [2022-02-20 16:54:56,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {590#false} assume !false; {590#false} is VALID [2022-02-20 16:54:56,593 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:56,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:56,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074322139] [2022-02-20 16:54:56,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074322139] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:56,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848129898] [2022-02-20 16:54:56,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:56,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:56,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:56,595 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:56,596 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:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:56,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:54:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:56,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:56,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {589#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {589#true} is VALID [2022-02-20 16:54:56,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {589#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {592#(<= 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; {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {592#(<= 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); {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {592#(<= 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; {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {592#(<= 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; {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#(<= 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); {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {592#(<= 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); {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {592#(<= 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; {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {592#(<= 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; {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:56,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret9#1.base, main_#t~ret9#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {593#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:56,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {593#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {590#false} is VALID [2022-02-20 16:54:56,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {590#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {590#false} is VALID [2022-02-20 16:54:56,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {590#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {590#false} is VALID [2022-02-20 16:54:56,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {590#false} assume !false; {590#false} is VALID [2022-02-20 16:54:56,752 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:56,752 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:54:56,752 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848129898] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:54:56,752 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 16:54:56,752 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-20 16:54:56,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743453661] [2022-02-20 16:54:56,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:54:56,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 19 [2022-02-20 16:54:56,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:56,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:56,763 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:56,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:54:56,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:56,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:54:56,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:54:56,764 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:56,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:56,805 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-02-20 16:54:56,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:54:56,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 19 [2022-02-20 16:54:56,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-02-20 16:54:56,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-02-20 16:54:56,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-02-20 16:54:56,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:56,828 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:54:56,828 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:54:56,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:54:56,829 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:56,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:54:56,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-02-20 16:54:56,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:56,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:56,837 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:56,837 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:56,838 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:54:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:54:56,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:56,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:56,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 16:54:56,839 INFO L87 Difference]: Start difference. First operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 16:54:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:56,839 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:54:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:54:56,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:56,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:56,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:56,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-02-20 16:54:56,841 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 19 [2022-02-20 16:54:56,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:56,841 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-02-20 16:54:56,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-20 16:54:56,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:54:56,841 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:56,841 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] [2022-02-20 16:54:56,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 16:54:57,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:57,048 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:57,048 INFO L85 PathProgramCache]: Analyzing trace with hash 303997821, now seen corresponding path program 1 times [2022-02-20 16:54:57,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:57,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932798653] [2022-02-20 16:54:57,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:57,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:57,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {783#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {783#true} is VALID [2022-02-20 16:54:57,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {785#(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:57,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {785#(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; {785#(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:57,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {785#(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); {785#(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:57,176 INFO L290 TraceCheckUtils]: 4: Hoare triple {785#(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); {785#(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:57,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {785#(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); {785#(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:57,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {785#(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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {786#(<= 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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {786#(<= 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); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {786#(<= 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); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {786#(<= 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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {786#(<= 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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret9#1.base, main_#t~ret9#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_first } true;dll_remove_first_#in~head#1.base, dll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset, dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset, dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset, dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset;dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset := dll_remove_first_#in~head#1.base, dll_remove_first_#in~head#1.offset;call dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset := read~$Pointer$(dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4);call dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset := read~$Pointer$(dll_remove_first_#t~mem6#1.base, 4 + dll_remove_first_#t~mem6#1.offset, 4);dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset := dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset;havoc dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset;havoc dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset; {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume dll_remove_first_~temp~1#1.base != 0 || dll_remove_first_~temp~1#1.offset != 0;call write~$Pointer$(0, 0, dll_remove_first_~temp~1#1.base, 8 + dll_remove_first_~temp~1#1.offset, 4); {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} call dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset := read~$Pointer$(dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4);call ULTIMATE.dealloc(dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset);havoc dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset;call write~$Pointer$(dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset, dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4); {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_dll_remove_first } true; {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {788#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {788#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {784#false} is VALID [2022-02-20 16:54:57,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {784#false} is VALID [2022-02-20 16:54:57,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {784#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {784#false} is VALID [2022-02-20 16:54:57,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-02-20 16:54:57,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 16:54:57,184 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:57,184 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932798653] [2022-02-20 16:54:57,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932798653] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:57,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780162792] [2022-02-20 16:54:57,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:57,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:57,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:57,186 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:57,187 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:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:57,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:54:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:57,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:57,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {783#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {783#true} is VALID [2022-02-20 16:54:57,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {786#(<= 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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,364 INFO L290 TraceCheckUtils]: 4: Hoare triple {786#(<= 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); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {786#(<= 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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {786#(<= 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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {786#(<= 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); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {786#(<= 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); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {786#(<= 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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {786#(<= 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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret9#1.base, main_#t~ret9#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_first } true;dll_remove_first_#in~head#1.base, dll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset, dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset, dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset, dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset;dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset := dll_remove_first_#in~head#1.base, dll_remove_first_#in~head#1.offset;call dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset := read~$Pointer$(dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4);call dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset := read~$Pointer$(dll_remove_first_#t~mem6#1.base, 4 + dll_remove_first_#t~mem6#1.offset, 4);dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset := dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset;havoc dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset;havoc dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset; {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume dll_remove_first_~temp~1#1.base != 0 || dll_remove_first_~temp~1#1.offset != 0;call write~$Pointer$(0, 0, dll_remove_first_~temp~1#1.base, 8 + dll_remove_first_~temp~1#1.offset, 4); {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} call dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset := read~$Pointer$(dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4);call ULTIMATE.dealloc(dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset);havoc dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset;call write~$Pointer$(dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset, dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4); {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_dll_remove_first } true; {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {788#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {788#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {784#false} is VALID [2022-02-20 16:54:57,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {784#false} is VALID [2022-02-20 16:54:57,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {784#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {784#false} is VALID [2022-02-20 16:54:57,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-02-20 16:54:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:54:57,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:54:57,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-02-20 16:54:57,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {784#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {784#false} is VALID [2022-02-20 16:54:57,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {784#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {784#false} is VALID [2022-02-20 16:54:57,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {788#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~i~0#1 >= 0); {784#false} is VALID [2022-02-20 16:54:57,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {788#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume { :end_inline_dll_remove_first } true; {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} call dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset := read~$Pointer$(dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4);call ULTIMATE.dealloc(dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset);havoc dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset;call write~$Pointer$(dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset, dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4); {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume dll_remove_first_~temp~1#1.base != 0 || dll_remove_first_~temp~1#1.offset != 0;call write~$Pointer$(0, 0, dll_remove_first_~temp~1#1.base, 8 + dll_remove_first_~temp~1#1.offset, 4); {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_first } true;dll_remove_first_#in~head#1.base, dll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset, dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset, dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset, dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset;dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset := dll_remove_first_#in~head#1.base, dll_remove_first_#in~head#1.offset;call dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset := read~$Pointer$(dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4);call dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset := read~$Pointer$(dll_remove_first_#t~mem6#1.base, 4 + dll_remove_first_#t~mem6#1.offset, 4);dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset := dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset;havoc dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset;havoc dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset; {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} main_#t~ret9#1.base, main_#t~ret9#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {787#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 16:54:57,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {786#(<= 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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~len#1 > 0); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {786#(<= 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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {786#(<= 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); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {786#(<= 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); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {786#(<= 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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {786#(<= 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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {786#(<= 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); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,511 INFO L290 TraceCheckUtils]: 3: Hoare triple {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {786#(<= 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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {786#(<= 2 |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:54:57,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {783#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {783#true} is VALID [2022-02-20 16:54:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:54:57,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780162792] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:54:57,512 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:54:57,512 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-02-20 16:54:57,512 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55684887] [2022-02-20 16:54:57,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:54:57,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 24 [2022-02-20 16:54:57,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:54:57,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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:57,531 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:57,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:54:57,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:54:57,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:54:57,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:54:57,532 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:57,612 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-02-20 16:54:57,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:54:57,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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 24 [2022-02-20 16:54:57,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:54:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 16:54:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 16:54:57,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-02-20 16:54:57,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:54:57,649 INFO L225 Difference]: With dead ends: 34 [2022-02-20 16:54:57,649 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:54:57,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:54:57,650 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:54:57,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 44 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:54:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:54:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 16:54:57,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:54:57,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:57,677 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:57,677 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:57,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:57,678 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-20 16:54:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-20 16:54:57,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:57,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:57,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 16:54:57,680 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 16:54:57,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:54:57,682 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-20 16:54:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-20 16:54:57,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:54:57,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:54:57,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:54:57,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:54:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:54:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-02-20 16:54:57,687 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 24 [2022-02-20 16:54:57,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:54:57,687 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-02-20 16:54:57,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-20 16:54:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 16:54:57,688 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:54:57,688 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:54:57,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:54:57,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:57,889 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:54:57,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:54:57,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2095960992, now seen corresponding path program 2 times [2022-02-20 16:54:57,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:54:57,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161029466] [2022-02-20 16:54:57,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:54:57,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:54:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:58,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {1074#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {1074#true} is VALID [2022-02-20 16:54:58,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {1076#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |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:58,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |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; {1077#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |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:58,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {1077#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |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); {1077#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |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:58,588 INFO L290 TraceCheckUtils]: 4: Hoare triple {1077#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |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); {1078#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:54:58,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {1078#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (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); {1078#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:54:58,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {1078#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (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; {1079#(and (= (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|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-20 16:54:58,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#(and (= (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|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 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; {1080#(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|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-20 16:54:58,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {1080#(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|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1080#(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|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-20 16:54:58,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {1080#(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|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 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 (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 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.offset| 8) 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 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-20 16:54:58,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {1081#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 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.offset| 8) 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 (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 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); {1082#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 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 (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.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))) 4) 0))} is VALID [2022-02-20 16:54:58,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {1082#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 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 (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.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))) 4) 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; {1083#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 4)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-20 16:54:58,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {1083#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 4)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} assume !(dll_create_~len#1 > 0); {1083#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 4)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-20 16:54:58,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {1083#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 4)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {1084#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4)) 4) 0) (= |ULTIMATE.start_dll_create_#res#1.offset| 0))} is VALID [2022-02-20 16:54:58,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {1084#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) 4)) 4) 0) (= |ULTIMATE.start_dll_create_#res#1.offset| 0))} main_#t~ret9#1.base, main_#t~ret9#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {1085#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 4) 0))} is VALID [2022-02-20 16:54:58,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {1085#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4)) 4) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_first } true;dll_remove_first_#in~head#1.base, dll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset, dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset, dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset, dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset;dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset := dll_remove_first_#in~head#1.base, dll_remove_first_#in~head#1.offset;call dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset := read~$Pointer$(dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4);call dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset := read~$Pointer$(dll_remove_first_#t~mem6#1.base, 4 + dll_remove_first_#t~mem6#1.offset, 4);dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset := dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset;havoc dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset;havoc dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset; {1086#(and (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 4) 0) (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 4) 0) (= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 4) 4) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:54:58,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {1086#(and (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 4) 0) (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 4) 0) (= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 4) 4) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume dll_remove_first_~temp~1#1.base != 0 || dll_remove_first_~temp~1#1.offset != 0;call write~$Pointer$(0, 0, dll_remove_first_~temp~1#1.base, 8 + dll_remove_first_~temp~1#1.offset, 4); {1087#(and (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 4) 0) (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 4) 0) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:54:58,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {1087#(and (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 4) 0) (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 4) 0) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} call dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset := read~$Pointer$(dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4);call ULTIMATE.dealloc(dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset);havoc dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset;call write~$Pointer$(dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset, dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4); {1088#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-20 16:54:58,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {1088#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} assume { :end_inline_dll_remove_first } true; {1088#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-20 16:54:58,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {1088#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {1088#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} is VALID [2022-02-20 16:54:58,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {1088#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) 4) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_first } true;dll_remove_first_#in~head#1.base, dll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset, dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset, dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset, dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset;dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset := dll_remove_first_#in~head#1.base, dll_remove_first_#in~head#1.offset;call dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset := read~$Pointer$(dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4);call dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset := read~$Pointer$(dll_remove_first_#t~mem6#1.base, 4 + dll_remove_first_#t~mem6#1.offset, 4);dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset := dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset;havoc dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset;havoc dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset; {1089#(and (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 0) (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| 0) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 16:54:58,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {1089#(and (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 0) (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| 0) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} assume dll_remove_first_~temp~1#1.base != 0 || dll_remove_first_~temp~1#1.offset != 0;call write~$Pointer$(0, 0, dll_remove_first_~temp~1#1.base, 8 + dll_remove_first_~temp~1#1.offset, 4); {1090#(and (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| 0) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} is VALID [2022-02-20 16:54:58,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {1090#(and (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| 0) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|))} call dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset := read~$Pointer$(dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4);call ULTIMATE.dealloc(dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset);havoc dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset;call write~$Pointer$(dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset, dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4); {1091#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 16:54:58,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {1091#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} assume { :end_inline_dll_remove_first } true; {1091#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 16:54:58,602 INFO L290 TraceCheckUtils]: 24: Hoare triple {1091#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {1091#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 16:54:58,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {1091#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} assume !(main_~i~0#1 >= 0); {1091#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 16:54:58,603 INFO L290 TraceCheckUtils]: 26: Hoare triple {1091#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1092#(and (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (= |ULTIMATE.start_main_#t~mem11#1.base| 0))} is VALID [2022-02-20 16:54:58,604 INFO L290 TraceCheckUtils]: 27: Hoare triple {1092#(and (= |ULTIMATE.start_main_#t~mem11#1.offset| 0) (= |ULTIMATE.start_main_#t~mem11#1.base| 0))} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {1075#false} is VALID [2022-02-20 16:54:58,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2022-02-20 16:54:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:54:58,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:54:58,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161029466] [2022-02-20 16:54:58,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161029466] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:54:58,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71156084] [2022-02-20 16:54:58,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:54:58,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:54:58,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:54:58,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:54:58,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 16:54:58,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:54:58,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:54:58,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 95 conjunts are in the unsatisfiable core [2022-02-20 16:54:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:54:58,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:54:58,745 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:58,796 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 16:54:58,797 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:58,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:58,872 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:58,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:58,882 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:59,001 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-20 16:54:59,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 16:54:59,104 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 16:54:59,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2022-02-20 16:54:59,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 16:54:59,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:59,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2022-02-20 16:54:59,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 16:54:59,242 INFO L356 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-02-20 16:54:59,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 56 [2022-02-20 16:54:59,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-02-20 16:54:59,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:59,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:54:59,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:54:59,848 INFO L356 Elim1Store]: treesize reduction 309, result has 9.1 percent of original size [2022-02-20 16:54:59,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 180 treesize of output 103 [2022-02-20 16:54:59,892 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-02-20 16:54:59,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 78 [2022-02-20 16:55:00,010 INFO L356 Elim1Store]: treesize reduction 79, result has 14.1 percent of original size [2022-02-20 16:55:00,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 158 treesize of output 90 [2022-02-20 16:55:00,039 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 16:55:00,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 88 [2022-02-20 16:55:00,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:55:00,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:55:00,685 INFO L356 Elim1Store]: treesize reduction 36, result has 7.7 percent of original size [2022-02-20 16:55:00,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 47 [2022-02-20 16:55:00,775 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 16:55:00,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 21 [2022-02-20 16:55:00,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {1074#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(19, 2); {1074#true} is VALID [2022-02-20 16:55:00,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1.base, main_#t~ret9#1.offset, main_#t~post10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~i~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_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; {1099#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:55:00,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#(and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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; {1103#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:55:00,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {1103#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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); {1103#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| 0))} is VALID [2022-02-20 16:55:00,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {1103#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |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); {1110#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:55:00,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {1110#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} assume !(dll_create_~head~0#1.base != 0 || dll_create_~head~0#1.offset != 0); {1110#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:55:00,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {1110#(and (= |ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 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; {1117#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-20 16:55:00,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {1117#(and (= (select |#valid| |ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 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; {1121#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |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_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-20 16:55:00,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {1121#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |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_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} assume !(0 == dll_create_~new_head~0#1.base && 0 == dll_create_~new_head~0#1.offset); {1121#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |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_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0))} is VALID [2022-02-20 16:55:00,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {1121#(and (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |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_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 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); {1128#(and (= |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 (= |ULTIMATE.start_dll_create_~head~0#1.base| |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_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~head~0#1.offset|))} is VALID [2022-02-20 16:55:00,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {1128#(and (= |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 (= |ULTIMATE.start_dll_create_~head~0#1.base| |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_~#s~0#1.offset| 0) (= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |ULTIMATE.start_dll_create_~head~0#1.offset|))} 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); {1132#(and (= (select (select |#memory_$Pointer$.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))) 8) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 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|)) (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$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) 4) 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.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))) 4) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0))} is VALID [2022-02-20 16:55:00,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {1132#(and (= (select (select |#memory_$Pointer$.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))) 8) |ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 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|)) (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$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) 4) 0) (not (= |ULTIMATE.start_dll_create_~new_head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.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))) 4) 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 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; {1136#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |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|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 8)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 4) 0))} is VALID [2022-02-20 16:55:00,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {1136#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |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|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 8)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 4) 0))} assume !(dll_create_~len#1 > 0); {1136#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |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|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 8)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 4) 0))} is VALID [2022-02-20 16:55:00,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {1136#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_dll_create_~head~0#1.base| |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|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4)) 0) (= |ULTIMATE.start_dll_create_~head~0#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 8)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_create_~head~0#1.offset| 4))) 4) 0))} dll_create_#res#1.base, dll_create_#res#1.offset := dll_create_~head~0#1.base, dll_create_~head~0#1.offset; {1143#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) 0) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4))) 4) 0) (not (= |ULTIMATE.start_dll_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4))) 4) 0) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4))) 8)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:55:00,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {1143#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) 0) (not (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4))) 4) 0) (not (= |ULTIMATE.start_dll_create_#res#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4))) 4) 0) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4))) 8)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_create_#res#1.base|) (+ |ULTIMATE.start_dll_create_#res#1.offset| 4)) |ULTIMATE.start_main_~#s~0#1.base|)))} main_#t~ret9#1.base, main_#t~ret9#1.offset := dll_create_#res#1.base, dll_create_#res#1.offset;assume { :end_inline_dll_create } true;call write~init~$Pointer$(main_#t~ret9#1.base, main_#t~ret9#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret9#1.base, main_#t~ret9#1.offset;havoc main_~i~0#1;main_~i~0#1 := main_~len~0#1 - 1; {1147#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 4) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 8) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 4) 0))} is VALID [2022-02-20 16:55:00,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {1147#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 4) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 8) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 4) 0))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_first } true;dll_remove_first_#in~head#1.base, dll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset, dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset, dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset, dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset;dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset := dll_remove_first_#in~head#1.base, dll_remove_first_#in~head#1.offset;call dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset := read~$Pointer$(dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4);call dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset := read~$Pointer$(dll_remove_first_#t~mem6#1.base, 4 + dll_remove_first_#t~mem6#1.offset, 4);dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset := dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset;havoc dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset;havoc dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset; {1151#(and (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 4)) |ULTIMATE.start_dll_remove_first_~temp~1#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|)) (+ (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|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 8) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0) (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 4))) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 4) 0))} is VALID [2022-02-20 16:55:00,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {1151#(and (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) |ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 4)) |ULTIMATE.start_dll_remove_first_~temp~1#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|)) (+ (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|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 8) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0) (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 4))) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4))) 4) 0))} assume dll_remove_first_~temp~1#1.base != 0 || dll_remove_first_~temp~1#1.offset != 0;call write~$Pointer$(0, 0, dll_remove_first_~temp~1#1.base, 8 + dll_remove_first_~temp~1#1.offset, 4); {1155#(and (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 4) 0) (= |ULTIMATE.start_dll_remove_first_~temp~1#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$.offset| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:55:00,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {1155#(and (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 4) 0) (= |ULTIMATE.start_dll_remove_first_~temp~1#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$.offset| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 4) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (not (= |ULTIMATE.start_main_~#s~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (not (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} call dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset := read~$Pointer$(dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4);call ULTIMATE.dealloc(dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset);havoc dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset;call write~$Pointer$(dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset, dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4); {1159#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_23 Int) (v_arrayElimIndex_9 Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) v_arrayElimIndex_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9)) 4) 0) (not (= v_arrayElimCell_23 |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) v_arrayElimCell_23)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) (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| v_arrayElimCell_23) v_arrayElimIndex_9)) 4) 0) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) v_arrayElimIndex_9) 0) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) |ULTIMATE.start_main_~#s~0#1.base|)))))} is VALID [2022-02-20 16:55:00,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {1159#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_23 Int) (v_arrayElimIndex_9 Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) v_arrayElimIndex_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9)) 4) 0) (not (= v_arrayElimCell_23 |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) v_arrayElimCell_23)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) (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| v_arrayElimCell_23) v_arrayElimIndex_9)) 4) 0) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) v_arrayElimIndex_9) 0) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) |ULTIMATE.start_main_~#s~0#1.base|)))))} assume { :end_inline_dll_remove_first } true; {1159#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_23 Int) (v_arrayElimIndex_9 Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) v_arrayElimIndex_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9)) 4) 0) (not (= v_arrayElimCell_23 |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) v_arrayElimCell_23)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) (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| v_arrayElimCell_23) v_arrayElimIndex_9)) 4) 0) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) v_arrayElimIndex_9) 0) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) |ULTIMATE.start_main_~#s~0#1.base|)))))} is VALID [2022-02-20 16:55:00,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {1159#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_23 Int) (v_arrayElimIndex_9 Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) v_arrayElimIndex_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9)) 4) 0) (not (= v_arrayElimCell_23 |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) v_arrayElimCell_23)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) (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| v_arrayElimCell_23) v_arrayElimIndex_9)) 4) 0) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) v_arrayElimIndex_9) 0) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) |ULTIMATE.start_main_~#s~0#1.base|)))))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {1159#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_23 Int) (v_arrayElimIndex_9 Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) v_arrayElimIndex_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9)) 4) 0) (not (= v_arrayElimCell_23 |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) v_arrayElimCell_23)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) (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| v_arrayElimCell_23) v_arrayElimIndex_9)) 4) 0) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) v_arrayElimIndex_9) 0) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) |ULTIMATE.start_main_~#s~0#1.base|)))))} is VALID [2022-02-20 16:55:00,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {1159#(and (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_23 Int) (v_arrayElimIndex_9 Int)) (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) v_arrayElimIndex_9)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9)) 4) 0) (not (= v_arrayElimCell_23 |ULTIMATE.start_main_~#s~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) v_arrayElimCell_23)) (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) (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| v_arrayElimCell_23) v_arrayElimIndex_9)) 4) 0) (= (select (select |#memory_$Pointer$.offset| v_arrayElimCell_23) v_arrayElimIndex_9) 0) (not (= (select (select |#memory_$Pointer$.base| v_arrayElimCell_23) v_arrayElimIndex_9) |ULTIMATE.start_main_~#s~0#1.base|)))))} assume !!(main_~i~0#1 >= 0);assume { :begin_inline_dll_remove_first } true;dll_remove_first_#in~head#1.base, dll_remove_first_#in~head#1.offset := main_~#s~0#1.base, main_~#s~0#1.offset;havoc dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset, dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset, dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset, dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset;dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset := dll_remove_first_#in~head#1.base, dll_remove_first_#in~head#1.offset;call dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset := read~$Pointer$(dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4);call dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset := read~$Pointer$(dll_remove_first_#t~mem6#1.base, 4 + dll_remove_first_#t~mem6#1.offset, 4);dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset := dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset;havoc dll_remove_first_#t~mem6#1.base, dll_remove_first_#t~mem6#1.offset;havoc dll_remove_first_#t~mem7#1.base, dll_remove_first_#t~mem7#1.offset; {1169#(and (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| 0))} is VALID [2022-02-20 16:55:00,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {1169#(and (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| 0))} assume dll_remove_first_~temp~1#1.base != 0 || dll_remove_first_~temp~1#1.offset != 0;call write~$Pointer$(0, 0, dll_remove_first_~temp~1#1.base, 8 + dll_remove_first_~temp~1#1.offset, 4); {1075#false} is VALID [2022-02-20 16:55:00,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {1075#false} call dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset := read~$Pointer$(dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4);call ULTIMATE.dealloc(dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset);havoc dll_remove_first_#t~mem8#1.base, dll_remove_first_#t~mem8#1.offset;call write~$Pointer$(dll_remove_first_~temp~1#1.base, dll_remove_first_~temp~1#1.offset, dll_remove_first_~head#1.base, dll_remove_first_~head#1.offset, 4); {1075#false} is VALID [2022-02-20 16:55:00,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {1075#false} assume { :end_inline_dll_remove_first } true; {1075#false} is VALID [2022-02-20 16:55:00,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {1075#false} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := main_#t~post10#1 - 1;havoc main_#t~post10#1; {1075#false} is VALID [2022-02-20 16:55:00,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {1075#false} assume !(main_~i~0#1 >= 0); {1075#false} is VALID [2022-02-20 16:55:00,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {1075#false} call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1075#false} is VALID [2022-02-20 16:55:00,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {1075#false} assume 0 != main_#t~mem11#1.base || 0 != main_#t~mem11#1.offset;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {1075#false} is VALID [2022-02-20 16:55:00,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2022-02-20 16:55:00,873 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:55:00,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:55:07,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:55:07,612 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:55:07,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2604 treesize of output 2020 [2022-02-20 16:55:07,678 INFO L356 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-02-20 16:55:07,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2064 treesize of output 1400 [2022-02-20 16:55:08,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_416 Int)) (let ((.cse22 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse0 (+ (select (select (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_3))) (store .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse22 v_ArrVal_416))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (or (not (= (select v_arrayElimArr_4 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (and (forall ((v_ArrVal_419 Int)) (= (let ((.cse9 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse3 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_3))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 v_ArrVal_416)))) (.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_4))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse3 .cse6) .cse7))) (select (let ((.cse4 (select (select .cse5 .cse6) .cse7))) (select (let ((.cse1 (store .cse3 .cse4 (store (select .cse3 .cse4) (+ .cse2 8) v_ArrVal_419)))) (store .cse1 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| .cse2))) .cse4)) (+ .cse2 4)))))) 0)) (forall ((v_ArrVal_418 Int)) (= (let ((.cse19 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse17 (let ((.cse20 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_3))) (store .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse19 v_ArrVal_416)))) (.cse13 (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_4))) (store .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse15 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (+ (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse14 (select (select .cse17 .cse15) .cse16))) (select (let ((.cse12 (select (select .cse13 .cse15) .cse16))) (select (let ((.cse11 (store .cse13 .cse12 (store (select .cse13 .cse12) (+ .cse14 8) v_ArrVal_418)))) (store .cse11 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| .cse12))) .cse12)) (+ .cse14 4)))))) 0))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_4))) (store .cse21 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse21 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_3 .cse0))))))) is different from false [2022-02-20 16:55:11,996 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:55:12,011 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:55:12,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 3296 treesize of output 2386 [2022-02-20 16:55:12,071 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-02-20 16:55:12,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2440 treesize of output 1440