./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0234-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0234-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e40f9e7b474ba5b84186650c7060a1f3eed5394bab52ac2eaa493135efa417c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:45:33,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:45:33,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:45:33,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:45:33,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:45:33,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:45:33,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:45:33,694 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:45:33,695 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:45:33,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:45:33,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:45:33,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:45:33,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:45:33,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:45:33,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:45:33,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:45:33,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:45:33,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:45:33,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:45:33,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:45:33,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:45:33,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:45:33,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:45:33,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:45:33,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:45:33,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:45:33,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:45:33,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:45:33,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:45:33,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:45:33,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:45:33,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:45:33,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:45:33,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:45:33,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:45:33,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:45:33,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:45:33,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:45:33,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:45:33,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:45:33,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:45:33,728 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:45:33,754 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:45:33,755 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:45:33,755 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:45:33,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:45:33,756 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:45:33,756 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:45:33,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:45:33,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:45:33,757 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:45:33,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:45:33,758 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:45:33,758 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:45:33,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:45:33,758 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:45:33,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:45:33,759 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:45:33,759 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:45:33,759 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:45:33,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:45:33,759 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:45:33,760 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:45:33,760 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:45:33,760 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:45:33,760 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:45:33,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:45:33,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:33,761 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:45:33,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:45:33,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:45:33,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:45:33,762 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e40f9e7b474ba5b84186650c7060a1f3eed5394bab52ac2eaa493135efa417c [2022-02-20 23:45:33,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:45:34,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:45:34,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:45:34,022 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:45:34,022 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:45:34,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0234-1.i [2022-02-20 23:45:34,077 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f5bdbc7/271f819fa10e475e85acecb687683387/FLAG3e7d75cbd [2022-02-20 23:45:34,568 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:45:34,569 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0234-1.i [2022-02-20 23:45:34,587 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f5bdbc7/271f819fa10e475e85acecb687683387/FLAG3e7d75cbd [2022-02-20 23:45:34,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0f5bdbc7/271f819fa10e475e85acecb687683387 [2022-02-20 23:45:34,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:45:34,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:45:34,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:34,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:45:34,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:45:34,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:34" (1/1) ... [2022-02-20 23:45:34,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70871063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:34, skipping insertion in model container [2022-02-20 23:45:34,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:34" (1/1) ... [2022-02-20 23:45:34,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:45:34,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:45:35,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:35,013 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:45:35,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:35,119 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:45:35,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:35 WrapperNode [2022-02-20 23:45:35,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:35,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:35,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:45:35,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:45:35,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:35" (1/1) ... [2022-02-20 23:45:35,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:35" (1/1) ... [2022-02-20 23:45:35,198 INFO L137 Inliner]: procedures = 188, calls = 60, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 203 [2022-02-20 23:45:35,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:35,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:45:35,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:45:35,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:45:35,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:35" (1/1) ... [2022-02-20 23:45:35,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:35" (1/1) ... [2022-02-20 23:45:35,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:35" (1/1) ... [2022-02-20 23:45:35,230 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:35" (1/1) ... [2022-02-20 23:45:35,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:35" (1/1) ... [2022-02-20 23:45:35,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:35" (1/1) ... [2022-02-20 23:45:35,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:35" (1/1) ... [2022-02-20 23:45:35,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:45:35,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:45:35,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:45:35,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:45:35,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:35" (1/1) ... [2022-02-20 23:45:35,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:35,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:35,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:45:35,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:45:35,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:45:35,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:45:35,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:45:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:45:35,343 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2022-02-20 23:45:35,344 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2022-02-20 23:45:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:45:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:45:35,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:45:35,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:45:35,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:45:35,499 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:45:35,501 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:45:36,038 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:45:36,046 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:45:36,046 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 23:45:36,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:36 BoogieIcfgContainer [2022-02-20 23:45:36,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:45:36,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:45:36,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:45:36,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:45:36,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:45:34" (1/3) ... [2022-02-20 23:45:36,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a63444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:36, skipping insertion in model container [2022-02-20 23:45:36,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:35" (2/3) ... [2022-02-20 23:45:36,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a63444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:36, skipping insertion in model container [2022-02-20 23:45:36,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:36" (3/3) ... [2022-02-20 23:45:36,055 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0234-1.i [2022-02-20 23:45:36,063 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:45:36,063 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2022-02-20 23:45:36,096 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:45:36,101 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:45:36,101 INFO L340 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2022-02-20 23:45:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 191 states, 108 states have (on average 1.8981481481481481) internal successors, (205), 183 states have internal predecessors, (205), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:45:36,124 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:36,125 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:45:36,125 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 71 more)] === [2022-02-20 23:45:36,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:36,129 INFO L85 PathProgramCache]: Analyzing trace with hash 930118, now seen corresponding path program 1 times [2022-02-20 23:45:36,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:36,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725660643] [2022-02-20 23:45:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:36,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:36,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {194#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {194#true} is VALID [2022-02-20 23:45:36,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~mem32#1.base, main_#t~mem32#1.offset; {194#true} is VALID [2022-02-20 23:45:36,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume !true; {195#false} is VALID [2022-02-20 23:45:36,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {195#false} assume !(1 == #valid[~#list~0.base]); {195#false} is VALID [2022-02-20 23:45:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:36,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:36,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725660643] [2022-02-20 23:45:36,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725660643] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:36,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:36,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:36,260 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397870390] [2022-02-20 23:45:36,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:36,265 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:45:36,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:36,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:36,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:36,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:45:36,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:36,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:45:36,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:45:36,307 INFO L87 Difference]: Start difference. First operand has 191 states, 108 states have (on average 1.8981481481481481) internal successors, (205), 183 states have internal predecessors, (205), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,543 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2022-02-20 23:45:36,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:45:36,543 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:45:36,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:36,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 217 transitions. [2022-02-20 23:45:36,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:36,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 217 transitions. [2022-02-20 23:45:36,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 217 transitions. [2022-02-20 23:45:36,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:36,819 INFO L225 Difference]: With dead ends: 191 [2022-02-20 23:45:36,819 INFO L226 Difference]: Without dead ends: 189 [2022-02-20 23:45:36,821 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 23:45:36,823 INFO L933 BasicCegarLoop]: 206 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, 206 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 23:45:36,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:36,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-02-20 23:45:36,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-02-20 23:45:36,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:36,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 107 states have (on average 1.794392523364486) internal successors, (192), 181 states have internal predecessors, (192), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:36,861 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 107 states have (on average 1.794392523364486) internal successors, (192), 181 states have internal predecessors, (192), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:36,862 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 107 states have (on average 1.794392523364486) internal successors, (192), 181 states have internal predecessors, (192), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:36,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,874 INFO L93 Difference]: Finished difference Result 189 states and 204 transitions. [2022-02-20 23:45:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 204 transitions. [2022-02-20 23:45:36,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:36,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:36,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 107 states have (on average 1.794392523364486) internal successors, (192), 181 states have internal predecessors, (192), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 189 states. [2022-02-20 23:45:36,877 INFO L87 Difference]: Start difference. First operand has 189 states, 107 states have (on average 1.794392523364486) internal successors, (192), 181 states have internal predecessors, (192), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 189 states. [2022-02-20 23:45:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,888 INFO L93 Difference]: Finished difference Result 189 states and 204 transitions. [2022-02-20 23:45:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 204 transitions. [2022-02-20 23:45:36,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:36,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:36,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:36,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:36,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 107 states have (on average 1.794392523364486) internal successors, (192), 181 states have internal predecessors, (192), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:36,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 204 transitions. [2022-02-20 23:45:36,901 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 204 transitions. Word has length 4 [2022-02-20 23:45:36,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:36,902 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 204 transitions. [2022-02-20 23:45:36,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:36,902 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 204 transitions. [2022-02-20 23:45:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:45:36,902 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:36,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:45:36,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:45:36,903 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 71 more)] === [2022-02-20 23:45:36,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:36,904 INFO L85 PathProgramCache]: Analyzing trace with hash 889842618, now seen corresponding path program 1 times [2022-02-20 23:45:36,904 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:36,904 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45828923] [2022-02-20 23:45:36,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:36,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:36,919 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:36,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004979268] [2022-02-20 23:45:36,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:36,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:36,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:36,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:36,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:45:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:37,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:45:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:37,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:37,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:45:37,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {956#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {956#true} is VALID [2022-02-20 23:45:37,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {956#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~mem32#1.base, main_#t~mem32#1.offset; {956#true} is VALID [2022-02-20 23:45:37,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {956#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {956#true} is VALID [2022-02-20 23:45:37,105 INFO L272 TraceCheckUtils]: 3: Hoare triple {956#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {956#true} is VALID [2022-02-20 23:45:37,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {956#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {973#(= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)} is VALID [2022-02-20 23:45:37,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {973#(= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)} assume !(1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {957#false} is VALID [2022-02-20 23:45:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:37,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:37,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:37,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45828923] [2022-02-20 23:45:37,108 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:37,108 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004979268] [2022-02-20 23:45:37,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004979268] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:37,109 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:37,109 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:37,109 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431078382] [2022-02-20 23:45:37,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:37,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:45:37,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:37,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:37,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:37,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:37,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:37,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:37,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:37,117 INFO L87 Difference]: Start difference. First operand 189 states and 204 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:37,520 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2022-02-20 23:45:37,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:37,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:45:37,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:37,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2022-02-20 23:45:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:37,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2022-02-20 23:45:37,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 204 transitions. [2022-02-20 23:45:37,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:37,747 INFO L225 Difference]: With dead ends: 188 [2022-02-20 23:45:37,747 INFO L226 Difference]: Without dead ends: 188 [2022-02-20 23:45:37,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:37,748 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 9 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:37,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 316 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:37,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-02-20 23:45:37,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-02-20 23:45:37,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:37,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 188 states, 107 states have (on average 1.7850467289719627) internal successors, (191), 180 states have internal predecessors, (191), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:37,758 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 188 states, 107 states have (on average 1.7850467289719627) internal successors, (191), 180 states have internal predecessors, (191), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:37,758 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 188 states, 107 states have (on average 1.7850467289719627) internal successors, (191), 180 states have internal predecessors, (191), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:37,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:37,768 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2022-02-20 23:45:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 203 transitions. [2022-02-20 23:45:37,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:37,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:37,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 188 states, 107 states have (on average 1.7850467289719627) internal successors, (191), 180 states have internal predecessors, (191), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 188 states. [2022-02-20 23:45:37,771 INFO L87 Difference]: Start difference. First operand has 188 states, 107 states have (on average 1.7850467289719627) internal successors, (191), 180 states have internal predecessors, (191), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 188 states. [2022-02-20 23:45:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:37,781 INFO L93 Difference]: Finished difference Result 188 states and 203 transitions. [2022-02-20 23:45:37,781 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 203 transitions. [2022-02-20 23:45:37,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:37,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:37,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:37,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 107 states have (on average 1.7850467289719627) internal successors, (191), 180 states have internal predecessors, (191), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 203 transitions. [2022-02-20 23:45:37,792 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 203 transitions. Word has length 6 [2022-02-20 23:45:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:37,793 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 203 transitions. [2022-02-20 23:45:37,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 203 transitions. [2022-02-20 23:45:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:45:37,793 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:37,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:37,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:38,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:38,020 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 71 more)] === [2022-02-20 23:45:38,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1815317712, now seen corresponding path program 1 times [2022-02-20 23:45:38,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:38,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633260640] [2022-02-20 23:45:38,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:38,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:38,035 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:38,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1501818586] [2022-02-20 23:45:38,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:38,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:38,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:38,040 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:38,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:45:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:38,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:45:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:38,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:38,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:45:39,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {1728#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {1728#true} is VALID [2022-02-20 23:45:39,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~mem32#1.base, main_#t~mem32#1.offset; {1728#true} is VALID [2022-02-20 23:45:39,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {1728#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {1728#true} is VALID [2022-02-20 23:45:39,026 INFO L272 TraceCheckUtils]: 3: Hoare triple {1728#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {1728#true} is VALID [2022-02-20 23:45:39,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {1728#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {1745#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= |zalloc_or_die_#Ultimate.C_memset_#amount#1| (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|)) (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (select |#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))) (= |zalloc_or_die_#Ultimate.C_memset_#ptr#1.offset| 0))} is VALID [2022-02-20 23:45:39,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {1745#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= |zalloc_or_die_#Ultimate.C_memset_#amount#1| (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|)) (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (select |#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))) (= |zalloc_or_die_#Ultimate.C_memset_#ptr#1.offset| 0))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {1745#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= |zalloc_or_die_#Ultimate.C_memset_#amount#1| (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|)) (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (select |#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))) (= |zalloc_or_die_#Ultimate.C_memset_#ptr#1.offset| 0))} is VALID [2022-02-20 23:45:39,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {1745#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= |zalloc_or_die_#Ultimate.C_memset_#amount#1| (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|)) (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (select |#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)))) (= |zalloc_or_die_#Ultimate.C_memset_#ptr#1.offset| 0))} assume !(#Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset); {1729#false} is VALID [2022-02-20 23:45:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:39,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:39,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:39,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633260640] [2022-02-20 23:45:39,032 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:39,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501818586] [2022-02-20 23:45:39,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501818586] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:39,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:39,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:39,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530779222] [2022-02-20 23:45:39,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:39,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:45:39,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:39,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:39,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:39,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:39,045 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:39,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:39,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:39,046 INFO L87 Difference]: Start difference. First operand 188 states and 203 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:39,237 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2022-02-20 23:45:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:39,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:45:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:39,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2022-02-20 23:45:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2022-02-20 23:45:39,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 203 transitions. [2022-02-20 23:45:39,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:39,408 INFO L225 Difference]: With dead ends: 187 [2022-02-20 23:45:39,408 INFO L226 Difference]: Without dead ends: 187 [2022-02-20 23:45:39,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:39,409 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:39,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 60 Unchecked, 0.0s Time] [2022-02-20 23:45:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-02-20 23:45:39,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-02-20 23:45:39,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:39,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 187 states, 107 states have (on average 1.7757009345794392) internal successors, (190), 179 states have internal predecessors, (190), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:39,426 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 187 states, 107 states have (on average 1.7757009345794392) internal successors, (190), 179 states have internal predecessors, (190), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:39,427 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 187 states, 107 states have (on average 1.7757009345794392) internal successors, (190), 179 states have internal predecessors, (190), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:39,433 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2022-02-20 23:45:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 202 transitions. [2022-02-20 23:45:39,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:39,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:39,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 107 states have (on average 1.7757009345794392) internal successors, (190), 179 states have internal predecessors, (190), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 187 states. [2022-02-20 23:45:39,435 INFO L87 Difference]: Start difference. First operand has 187 states, 107 states have (on average 1.7757009345794392) internal successors, (190), 179 states have internal predecessors, (190), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 187 states. [2022-02-20 23:45:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:39,441 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2022-02-20 23:45:39,441 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 202 transitions. [2022-02-20 23:45:39,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:39,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:39,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:39,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 107 states have (on average 1.7757009345794392) internal successors, (190), 179 states have internal predecessors, (190), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 202 transitions. [2022-02-20 23:45:39,448 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 202 transitions. Word has length 7 [2022-02-20 23:45:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:39,448 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 202 transitions. [2022-02-20 23:45:39,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 202 transitions. [2022-02-20 23:45:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 23:45:39,450 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:39,450 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:39,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:39,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 23:45:39,664 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 71 more)] === [2022-02-20 23:45:39,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:39,664 INFO L85 PathProgramCache]: Analyzing trace with hash 508125098, now seen corresponding path program 1 times [2022-02-20 23:45:39,664 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:39,665 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529544854] [2022-02-20 23:45:39,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:39,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:39,706 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:39,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585268394] [2022-02-20 23:45:39,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:39,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:39,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:39,720 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:39,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:45:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:39,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:45:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:39,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:40,430 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:45:40,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:45:40,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {2499#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {2499#true} is VALID [2022-02-20 23:45:40,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {2499#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~mem32#1.base, main_#t~mem32#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {2499#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,447 INFO L272 TraceCheckUtils]: 3: Hoare triple {2499#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {2499#true} is VALID [2022-02-20 23:45:40,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {2499#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2499#true} is VALID [2022-02-20 23:45:40,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {2499#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2499#true} is VALID [2022-02-20 23:45:40,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {2499#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {2499#true} is VALID [2022-02-20 23:45:40,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {2499#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2499#true} is VALID [2022-02-20 23:45:40,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {2499#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {2499#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {2499#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {2499#true} assume true; {2499#true} is VALID [2022-02-20 23:45:40,450 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2499#true} {2499#true} #317#return; {2499#true} is VALID [2022-02-20 23:45:40,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {2499#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {2499#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,450 INFO L272 TraceCheckUtils]: 15: Hoare triple {2499#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {2499#true} is VALID [2022-02-20 23:45:40,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {2499#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2499#true} is VALID [2022-02-20 23:45:40,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {2499#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2499#true} is VALID [2022-02-20 23:45:40,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {2499#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {2499#true} is VALID [2022-02-20 23:45:40,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {2499#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2499#true} is VALID [2022-02-20 23:45:40,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {2499#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {2499#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {2499#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {2499#true} assume true; {2499#true} is VALID [2022-02-20 23:45:40,452 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2499#true} {2499#true} #319#return; {2499#true} is VALID [2022-02-20 23:45:40,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {2499#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {2499#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,453 INFO L272 TraceCheckUtils]: 27: Hoare triple {2499#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {2499#true} is VALID [2022-02-20 23:45:40,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {2499#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2499#true} is VALID [2022-02-20 23:45:40,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {2499#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2499#true} is VALID [2022-02-20 23:45:40,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {2499#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {2499#true} is VALID [2022-02-20 23:45:40,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {2499#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2499#true} is VALID [2022-02-20 23:45:40,454 INFO L290 TraceCheckUtils]: 32: Hoare triple {2499#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,454 INFO L290 TraceCheckUtils]: 33: Hoare triple {2499#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {2499#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {2499#true} assume true; {2499#true} is VALID [2022-02-20 23:45:40,455 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2499#true} {2499#true} #321#return; {2499#true} is VALID [2022-02-20 23:45:40,455 INFO L290 TraceCheckUtils]: 37: Hoare triple {2499#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {2499#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,456 INFO L272 TraceCheckUtils]: 39: Hoare triple {2499#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {2499#true} is VALID [2022-02-20 23:45:40,456 INFO L290 TraceCheckUtils]: 40: Hoare triple {2499#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2499#true} is VALID [2022-02-20 23:45:40,456 INFO L290 TraceCheckUtils]: 41: Hoare triple {2499#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2499#true} is VALID [2022-02-20 23:45:40,456 INFO L290 TraceCheckUtils]: 42: Hoare triple {2499#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {2499#true} is VALID [2022-02-20 23:45:40,457 INFO L290 TraceCheckUtils]: 43: Hoare triple {2499#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2499#true} is VALID [2022-02-20 23:45:40,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {2499#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {2499#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,457 INFO L290 TraceCheckUtils]: 46: Hoare triple {2499#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,457 INFO L290 TraceCheckUtils]: 47: Hoare triple {2499#true} assume true; {2499#true} is VALID [2022-02-20 23:45:40,458 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2499#true} {2499#true} #323#return; {2499#true} is VALID [2022-02-20 23:45:40,458 INFO L290 TraceCheckUtils]: 49: Hoare triple {2499#true} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,458 INFO L290 TraceCheckUtils]: 50: Hoare triple {2499#true} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {2499#true} is VALID [2022-02-20 23:45:40,458 INFO L272 TraceCheckUtils]: 51: Hoare triple {2499#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {2499#true} is VALID [2022-02-20 23:45:40,459 INFO L290 TraceCheckUtils]: 52: Hoare triple {2499#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2660#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:45:40,460 INFO L290 TraceCheckUtils]: 53: Hoare triple {2660#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2664#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:40,460 INFO L290 TraceCheckUtils]: 54: Hoare triple {2664#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {2664#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:40,460 INFO L290 TraceCheckUtils]: 55: Hoare triple {2664#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2664#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:40,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {2664#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2674#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:40,461 INFO L290 TraceCheckUtils]: 57: Hoare triple {2674#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2678#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:45:40,462 INFO L290 TraceCheckUtils]: 58: Hoare triple {2678#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2682#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:40,465 INFO L290 TraceCheckUtils]: 59: Hoare triple {2682#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {2682#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:40,465 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2682#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {2499#true} #325#return; {2689#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:45:40,467 INFO L290 TraceCheckUtils]: 61: Hoare triple {2689#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {2693#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:40,468 INFO L272 TraceCheckUtils]: 62: Hoare triple {2693#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {2697#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:45:40,469 INFO L290 TraceCheckUtils]: 63: Hoare triple {2697#(= |old(#valid)| |#valid|)} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2701#(exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35)))} is VALID [2022-02-20 23:45:40,470 INFO L290 TraceCheckUtils]: 64: Hoare triple {2701#(exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2705#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:40,470 INFO L290 TraceCheckUtils]: 65: Hoare triple {2705#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {2705#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:40,472 INFO L290 TraceCheckUtils]: 66: Hoare triple {2705#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2705#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:40,472 INFO L290 TraceCheckUtils]: 67: Hoare triple {2705#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2705#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:40,475 INFO L290 TraceCheckUtils]: 68: Hoare triple {2705#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2705#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:40,476 INFO L290 TraceCheckUtils]: 69: Hoare triple {2705#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2705#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:40,476 INFO L290 TraceCheckUtils]: 70: Hoare triple {2705#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {2705#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:45:40,477 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {2705#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_35 Int)) (= |#valid| (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_35))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {2693#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #327#return; {2693#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:40,478 INFO L290 TraceCheckUtils]: 72: Hoare triple {2693#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {2500#false} is VALID [2022-02-20 23:45:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 69 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-02-20 23:45:40,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:45:40,983 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:45:40,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-02-20 23:45:41,137 INFO L290 TraceCheckUtils]: 72: Hoare triple {2693#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {2500#false} is VALID [2022-02-20 23:45:41,139 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} {2693#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #327#return; {2693#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:41,140 INFO L290 TraceCheckUtils]: 70: Hoare triple {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} assume true; {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:41,140 INFO L290 TraceCheckUtils]: 69: Hoare triple {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:41,141 INFO L290 TraceCheckUtils]: 68: Hoare triple {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:41,141 INFO L290 TraceCheckUtils]: 67: Hoare triple {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:41,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:41,142 INFO L290 TraceCheckUtils]: 65: Hoare triple {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:41,143 INFO L290 TraceCheckUtils]: 64: Hoare triple {2758#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:41,145 INFO L290 TraceCheckUtils]: 63: Hoare triple {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2758#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1))))} is VALID [2022-02-20 23:45:41,145 INFO L272 TraceCheckUtils]: 62: Hoare triple {2693#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {2736#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_2|) 1)))} is VALID [2022-02-20 23:45:41,146 INFO L290 TraceCheckUtils]: 61: Hoare triple {2689#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {2693#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:41,146 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {2682#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {2499#true} #325#return; {2689#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:45:41,147 INFO L290 TraceCheckUtils]: 59: Hoare triple {2682#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {2682#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:41,149 INFO L290 TraceCheckUtils]: 58: Hoare triple {2678#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2682#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:41,150 INFO L290 TraceCheckUtils]: 57: Hoare triple {2674#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2678#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:45:41,150 INFO L290 TraceCheckUtils]: 56: Hoare triple {2664#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2674#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:41,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {2664#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2664#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:41,151 INFO L290 TraceCheckUtils]: 54: Hoare triple {2664#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {2664#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:41,151 INFO L290 TraceCheckUtils]: 53: Hoare triple {2660#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2664#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:41,152 INFO L290 TraceCheckUtils]: 52: Hoare triple {2499#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2660#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:45:41,155 INFO L272 TraceCheckUtils]: 51: Hoare triple {2499#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {2499#true} is VALID [2022-02-20 23:45:41,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {2499#true} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {2499#true} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,156 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2499#true} {2499#true} #323#return; {2499#true} is VALID [2022-02-20 23:45:41,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {2499#true} assume true; {2499#true} is VALID [2022-02-20 23:45:41,156 INFO L290 TraceCheckUtils]: 46: Hoare triple {2499#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,156 INFO L290 TraceCheckUtils]: 45: Hoare triple {2499#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,157 INFO L290 TraceCheckUtils]: 44: Hoare triple {2499#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {2499#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2499#true} is VALID [2022-02-20 23:45:41,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {2499#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {2499#true} is VALID [2022-02-20 23:45:41,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {2499#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2499#true} is VALID [2022-02-20 23:45:41,157 INFO L290 TraceCheckUtils]: 40: Hoare triple {2499#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2499#true} is VALID [2022-02-20 23:45:41,158 INFO L272 TraceCheckUtils]: 39: Hoare triple {2499#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {2499#true} is VALID [2022-02-20 23:45:41,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {2499#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,158 INFO L290 TraceCheckUtils]: 37: Hoare triple {2499#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,158 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2499#true} {2499#true} #321#return; {2499#true} is VALID [2022-02-20 23:45:41,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {2499#true} assume true; {2499#true} is VALID [2022-02-20 23:45:41,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {2499#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {2499#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {2499#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {2499#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2499#true} is VALID [2022-02-20 23:45:41,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {2499#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {2499#true} is VALID [2022-02-20 23:45:41,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {2499#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2499#true} is VALID [2022-02-20 23:45:41,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {2499#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2499#true} is VALID [2022-02-20 23:45:41,160 INFO L272 TraceCheckUtils]: 27: Hoare triple {2499#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {2499#true} is VALID [2022-02-20 23:45:41,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {2499#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {2499#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,160 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2499#true} {2499#true} #319#return; {2499#true} is VALID [2022-02-20 23:45:41,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {2499#true} assume true; {2499#true} is VALID [2022-02-20 23:45:41,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {2499#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {2499#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {2499#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {2499#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2499#true} is VALID [2022-02-20 23:45:41,162 INFO L290 TraceCheckUtils]: 18: Hoare triple {2499#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {2499#true} is VALID [2022-02-20 23:45:41,162 INFO L290 TraceCheckUtils]: 17: Hoare triple {2499#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2499#true} is VALID [2022-02-20 23:45:41,162 INFO L290 TraceCheckUtils]: 16: Hoare triple {2499#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2499#true} is VALID [2022-02-20 23:45:41,162 INFO L272 TraceCheckUtils]: 15: Hoare triple {2499#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {2499#true} is VALID [2022-02-20 23:45:41,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {2499#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {2499#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,163 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2499#true} {2499#true} #317#return; {2499#true} is VALID [2022-02-20 23:45:41,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {2499#true} assume true; {2499#true} is VALID [2022-02-20 23:45:41,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {2499#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {2499#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {2499#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {2499#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2499#true} is VALID [2022-02-20 23:45:41,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {2499#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {2499#true} is VALID [2022-02-20 23:45:41,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {2499#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2499#true} is VALID [2022-02-20 23:45:41,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {2499#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {2499#true} is VALID [2022-02-20 23:45:41,167 INFO L272 TraceCheckUtils]: 3: Hoare triple {2499#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {2499#true} is VALID [2022-02-20 23:45:41,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {2499#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {2499#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~mem32#1.base, main_#t~mem32#1.offset; {2499#true} is VALID [2022-02-20 23:45:41,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {2499#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {2499#true} is VALID [2022-02-20 23:45:41,168 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 69 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-02-20 23:45:41,168 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:41,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529544854] [2022-02-20 23:45:41,173 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:41,173 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585268394] [2022-02-20 23:45:41,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585268394] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:45:41,173 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:45:41,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2022-02-20 23:45:41,173 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415532963] [2022-02-20 23:45:41,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:45:41,175 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2022-02-20 23:45:41,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:41,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:45:41,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:41,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:45:41,226 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:41,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:45:41,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:45:41,227 INFO L87 Difference]: Start difference. First operand 187 states and 202 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:45:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:50,876 INFO L93 Difference]: Finished difference Result 228 states and 247 transitions. [2022-02-20 23:45:50,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:45:50,877 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2022-02-20 23:45:50,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:45:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 249 transitions. [2022-02-20 23:45:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:45:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 249 transitions. [2022-02-20 23:45:50,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 249 transitions. [2022-02-20 23:45:51,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:51,082 INFO L225 Difference]: With dead ends: 228 [2022-02-20 23:45:51,082 INFO L226 Difference]: Without dead ends: 228 [2022-02-20 23:45:51,082 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 131 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:45:51,083 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 129 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:51,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 1229 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 608 Invalid, 0 Unknown, 243 Unchecked, 0.4s Time] [2022-02-20 23:45:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-02-20 23:45:51,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 194. [2022-02-20 23:45:51,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:51,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 194 states, 115 states have (on average 1.7130434782608697) internal successors, (197), 185 states have internal predecessors, (197), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:51,091 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 194 states, 115 states have (on average 1.7130434782608697) internal successors, (197), 185 states have internal predecessors, (197), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:51,092 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 194 states, 115 states have (on average 1.7130434782608697) internal successors, (197), 185 states have internal predecessors, (197), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:51,098 INFO L93 Difference]: Finished difference Result 228 states and 247 transitions. [2022-02-20 23:45:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 247 transitions. [2022-02-20 23:45:51,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:51,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:51,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 115 states have (on average 1.7130434782608697) internal successors, (197), 185 states have internal predecessors, (197), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 228 states. [2022-02-20 23:45:51,100 INFO L87 Difference]: Start difference. First operand has 194 states, 115 states have (on average 1.7130434782608697) internal successors, (197), 185 states have internal predecessors, (197), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 228 states. [2022-02-20 23:45:51,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:51,106 INFO L93 Difference]: Finished difference Result 228 states and 247 transitions. [2022-02-20 23:45:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 247 transitions. [2022-02-20 23:45:51,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:51,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:51,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:51,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 115 states have (on average 1.7130434782608697) internal successors, (197), 185 states have internal predecessors, (197), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:45:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 209 transitions. [2022-02-20 23:45:51,113 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 209 transitions. Word has length 73 [2022-02-20 23:45:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:51,113 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 209 transitions. [2022-02-20 23:45:51,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:45:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 209 transitions. [2022-02-20 23:45:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 23:45:51,115 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:51,115 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:51,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 23:45:51,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:51,330 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 71 more)] === [2022-02-20 23:45:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:51,331 INFO L85 PathProgramCache]: Analyzing trace with hash 508125099, now seen corresponding path program 1 times [2022-02-20 23:45:51,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:51,331 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228238373] [2022-02-20 23:45:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:51,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:51,358 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:51,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625947118] [2022-02-20 23:45:51,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:51,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:51,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:51,360 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 23:45:51,376 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 23:45:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:51,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 53 conjunts are in the unsatisfiable core [2022-02-20 23:45:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:51,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:51,686 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 8 treesize of output 7 [2022-02-20 23:46:00,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:00,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-02-20 23:46:00,735 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:46:00,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:46:00,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {3845#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {3845#true} is VALID [2022-02-20 23:46:00,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {3845#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~mem32#1.base, main_#t~mem32#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {3845#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,813 INFO L272 TraceCheckUtils]: 3: Hoare triple {3845#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {3845#true} is VALID [2022-02-20 23:46:00,813 INFO L290 TraceCheckUtils]: 4: Hoare triple {3845#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {3845#true} is VALID [2022-02-20 23:46:00,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {3845#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3845#true} is VALID [2022-02-20 23:46:00,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {3845#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {3845#true} is VALID [2022-02-20 23:46:00,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {3845#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3845#true} is VALID [2022-02-20 23:46:00,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {3845#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {3845#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {3845#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {3845#true} assume true; {3845#true} is VALID [2022-02-20 23:46:00,815 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3845#true} {3845#true} #317#return; {3845#true} is VALID [2022-02-20 23:46:00,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {3845#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {3845#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,815 INFO L272 TraceCheckUtils]: 15: Hoare triple {3845#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {3845#true} is VALID [2022-02-20 23:46:00,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {3845#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {3845#true} is VALID [2022-02-20 23:46:00,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {3845#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3845#true} is VALID [2022-02-20 23:46:00,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {3845#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {3845#true} is VALID [2022-02-20 23:46:00,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {3845#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3845#true} is VALID [2022-02-20 23:46:00,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {3845#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {3845#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {3845#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {3845#true} assume true; {3845#true} is VALID [2022-02-20 23:46:00,816 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3845#true} {3845#true} #319#return; {3845#true} is VALID [2022-02-20 23:46:00,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {3845#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {3845#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,816 INFO L272 TraceCheckUtils]: 27: Hoare triple {3845#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {3845#true} is VALID [2022-02-20 23:46:00,817 INFO L290 TraceCheckUtils]: 28: Hoare triple {3845#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {3845#true} is VALID [2022-02-20 23:46:00,817 INFO L290 TraceCheckUtils]: 29: Hoare triple {3845#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3845#true} is VALID [2022-02-20 23:46:00,817 INFO L290 TraceCheckUtils]: 30: Hoare triple {3845#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {3845#true} is VALID [2022-02-20 23:46:00,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {3845#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3845#true} is VALID [2022-02-20 23:46:00,818 INFO L290 TraceCheckUtils]: 32: Hoare triple {3845#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,818 INFO L290 TraceCheckUtils]: 33: Hoare triple {3845#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,818 INFO L290 TraceCheckUtils]: 34: Hoare triple {3845#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,818 INFO L290 TraceCheckUtils]: 35: Hoare triple {3845#true} assume true; {3845#true} is VALID [2022-02-20 23:46:00,818 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3845#true} {3845#true} #321#return; {3845#true} is VALID [2022-02-20 23:46:00,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {3845#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,819 INFO L290 TraceCheckUtils]: 38: Hoare triple {3845#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,819 INFO L272 TraceCheckUtils]: 39: Hoare triple {3845#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {3845#true} is VALID [2022-02-20 23:46:00,819 INFO L290 TraceCheckUtils]: 40: Hoare triple {3845#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {3845#true} is VALID [2022-02-20 23:46:00,819 INFO L290 TraceCheckUtils]: 41: Hoare triple {3845#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3845#true} is VALID [2022-02-20 23:46:00,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {3845#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {3845#true} is VALID [2022-02-20 23:46:00,820 INFO L290 TraceCheckUtils]: 43: Hoare triple {3845#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3845#true} is VALID [2022-02-20 23:46:00,820 INFO L290 TraceCheckUtils]: 44: Hoare triple {3845#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {3845#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {3845#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {3845#true} assume true; {3845#true} is VALID [2022-02-20 23:46:00,820 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3845#true} {3845#true} #323#return; {3845#true} is VALID [2022-02-20 23:46:00,821 INFO L290 TraceCheckUtils]: 49: Hoare triple {3845#true} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,821 INFO L290 TraceCheckUtils]: 50: Hoare triple {3845#true} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {3845#true} is VALID [2022-02-20 23:46:00,821 INFO L272 TraceCheckUtils]: 51: Hoare triple {3845#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {3845#true} is VALID [2022-02-20 23:46:00,825 INFO L290 TraceCheckUtils]: 52: Hoare triple {3845#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4006#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} is VALID [2022-02-20 23:46:00,826 INFO L290 TraceCheckUtils]: 53: Hoare triple {4006#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4010#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} is VALID [2022-02-20 23:46:00,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {4010#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {4010#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} is VALID [2022-02-20 23:46:00,828 INFO L290 TraceCheckUtils]: 55: Hoare triple {4010#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4010#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} is VALID [2022-02-20 23:46:00,829 INFO L290 TraceCheckUtils]: 56: Hoare triple {4010#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4020#(and (= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1) (= |zalloc_or_die_calloc_model_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) |zalloc_or_die_#in~size#1|) 0) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) |zalloc_or_die_#in~size#1|)))))} is VALID [2022-02-20 23:46:00,830 INFO L290 TraceCheckUtils]: 57: Hoare triple {4020#(and (= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1) (= |zalloc_or_die_calloc_model_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) |zalloc_or_die_#in~size#1|) 0) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) |zalloc_or_die_#in~size#1|)))))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4024#(and (= |zalloc_or_die_~ptr~1#1.offset| 0) (or (and (= (mod (select |#length| |zalloc_or_die_~ptr~1#1.base|) |zalloc_or_die_#in~size#1|) 0) (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_~ptr~1#1.base|) |zalloc_or_die_#in~size#1|))) (and (= (select |#length| |zalloc_or_die_~ptr~1#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0))) (= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1))} is VALID [2022-02-20 23:46:00,832 INFO L290 TraceCheckUtils]: 58: Hoare triple {4024#(and (= |zalloc_or_die_~ptr~1#1.offset| 0) (or (and (= (mod (select |#length| |zalloc_or_die_~ptr~1#1.base|) |zalloc_or_die_#in~size#1|) 0) (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_~ptr~1#1.base|) |zalloc_or_die_#in~size#1|))) (and (= (select |#length| |zalloc_or_die_~ptr~1#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0))) (= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4028#(and (= |zalloc_or_die_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (<= 1 (div (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|)) (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|) 0))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} is VALID [2022-02-20 23:46:00,833 INFO L290 TraceCheckUtils]: 59: Hoare triple {4028#(and (= |zalloc_or_die_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (<= 1 (div (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|)) (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|) 0))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} assume true; {4028#(and (= |zalloc_or_die_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (<= 1 (div (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|)) (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|) 0))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} is VALID [2022-02-20 23:46:00,834 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4028#(and (= |zalloc_or_die_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (<= 1 (div (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|)) (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|) 0))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} {3845#true} #325#return; {4035#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_17| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) (= (mod (select |#length| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|)))) (= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1) (= |ULTIMATE.start_l4_insert_#t~ret6#1.offset| 0))} is VALID [2022-02-20 23:46:00,835 INFO L290 TraceCheckUtils]: 61: Hoare triple {4035#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_17| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) (= (mod (select |#length| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|)))) (= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1) (= |ULTIMATE.start_l4_insert_#t~ret6#1.offset| 0))} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {4039#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_17| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) 0))) (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:00,836 INFO L272 TraceCheckUtils]: 62: Hoare triple {4039#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_17| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) 0))) (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {4043#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:46:00,837 INFO L290 TraceCheckUtils]: 63: Hoare triple {4043#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:46:00,838 INFO L290 TraceCheckUtils]: 64: Hoare triple {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:46:00,839 INFO L290 TraceCheckUtils]: 65: Hoare triple {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:46:00,840 INFO L290 TraceCheckUtils]: 66: Hoare triple {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:46:00,841 INFO L290 TraceCheckUtils]: 67: Hoare triple {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:46:00,841 INFO L290 TraceCheckUtils]: 68: Hoare triple {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:46:00,842 INFO L290 TraceCheckUtils]: 69: Hoare triple {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:46:00,843 INFO L290 TraceCheckUtils]: 70: Hoare triple {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} assume true; {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} is VALID [2022-02-20 23:46:00,847 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4047#(exists ((v_ArrVal_64 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_64) |#length|)))} {4039#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_17| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) 0))) (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1))} #327#return; {4072#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_17| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) 0))) (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0))} is VALID [2022-02-20 23:46:00,849 INFO L290 TraceCheckUtils]: 72: Hoare triple {4072#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_17| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_17|) 0))) (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0))} assume !(4 + (4 + l4_insert_~item~0#1.offset) <= #length[l4_insert_~item~0#1.base] && 0 <= 4 + l4_insert_~item~0#1.offset); {3846#false} is VALID [2022-02-20 23:46:00,849 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 69 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-02-20 23:46:00,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:01,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:01,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228238373] [2022-02-20 23:46:01,051 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:01,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625947118] [2022-02-20 23:46:01,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625947118] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:46:01,051 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:46:01,052 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 23:46:01,052 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494655519] [2022-02-20 23:46:01,052 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:01,052 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-02-20 23:46:01,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:01,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:01,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:01,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:46:01,115 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:01,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:46:01,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:46:01,116 INFO L87 Difference]: Start difference. First operand 194 states and 209 transitions. Second operand has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:03,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:03,453 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2022-02-20 23:46:03,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:46:03,453 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-02-20 23:46:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2022-02-20 23:46:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions. [2022-02-20 23:46:03,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 200 transitions. [2022-02-20 23:46:03,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:03,633 INFO L225 Difference]: With dead ends: 193 [2022-02-20 23:46:03,633 INFO L226 Difference]: Without dead ends: 193 [2022-02-20 23:46:03,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:46:03,634 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 2 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:03,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 1086 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 543 Invalid, 0 Unknown, 229 Unchecked, 0.6s Time] [2022-02-20 23:46:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-02-20 23:46:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2022-02-20 23:46:03,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:03,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 193 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 184 states have internal predecessors, (196), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:46:03,645 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 193 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 184 states have internal predecessors, (196), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:46:03,645 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 193 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 184 states have internal predecessors, (196), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:46:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:03,650 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2022-02-20 23:46:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 208 transitions. [2022-02-20 23:46:03,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:03,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:03,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 184 states have internal predecessors, (196), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 193 states. [2022-02-20 23:46:03,652 INFO L87 Difference]: Start difference. First operand has 193 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 184 states have internal predecessors, (196), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 193 states. [2022-02-20 23:46:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:03,657 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2022-02-20 23:46:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 208 transitions. [2022-02-20 23:46:03,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:03,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:03,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:03,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 184 states have internal predecessors, (196), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 23:46:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 208 transitions. [2022-02-20 23:46:03,662 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 208 transitions. Word has length 73 [2022-02-20 23:46:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:03,662 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 208 transitions. [2022-02-20 23:46:03,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 208 transitions. [2022-02-20 23:46:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 23:46:03,663 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:03,663 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:03,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:03,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:03,864 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 71 more)] === [2022-02-20 23:46:03,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:03,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1318052341, now seen corresponding path program 1 times [2022-02-20 23:46:03,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:03,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080084996] [2022-02-20 23:46:03,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:03,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:03,887 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:03,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1107897656] [2022-02-20 23:46:03,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:03,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:03,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:03,889 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:46:03,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:46:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:04,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:46:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:04,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:04,513 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:04,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:46:04,766 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:04,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:46:04,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {4866#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {4866#true} is VALID [2022-02-20 23:46:04,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {4866#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~mem32#1.base, main_#t~mem32#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {4866#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,792 INFO L272 TraceCheckUtils]: 3: Hoare triple {4866#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {4866#true} is VALID [2022-02-20 23:46:04,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {4866#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4866#true} is VALID [2022-02-20 23:46:04,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {4866#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4866#true} is VALID [2022-02-20 23:46:04,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {4866#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {4866#true} is VALID [2022-02-20 23:46:04,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {4866#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4866#true} is VALID [2022-02-20 23:46:04,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {4866#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {4866#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {4866#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-02-20 23:46:04,799 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4866#true} {4866#true} #317#return; {4866#true} is VALID [2022-02-20 23:46:04,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {4866#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {4866#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,801 INFO L272 TraceCheckUtils]: 15: Hoare triple {4866#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {4866#true} is VALID [2022-02-20 23:46:04,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {4866#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4866#true} is VALID [2022-02-20 23:46:04,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {4866#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4866#true} is VALID [2022-02-20 23:46:04,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {4866#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {4866#true} is VALID [2022-02-20 23:46:04,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {4866#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4866#true} is VALID [2022-02-20 23:46:04,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {4866#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {4866#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {4866#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-02-20 23:46:04,807 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4866#true} {4866#true} #319#return; {4866#true} is VALID [2022-02-20 23:46:04,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {4866#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {4866#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,807 INFO L272 TraceCheckUtils]: 27: Hoare triple {4866#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {4866#true} is VALID [2022-02-20 23:46:04,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {4866#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4866#true} is VALID [2022-02-20 23:46:04,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {4866#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4866#true} is VALID [2022-02-20 23:46:04,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {4866#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {4866#true} is VALID [2022-02-20 23:46:04,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {4866#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4866#true} is VALID [2022-02-20 23:46:04,809 INFO L290 TraceCheckUtils]: 32: Hoare triple {4866#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {4866#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {4866#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-02-20 23:46:04,809 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4866#true} {4866#true} #321#return; {4866#true} is VALID [2022-02-20 23:46:04,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {4866#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {4866#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {4866#true} is VALID [2022-02-20 23:46:04,810 INFO L272 TraceCheckUtils]: 39: Hoare triple {4866#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {4866#true} is VALID [2022-02-20 23:46:04,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {4866#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4991#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:46:04,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {4991#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4995#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:04,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {4995#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {4995#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:04,812 INFO L290 TraceCheckUtils]: 43: Hoare triple {4995#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4995#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:04,813 INFO L290 TraceCheckUtils]: 44: Hoare triple {4995#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {5005#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:04,813 INFO L290 TraceCheckUtils]: 45: Hoare triple {5005#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {5009#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:04,813 INFO L290 TraceCheckUtils]: 46: Hoare triple {5009#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {5013#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:04,814 INFO L290 TraceCheckUtils]: 47: Hoare triple {5013#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {5013#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:04,815 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5013#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {4866#true} #323#return; {5020#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} is VALID [2022-02-20 23:46:04,815 INFO L290 TraceCheckUtils]: 49: Hoare triple {5020#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {5024#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:46:04,816 INFO L290 TraceCheckUtils]: 50: Hoare triple {5024#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:04,816 INFO L272 TraceCheckUtils]: 51: Hoare triple {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {5032#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:04,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {5032#(= |old(#valid)| |#valid|)} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {5036#(exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|))} is VALID [2022-02-20 23:46:04,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {5036#(exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:04,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:04,820 INFO L290 TraceCheckUtils]: 55: Hoare triple {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:04,820 INFO L290 TraceCheckUtils]: 56: Hoare triple {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:04,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:04,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:04,822 INFO L290 TraceCheckUtils]: 59: Hoare triple {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:04,824 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #325#return; {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:04,824 INFO L290 TraceCheckUtils]: 61: Hoare triple {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:04,825 INFO L272 TraceCheckUtils]: 62: Hoare triple {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {5032#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:04,826 INFO L290 TraceCheckUtils]: 63: Hoare triple {5032#(= |old(#valid)| |#valid|)} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {5036#(exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|))} is VALID [2022-02-20 23:46:04,827 INFO L290 TraceCheckUtils]: 64: Hoare triple {5036#(exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:04,827 INFO L290 TraceCheckUtils]: 65: Hoare triple {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:04,828 INFO L290 TraceCheckUtils]: 66: Hoare triple {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:04,829 INFO L290 TraceCheckUtils]: 67: Hoare triple {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:04,830 INFO L290 TraceCheckUtils]: 68: Hoare triple {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:04,831 INFO L290 TraceCheckUtils]: 69: Hoare triple {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:04,831 INFO L290 TraceCheckUtils]: 70: Hoare triple {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:04,832 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5040#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_104 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_104) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #327#return; {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:04,833 INFO L290 TraceCheckUtils]: 72: Hoare triple {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} SUMMARY for call write~$Pointer$(l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_~item~0#1.base, 4 + l4_insert_~item~0#1.offset, 4); srcloc: L675-1 {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:04,833 INFO L290 TraceCheckUtils]: 73: Hoare triple {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:04,834 INFO L290 TraceCheckUtils]: 74: Hoare triple {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} assume !(1 == #valid[l4_insert_~list#1.base]); {4867#false} is VALID [2022-02-20 23:46:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 80 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-20 23:46:04,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:05,587 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:46:05,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-02-20 23:46:05,693 INFO L290 TraceCheckUtils]: 74: Hoare triple {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} assume !(1 == #valid[l4_insert_~list#1.base]); {4867#false} is VALID [2022-02-20 23:46:05,694 INFO L290 TraceCheckUtils]: 73: Hoare triple {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:05,694 INFO L290 TraceCheckUtils]: 72: Hoare triple {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} SUMMARY for call write~$Pointer$(l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_~item~0#1.base, 4 + l4_insert_~item~0#1.offset, 4); srcloc: L675-1 {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:05,695 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #327#return; {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:05,696 INFO L290 TraceCheckUtils]: 70: Hoare triple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume true; {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,696 INFO L290 TraceCheckUtils]: 69: Hoare triple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,696 INFO L290 TraceCheckUtils]: 68: Hoare triple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,697 INFO L290 TraceCheckUtils]: 67: Hoare triple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,697 INFO L290 TraceCheckUtils]: 66: Hoare triple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,698 INFO L290 TraceCheckUtils]: 65: Hoare triple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,698 INFO L290 TraceCheckUtils]: 64: Hoare triple {5138#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1)))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,700 INFO L290 TraceCheckUtils]: 63: Hoare triple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {5138#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1)))))} is VALID [2022-02-20 23:46:05,701 INFO L272 TraceCheckUtils]: 62: Hoare triple {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,701 INFO L290 TraceCheckUtils]: 61: Hoare triple {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:05,703 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #325#return; {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:05,707 INFO L290 TraceCheckUtils]: 59: Hoare triple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume true; {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,708 INFO L290 TraceCheckUtils]: 56: Hoare triple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,708 INFO L290 TraceCheckUtils]: 55: Hoare triple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,709 INFO L290 TraceCheckUtils]: 54: Hoare triple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,709 INFO L290 TraceCheckUtils]: 53: Hoare triple {5138#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1)))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,716 INFO L290 TraceCheckUtils]: 52: Hoare triple {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {5138#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1)))))} is VALID [2022-02-20 23:46:05,717 INFO L272 TraceCheckUtils]: 51: Hoare triple {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {5116#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_3|) 1))))} is VALID [2022-02-20 23:46:05,717 INFO L290 TraceCheckUtils]: 50: Hoare triple {5024#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {5028#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:05,718 INFO L290 TraceCheckUtils]: 49: Hoare triple {5020#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {5024#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:46:05,719 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5013#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {4866#true} #323#return; {5020#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} is VALID [2022-02-20 23:46:05,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {5013#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {5013#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:05,720 INFO L290 TraceCheckUtils]: 46: Hoare triple {5009#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {5013#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:05,720 INFO L290 TraceCheckUtils]: 45: Hoare triple {5005#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {5009#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:05,720 INFO L290 TraceCheckUtils]: 44: Hoare triple {4995#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {5005#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:05,721 INFO L290 TraceCheckUtils]: 43: Hoare triple {4995#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4995#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:05,721 INFO L290 TraceCheckUtils]: 42: Hoare triple {4995#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {4995#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:05,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {4991#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4995#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:05,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {4866#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4991#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:46:05,722 INFO L272 TraceCheckUtils]: 39: Hoare triple {4866#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {4866#true} is VALID [2022-02-20 23:46:05,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {4866#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,723 INFO L290 TraceCheckUtils]: 37: Hoare triple {4866#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,723 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4866#true} {4866#true} #321#return; {4866#true} is VALID [2022-02-20 23:46:05,723 INFO L290 TraceCheckUtils]: 35: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-02-20 23:46:05,723 INFO L290 TraceCheckUtils]: 34: Hoare triple {4866#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {4866#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {4866#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {4866#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4866#true} is VALID [2022-02-20 23:46:05,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {4866#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {4866#true} is VALID [2022-02-20 23:46:05,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {4866#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4866#true} is VALID [2022-02-20 23:46:05,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {4866#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4866#true} is VALID [2022-02-20 23:46:05,724 INFO L272 TraceCheckUtils]: 27: Hoare triple {4866#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {4866#true} is VALID [2022-02-20 23:46:05,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {4866#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,725 INFO L290 TraceCheckUtils]: 25: Hoare triple {4866#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,725 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4866#true} {4866#true} #319#return; {4866#true} is VALID [2022-02-20 23:46:05,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-02-20 23:46:05,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {4866#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {4866#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {4866#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {4866#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4866#true} is VALID [2022-02-20 23:46:05,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {4866#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {4866#true} is VALID [2022-02-20 23:46:05,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {4866#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4866#true} is VALID [2022-02-20 23:46:05,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {4866#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4866#true} is VALID [2022-02-20 23:46:05,730 INFO L272 TraceCheckUtils]: 15: Hoare triple {4866#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {4866#true} is VALID [2022-02-20 23:46:05,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {4866#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {4866#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,731 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4866#true} {4866#true} #317#return; {4866#true} is VALID [2022-02-20 23:46:05,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {4866#true} assume true; {4866#true} is VALID [2022-02-20 23:46:05,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {4866#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {4866#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {4866#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {4866#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4866#true} is VALID [2022-02-20 23:46:05,732 INFO L290 TraceCheckUtils]: 6: Hoare triple {4866#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {4866#true} is VALID [2022-02-20 23:46:05,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {4866#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4866#true} is VALID [2022-02-20 23:46:05,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {4866#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {4866#true} is VALID [2022-02-20 23:46:05,733 INFO L272 TraceCheckUtils]: 3: Hoare triple {4866#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {4866#true} is VALID [2022-02-20 23:46:05,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {4866#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {4866#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~mem32#1.base, main_#t~mem32#1.offset; {4866#true} is VALID [2022-02-20 23:46:05,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {4866#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {4866#true} is VALID [2022-02-20 23:46:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 80 proven. 16 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-02-20 23:46:05,736 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:05,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080084996] [2022-02-20 23:46:05,736 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:05,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107897656] [2022-02-20 23:46:05,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107897656] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:46:05,736 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:46:05,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2022-02-20 23:46:05,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730596824] [2022-02-20 23:46:05,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:05,738 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2022-02-20 23:46:05,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:05,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:05,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:05,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:46:05,807 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:05,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:46:05,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:46:05,809 INFO L87 Difference]: Start difference. First operand 193 states and 208 transitions. Second operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:17,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:17,937 INFO L93 Difference]: Finished difference Result 251 states and 274 transitions. [2022-02-20 23:46:17,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:46:17,937 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2022-02-20 23:46:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 258 transitions. [2022-02-20 23:46:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 258 transitions. [2022-02-20 23:46:17,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 258 transitions. [2022-02-20 23:46:18,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:18,148 INFO L225 Difference]: With dead ends: 251 [2022-02-20 23:46:18,148 INFO L226 Difference]: Without dead ends: 251 [2022-02-20 23:46:18,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 131 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:46:18,149 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 201 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:18,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 1519 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 692 Invalid, 0 Unknown, 222 Unchecked, 0.5s Time] [2022-02-20 23:46:18,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-02-20 23:46:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 217. [2022-02-20 23:46:18,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:18,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 217 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 204 states have internal predecessors, (219), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-20 23:46:18,157 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 217 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 204 states have internal predecessors, (219), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-20 23:46:18,157 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 217 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 204 states have internal predecessors, (219), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-20 23:46:18,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:18,164 INFO L93 Difference]: Finished difference Result 251 states and 274 transitions. [2022-02-20 23:46:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 274 transitions. [2022-02-20 23:46:18,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:18,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:18,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 204 states have internal predecessors, (219), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Second operand 251 states. [2022-02-20 23:46:18,166 INFO L87 Difference]: Start difference. First operand has 217 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 204 states have internal predecessors, (219), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) Second operand 251 states. [2022-02-20 23:46:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:18,174 INFO L93 Difference]: Finished difference Result 251 states and 274 transitions. [2022-02-20 23:46:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 274 transitions. [2022-02-20 23:46:18,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:18,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:18,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:18,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 204 states have internal predecessors, (219), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2022-02-20 23:46:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 237 transitions. [2022-02-20 23:46:18,181 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 237 transitions. Word has length 75 [2022-02-20 23:46:18,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:18,182 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 237 transitions. [2022-02-20 23:46:18,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.357142857142857) internal successors, (47), 13 states have internal predecessors, (47), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 237 transitions. [2022-02-20 23:46:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 23:46:18,184 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:18,184 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:18,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:18,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:18,391 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 71 more)] === [2022-02-20 23:46:18,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:18,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1318052340, now seen corresponding path program 1 times [2022-02-20 23:46:18,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:18,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799034433] [2022-02-20 23:46:18,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:18,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:18,431 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:18,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [671880067] [2022-02-20 23:46:18,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:18,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:18,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:18,449 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:46:18,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:46:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:18,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 73 conjunts are in the unsatisfiable core [2022-02-20 23:46:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:18,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:18,765 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 8 treesize of output 7 [2022-02-20 23:46:24,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:24,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-02-20 23:46:24,642 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:46:24,642 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 23:46:25,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:25,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-02-20 23:46:25,474 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-20 23:46:25,475 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 23:46:25,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {6321#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {6321#true} is VALID [2022-02-20 23:46:25,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {6321#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~mem32#1.base, main_#t~mem32#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {6321#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,675 INFO L272 TraceCheckUtils]: 3: Hoare triple {6321#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {6321#true} is VALID [2022-02-20 23:46:25,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {6321#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6321#true} is VALID [2022-02-20 23:46:25,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {6321#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6321#true} is VALID [2022-02-20 23:46:25,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {6321#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {6321#true} is VALID [2022-02-20 23:46:25,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {6321#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6321#true} is VALID [2022-02-20 23:46:25,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {6321#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {6321#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {6321#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {6321#true} assume true; {6321#true} is VALID [2022-02-20 23:46:25,676 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6321#true} {6321#true} #317#return; {6321#true} is VALID [2022-02-20 23:46:25,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {6321#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {6321#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,676 INFO L272 TraceCheckUtils]: 15: Hoare triple {6321#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {6321#true} is VALID [2022-02-20 23:46:25,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {6321#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6321#true} is VALID [2022-02-20 23:46:25,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {6321#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6321#true} is VALID [2022-02-20 23:46:25,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {6321#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {6321#true} is VALID [2022-02-20 23:46:25,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {6321#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6321#true} is VALID [2022-02-20 23:46:25,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {6321#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {6321#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {6321#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {6321#true} assume true; {6321#true} is VALID [2022-02-20 23:46:25,677 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6321#true} {6321#true} #319#return; {6321#true} is VALID [2022-02-20 23:46:25,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {6321#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {6321#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,678 INFO L272 TraceCheckUtils]: 27: Hoare triple {6321#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {6321#true} is VALID [2022-02-20 23:46:25,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {6321#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6321#true} is VALID [2022-02-20 23:46:25,678 INFO L290 TraceCheckUtils]: 29: Hoare triple {6321#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6321#true} is VALID [2022-02-20 23:46:25,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {6321#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {6321#true} is VALID [2022-02-20 23:46:25,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {6321#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6321#true} is VALID [2022-02-20 23:46:25,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {6321#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {6321#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {6321#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {6321#true} assume true; {6321#true} is VALID [2022-02-20 23:46:25,679 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6321#true} {6321#true} #321#return; {6321#true} is VALID [2022-02-20 23:46:25,679 INFO L290 TraceCheckUtils]: 37: Hoare triple {6321#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {6321#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {6321#true} is VALID [2022-02-20 23:46:25,680 INFO L272 TraceCheckUtils]: 39: Hoare triple {6321#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {6321#true} is VALID [2022-02-20 23:46:25,694 INFO L290 TraceCheckUtils]: 40: Hoare triple {6321#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6446#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} is VALID [2022-02-20 23:46:25,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {6446#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6450#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} is VALID [2022-02-20 23:46:25,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {6450#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {6450#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} is VALID [2022-02-20 23:46:25,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {6450#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6450#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} is VALID [2022-02-20 23:46:25,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {6450#(and (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1) (or (and (= |zalloc_or_die_#in~size#1| 0) (= (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|)) (= (mod (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|) |zalloc_or_die_#in~size#1|) 0))))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6460#(and (= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1) (= |zalloc_or_die_calloc_model_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) |zalloc_or_die_#in~size#1|) 0) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) |zalloc_or_die_#in~size#1|)))))} is VALID [2022-02-20 23:46:25,700 INFO L290 TraceCheckUtils]: 45: Hoare triple {6460#(and (= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1) (= |zalloc_or_die_calloc_model_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) |zalloc_or_die_#in~size#1|) 0) (<= 1 (div (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) |zalloc_or_die_#in~size#1|)))))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6464#(and (= |zalloc_or_die_~ptr~1#1.offset| 0) (or (and (= (mod (select |#length| |zalloc_or_die_~ptr~1#1.base|) |zalloc_or_die_#in~size#1|) 0) (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_~ptr~1#1.base|) |zalloc_or_die_#in~size#1|))) (and (= (select |#length| |zalloc_or_die_~ptr~1#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0))) (= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1))} is VALID [2022-02-20 23:46:25,701 INFO L290 TraceCheckUtils]: 46: Hoare triple {6464#(and (= |zalloc_or_die_~ptr~1#1.offset| 0) (or (and (= (mod (select |#length| |zalloc_or_die_~ptr~1#1.base|) |zalloc_or_die_#in~size#1|) 0) (not (= |zalloc_or_die_#in~size#1| 0)) (<= 1 (div (select |#length| |zalloc_or_die_~ptr~1#1.base|) |zalloc_or_die_#in~size#1|))) (and (= (select |#length| |zalloc_or_die_~ptr~1#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0))) (= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6468#(and (= |zalloc_or_die_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (<= 1 (div (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|)) (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|) 0))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} is VALID [2022-02-20 23:46:25,702 INFO L290 TraceCheckUtils]: 47: Hoare triple {6468#(and (= |zalloc_or_die_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (<= 1 (div (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|)) (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|) 0))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} assume true; {6468#(and (= |zalloc_or_die_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (<= 1 (div (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|)) (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|) 0))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} is VALID [2022-02-20 23:46:25,703 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6468#(and (= |zalloc_or_die_#res#1.offset| 0) (or (and (= (select |#length| |zalloc_or_die_#res#1.base|) 0) (= |zalloc_or_die_#in~size#1| 0)) (and (<= 1 (div (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|)) (not (= |zalloc_or_die_#in~size#1| 0)) (= (mod (select |#length| |zalloc_or_die_#res#1.base|) |zalloc_or_die_#in~size#1|) 0))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} {6321#true} #323#return; {6475#(and (= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1) (= |ULTIMATE.start_l3_insert_#t~ret9#1.offset| 0) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (= (mod (select |#length| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} is VALID [2022-02-20 23:46:25,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {6475#(and (= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1) (= |ULTIMATE.start_l3_insert_#t~ret9#1.offset| 0) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (= (mod (select |#length| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {6479#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l3_insert_~item~1#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (= (mod (select |#length| |ULTIMATE.start_l3_insert_~item~1#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))) (= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1) (= |ULTIMATE.start_l3_insert_~item~1#1.offset| 0))} is VALID [2022-02-20 23:46:25,704 INFO L290 TraceCheckUtils]: 50: Hoare triple {6479#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l3_insert_~item~1#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (= (mod (select |#length| |ULTIMATE.start_l3_insert_~item~1#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))) (= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1) (= |ULTIMATE.start_l3_insert_~item~1#1.offset| 0))} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {6483#(and (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} is VALID [2022-02-20 23:46:25,706 INFO L272 TraceCheckUtils]: 51: Hoare triple {6483#(and (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {6487#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:46:25,708 INFO L290 TraceCheckUtils]: 52: Hoare triple {6487#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6491#(and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)))} is VALID [2022-02-20 23:46:25,709 INFO L290 TraceCheckUtils]: 53: Hoare triple {6491#(and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6495#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:25,710 INFO L290 TraceCheckUtils]: 54: Hoare triple {6495#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {6495#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:25,711 INFO L290 TraceCheckUtils]: 55: Hoare triple {6495#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6495#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:25,711 INFO L290 TraceCheckUtils]: 56: Hoare triple {6495#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6495#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:25,712 INFO L290 TraceCheckUtils]: 57: Hoare triple {6495#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6495#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:25,713 INFO L290 TraceCheckUtils]: 58: Hoare triple {6495#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6495#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:25,713 INFO L290 TraceCheckUtils]: 59: Hoare triple {6495#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {6495#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:25,717 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6495#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_150 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_150) |#valid|)) (exists ((v_ArrVal_149 Int)) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_149) |#length|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {6483#(and (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} #325#return; {6517#(and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |ULTIMATE.start_l4_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} is VALID [2022-02-20 23:46:25,718 INFO L290 TraceCheckUtils]: 61: Hoare triple {6517#(and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |ULTIMATE.start_l4_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {6517#(and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |ULTIMATE.start_l4_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} is VALID [2022-02-20 23:46:25,718 INFO L272 TraceCheckUtils]: 62: Hoare triple {6517#(and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |ULTIMATE.start_l4_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {6487#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:46:25,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {6487#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} is VALID [2022-02-20 23:46:25,723 INFO L290 TraceCheckUtils]: 64: Hoare triple {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} is VALID [2022-02-20 23:46:25,724 INFO L290 TraceCheckUtils]: 65: Hoare triple {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} is VALID [2022-02-20 23:46:25,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} is VALID [2022-02-20 23:46:25,725 INFO L290 TraceCheckUtils]: 67: Hoare triple {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} is VALID [2022-02-20 23:46:25,726 INFO L290 TraceCheckUtils]: 68: Hoare triple {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} is VALID [2022-02-20 23:46:25,727 INFO L290 TraceCheckUtils]: 69: Hoare triple {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} is VALID [2022-02-20 23:46:25,727 INFO L290 TraceCheckUtils]: 70: Hoare triple {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} assume true; {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} is VALID [2022-02-20 23:46:25,731 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6527#(exists ((v_ArrVal_151 Int) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_151) |#length|)))} {6517#(and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (not (= |ULTIMATE.start_l4_insert_~list#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1) (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} #327#return; {6552#(and (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} is VALID [2022-02-20 23:46:25,733 INFO L290 TraceCheckUtils]: 72: Hoare triple {6552#(and (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} SUMMARY for call write~$Pointer$(l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_~item~0#1.base, 4 + l4_insert_~item~0#1.offset, 4); srcloc: L675-1 {6552#(and (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} is VALID [2022-02-20 23:46:25,734 INFO L290 TraceCheckUtils]: 73: Hoare triple {6552#(and (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {6552#(and (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} is VALID [2022-02-20 23:46:25,737 INFO L290 TraceCheckUtils]: 74: Hoare triple {6552#(and (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_35| Int)) (and (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_35|) 0))))} assume !(4 + l4_insert_~list#1.offset <= #length[l4_insert_~list#1.base] && 0 <= l4_insert_~list#1.offset); {6322#false} is VALID [2022-02-20 23:46:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 80 proven. 24 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-02-20 23:46:25,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:25,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:25,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799034433] [2022-02-20 23:46:25,965 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:25,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671880067] [2022-02-20 23:46:25,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671880067] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:46:25,966 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:46:25,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-02-20 23:46:25,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896370827] [2022-02-20 23:46:25,966 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:25,967 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 75 [2022-02-20 23:46:25,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:25,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:46:26,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:26,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:46:26,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:46:26,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:46:26,044 INFO L87 Difference]: Start difference. First operand 217 states and 237 transitions. Second operand has 16 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:46:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:28,439 INFO L93 Difference]: Finished difference Result 222 states and 243 transitions. [2022-02-20 23:46:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:46:28,440 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 75 [2022-02-20 23:46:28,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:46:28,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 209 transitions. [2022-02-20 23:46:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:46:28,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 209 transitions. [2022-02-20 23:46:28,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 209 transitions. [2022-02-20 23:46:28,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:28,654 INFO L225 Difference]: With dead ends: 222 [2022-02-20 23:46:28,654 INFO L226 Difference]: Without dead ends: 222 [2022-02-20 23:46:28,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:46:28,655 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 3 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 560 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:28,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1380 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 527 Invalid, 0 Unknown, 560 Unchecked, 0.5s Time] [2022-02-20 23:46:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-02-20 23:46:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-02-20 23:46:28,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:28,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 140 states have (on average 1.5928571428571427) internal successors, (223), 207 states have internal predecessors, (223), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-20 23:46:28,661 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 140 states have (on average 1.5928571428571427) internal successors, (223), 207 states have internal predecessors, (223), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-20 23:46:28,662 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 140 states have (on average 1.5928571428571427) internal successors, (223), 207 states have internal predecessors, (223), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-20 23:46:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:28,668 INFO L93 Difference]: Finished difference Result 222 states and 243 transitions. [2022-02-20 23:46:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 243 transitions. [2022-02-20 23:46:28,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:28,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:28,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 140 states have (on average 1.5928571428571427) internal successors, (223), 207 states have internal predecessors, (223), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) Second operand 222 states. [2022-02-20 23:46:28,670 INFO L87 Difference]: Start difference. First operand has 222 states, 140 states have (on average 1.5928571428571427) internal successors, (223), 207 states have internal predecessors, (223), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) Second operand 222 states. [2022-02-20 23:46:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:28,676 INFO L93 Difference]: Finished difference Result 222 states and 243 transitions. [2022-02-20 23:46:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 243 transitions. [2022-02-20 23:46:28,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:28,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:28,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:28,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 140 states have (on average 1.5928571428571427) internal successors, (223), 207 states have internal predecessors, (223), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (11), 10 states have call predecessors, (11), 9 states have call successors, (11) [2022-02-20 23:46:28,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 243 transitions. [2022-02-20 23:46:28,682 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 243 transitions. Word has length 75 [2022-02-20 23:46:28,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:28,683 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 243 transitions. [2022-02-20 23:46:28,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-20 23:46:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 243 transitions. [2022-02-20 23:46:28,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 23:46:28,684 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:28,684 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:28,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:28,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:28,899 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 71 more)] === [2022-02-20 23:46:28,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:28,900 INFO L85 PathProgramCache]: Analyzing trace with hash 325199745, now seen corresponding path program 1 times [2022-02-20 23:46:28,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:28,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855624994] [2022-02-20 23:46:28,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:28,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:28,938 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:28,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [721274318] [2022-02-20 23:46:28,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:28,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:28,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:28,940 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:46:28,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 23:46:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:29,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:46:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:29,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:29,538 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:29,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:46:29,769 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:29,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:46:29,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {7474#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {7474#true} is VALID [2022-02-20 23:46:29,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {7474#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~mem32#1.base, main_#t~mem32#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {7474#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,796 INFO L272 TraceCheckUtils]: 3: Hoare triple {7474#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {7474#true} is VALID [2022-02-20 23:46:29,797 INFO L290 TraceCheckUtils]: 4: Hoare triple {7474#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7474#true} is VALID [2022-02-20 23:46:29,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {7474#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7474#true} is VALID [2022-02-20 23:46:29,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {7474#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {7474#true} is VALID [2022-02-20 23:46:29,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {7474#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7474#true} is VALID [2022-02-20 23:46:29,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {7474#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {7474#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {7474#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {7474#true} assume true; {7474#true} is VALID [2022-02-20 23:46:29,798 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7474#true} {7474#true} #317#return; {7474#true} is VALID [2022-02-20 23:46:29,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {7474#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {7474#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,798 INFO L272 TraceCheckUtils]: 15: Hoare triple {7474#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {7474#true} is VALID [2022-02-20 23:46:29,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {7474#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7474#true} is VALID [2022-02-20 23:46:29,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {7474#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7474#true} is VALID [2022-02-20 23:46:29,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {7474#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {7474#true} is VALID [2022-02-20 23:46:29,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {7474#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7474#true} is VALID [2022-02-20 23:46:29,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {7474#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {7474#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {7474#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {7474#true} assume true; {7474#true} is VALID [2022-02-20 23:46:29,800 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7474#true} {7474#true} #319#return; {7474#true} is VALID [2022-02-20 23:46:29,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {7474#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {7474#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,800 INFO L272 TraceCheckUtils]: 27: Hoare triple {7474#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {7474#true} is VALID [2022-02-20 23:46:29,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {7474#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7474#true} is VALID [2022-02-20 23:46:29,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {7474#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7474#true} is VALID [2022-02-20 23:46:29,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {7474#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {7474#true} is VALID [2022-02-20 23:46:29,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {7474#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7474#true} is VALID [2022-02-20 23:46:29,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {7474#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {7474#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {7474#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {7474#true} assume true; {7474#true} is VALID [2022-02-20 23:46:29,802 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7474#true} {7474#true} #321#return; {7474#true} is VALID [2022-02-20 23:46:29,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {7474#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,802 INFO L290 TraceCheckUtils]: 38: Hoare triple {7474#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {7474#true} is VALID [2022-02-20 23:46:29,802 INFO L272 TraceCheckUtils]: 39: Hoare triple {7474#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {7474#true} is VALID [2022-02-20 23:46:29,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {7474#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7599#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:46:29,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {7599#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7603#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:29,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {7603#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {7603#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:29,804 INFO L290 TraceCheckUtils]: 43: Hoare triple {7603#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7603#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:29,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {7603#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7613#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:29,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {7613#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7617#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:29,805 INFO L290 TraceCheckUtils]: 46: Hoare triple {7617#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7621#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:29,805 INFO L290 TraceCheckUtils]: 47: Hoare triple {7621#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {7621#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:29,806 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7621#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {7474#true} #323#return; {7628#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} is VALID [2022-02-20 23:46:29,806 INFO L290 TraceCheckUtils]: 49: Hoare triple {7628#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {7632#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:46:29,807 INFO L290 TraceCheckUtils]: 50: Hoare triple {7632#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,808 INFO L272 TraceCheckUtils]: 51: Hoare triple {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {7640#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:29,810 INFO L290 TraceCheckUtils]: 52: Hoare triple {7640#(= |old(#valid)| |#valid|)} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7644#(exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|))} is VALID [2022-02-20 23:46:29,811 INFO L290 TraceCheckUtils]: 53: Hoare triple {7644#(exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,814 INFO L290 TraceCheckUtils]: 55: Hoare triple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr34#1 := #Ultimate.C_memset_#value#1];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr34#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr34#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr34#1 := 1 + #Ultimate.C_memset_#t~loopctr34#1; {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,815 INFO L290 TraceCheckUtils]: 56: Hoare triple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,815 INFO L290 TraceCheckUtils]: 57: Hoare triple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,816 INFO L290 TraceCheckUtils]: 58: Hoare triple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,817 INFO L290 TraceCheckUtils]: 59: Hoare triple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,818 INFO L290 TraceCheckUtils]: 60: Hoare triple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,819 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #325#return; {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,819 INFO L290 TraceCheckUtils]: 62: Hoare triple {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,820 INFO L272 TraceCheckUtils]: 63: Hoare triple {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {7640#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:29,822 INFO L290 TraceCheckUtils]: 64: Hoare triple {7640#(= |old(#valid)| |#valid|)} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7644#(exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|))} is VALID [2022-02-20 23:46:29,823 INFO L290 TraceCheckUtils]: 65: Hoare triple {7644#(exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,824 INFO L290 TraceCheckUtils]: 66: Hoare triple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,825 INFO L290 TraceCheckUtils]: 67: Hoare triple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,825 INFO L290 TraceCheckUtils]: 68: Hoare triple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,826 INFO L290 TraceCheckUtils]: 69: Hoare triple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,827 INFO L290 TraceCheckUtils]: 70: Hoare triple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,828 INFO L290 TraceCheckUtils]: 71: Hoare triple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,829 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {7648#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_203 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_203) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #327#return; {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,830 INFO L290 TraceCheckUtils]: 73: Hoare triple {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} SUMMARY for call write~$Pointer$(l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_~item~0#1.base, 4 + l4_insert_~item~0#1.offset, 4); srcloc: L675-1 {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,830 INFO L290 TraceCheckUtils]: 74: Hoare triple {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,830 INFO L290 TraceCheckUtils]: 75: Hoare triple {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} assume !(1 == #valid[l4_insert_~list#1.base]); {7475#false} is VALID [2022-02-20 23:46:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 83 proven. 17 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-02-20 23:46:29,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:30,525 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:46:30,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-02-20 23:46:30,597 INFO L290 TraceCheckUtils]: 75: Hoare triple {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} assume !(1 == #valid[l4_insert_~list#1.base]); {7475#false} is VALID [2022-02-20 23:46:30,598 INFO L290 TraceCheckUtils]: 74: Hoare triple {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:30,598 INFO L290 TraceCheckUtils]: 73: Hoare triple {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} SUMMARY for call write~$Pointer$(l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_~item~0#1.base, 4 + l4_insert_~item~0#1.offset, 4); srcloc: L675-1 {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:30,599 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #327#return; {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:30,600 INFO L290 TraceCheckUtils]: 71: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} assume true; {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,600 INFO L290 TraceCheckUtils]: 70: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,601 INFO L290 TraceCheckUtils]: 69: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,601 INFO L290 TraceCheckUtils]: 68: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,602 INFO L290 TraceCheckUtils]: 67: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,603 INFO L290 TraceCheckUtils]: 66: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,603 INFO L290 TraceCheckUtils]: 65: Hoare triple {7749#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,605 INFO L290 TraceCheckUtils]: 64: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7749#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1))))} is VALID [2022-02-20 23:46:30,606 INFO L272 TraceCheckUtils]: 63: Hoare triple {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,606 INFO L290 TraceCheckUtils]: 62: Hoare triple {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset := l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset; {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:30,607 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #325#return; {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:30,608 INFO L290 TraceCheckUtils]: 60: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} assume true; {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,608 INFO L290 TraceCheckUtils]: 59: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,609 INFO L290 TraceCheckUtils]: 58: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,609 INFO L290 TraceCheckUtils]: 57: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,610 INFO L290 TraceCheckUtils]: 56: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,611 INFO L290 TraceCheckUtils]: 55: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} assume #Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr34#1 := #Ultimate.C_memset_#value#1];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr34#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr34#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr34#1 := 1 + #Ultimate.C_memset_#t~loopctr34#1; {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,611 INFO L290 TraceCheckUtils]: 54: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,612 INFO L290 TraceCheckUtils]: 53: Hoare triple {7749#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,613 INFO L290 TraceCheckUtils]: 52: Hoare triple {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7749#(or (not (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1))))} is VALID [2022-02-20 23:46:30,614 INFO L272 TraceCheckUtils]: 51: Hoare triple {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {7727#(forall ((|v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~list#1.base_BEFORE_CALL_9|) 1)))} is VALID [2022-02-20 23:46:30,614 INFO L290 TraceCheckUtils]: 50: Hoare triple {7632#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} assume { :begin_inline_l4_insert } true;l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset := l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;havoc l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset, l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset, l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset;l4_insert_~list#1.base, l4_insert_~list#1.offset := l4_insert_#in~list#1.base, l4_insert_#in~list#1.offset; {7636#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:30,614 INFO L290 TraceCheckUtils]: 49: Hoare triple {7628#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset := l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset; {7632#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:46:30,615 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7621#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {7474#true} #323#return; {7628#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} is VALID [2022-02-20 23:46:30,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {7621#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {7621#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:30,616 INFO L290 TraceCheckUtils]: 46: Hoare triple {7617#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7621#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:30,616 INFO L290 TraceCheckUtils]: 45: Hoare triple {7613#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7617#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:30,617 INFO L290 TraceCheckUtils]: 44: Hoare triple {7603#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7613#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:30,617 INFO L290 TraceCheckUtils]: 43: Hoare triple {7603#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7603#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:30,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {7603#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {7603#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:30,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {7599#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7603#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:30,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {7474#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7599#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:46:30,618 INFO L272 TraceCheckUtils]: 39: Hoare triple {7474#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {7474#true} is VALID [2022-02-20 23:46:30,618 INFO L290 TraceCheckUtils]: 38: Hoare triple {7474#true} assume { :begin_inline_l3_insert } true;l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset := l2_insert_~item~2#1.base, 4 + l2_insert_~item~2#1.offset;havoc l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset, l3_insert_#t~nondet10#1, l3_insert_#t~mem11#1.base, l3_insert_#t~mem11#1.offset, l3_insert_~list#1.base, l3_insert_~list#1.offset, l3_insert_~item~1#1.base, l3_insert_~item~1#1.offset;l3_insert_~list#1.base, l3_insert_~list#1.offset := l3_insert_#in~list#1.base, l3_insert_#in~list#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {7474#true} l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset := l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,618 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7474#true} {7474#true} #321#return; {7474#true} is VALID [2022-02-20 23:46:30,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {7474#true} assume true; {7474#true} is VALID [2022-02-20 23:46:30,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {7474#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {7474#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {7474#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {7474#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7474#true} is VALID [2022-02-20 23:46:30,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {7474#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {7474#true} is VALID [2022-02-20 23:46:30,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {7474#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7474#true} is VALID [2022-02-20 23:46:30,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {7474#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7474#true} is VALID [2022-02-20 23:46:30,619 INFO L272 TraceCheckUtils]: 27: Hoare triple {7474#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {7474#true} is VALID [2022-02-20 23:46:30,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {7474#true} assume { :begin_inline_l2_insert } true;l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset := l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;havoc l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset, l2_insert_#t~nondet13#1, l2_insert_#t~mem14#1.base, l2_insert_#t~mem14#1.offset, l2_insert_~list#1.base, l2_insert_~list#1.offset, l2_insert_~item~2#1.base, l2_insert_~item~2#1.offset;l2_insert_~list#1.base, l2_insert_~list#1.offset := l2_insert_#in~list#1.base, l2_insert_#in~list#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {7474#true} l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset := l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,619 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7474#true} {7474#true} #319#return; {7474#true} is VALID [2022-02-20 23:46:30,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {7474#true} assume true; {7474#true} is VALID [2022-02-20 23:46:30,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {7474#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {7474#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {7474#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {7474#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7474#true} is VALID [2022-02-20 23:46:30,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {7474#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {7474#true} is VALID [2022-02-20 23:46:30,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {7474#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7474#true} is VALID [2022-02-20 23:46:30,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {7474#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7474#true} is VALID [2022-02-20 23:46:30,620 INFO L272 TraceCheckUtils]: 15: Hoare triple {7474#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {7474#true} is VALID [2022-02-20 23:46:30,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {7474#true} assume { :begin_inline_l1_insert } true;l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset := l0_insert_~item~4#1.base, 4 + l0_insert_~item~4#1.offset;havoc l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset, l1_insert_#t~nondet16#1, l1_insert_#t~mem17#1.base, l1_insert_#t~mem17#1.offset, l1_insert_~list#1.base, l1_insert_~list#1.offset, l1_insert_~item~3#1.base, l1_insert_~item~3#1.offset;l1_insert_~list#1.base, l1_insert_~list#1.offset := l1_insert_#in~list#1.base, l1_insert_#in~list#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {7474#true} l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset := l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,620 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7474#true} {7474#true} #317#return; {7474#true} is VALID [2022-02-20 23:46:30,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {7474#true} assume true; {7474#true} is VALID [2022-02-20 23:46:30,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {7474#true} assume ~ptr~1#1.base != 0 || ~ptr~1#1.offset != 0;#res#1.base, #res#1.offset := ~ptr~1#1.base, ~ptr~1#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {7474#true} #t~ret5#1.base, #t~ret5#1.offset := calloc_model_#res#1.base, calloc_model_#res#1.offset;assume { :end_inline_calloc_model } true;~ptr~1#1.base, ~ptr~1#1.offset := #t~ret5#1.base, #t~ret5#1.offset;havoc #t~ret5#1.base, #t~ret5#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {7474#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;calloc_model_#res#1.base, calloc_model_#res#1.offset := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {7474#true} assume !(#Ultimate.C_memset_#t~loopctr34#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7474#true} is VALID [2022-02-20 23:46:30,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {7474#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr34#1;#Ultimate.C_memset_#t~loopctr34#1 := 0; {7474#true} is VALID [2022-02-20 23:46:30,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {7474#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7474#true} is VALID [2022-02-20 23:46:30,621 INFO L290 TraceCheckUtils]: 4: Hoare triple {7474#true} ~size#1 := #in~size#1;assume { :begin_inline_calloc_model } true;calloc_model_#in~nmemb#1, calloc_model_#in~size#1 := 1, ~size#1;havoc calloc_model_#res#1.base, calloc_model_#res#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset, calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset, calloc_model_~nmemb#1, calloc_model_~size#1, calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset;calloc_model_~nmemb#1 := calloc_model_#in~nmemb#1;calloc_model_~size#1 := calloc_model_#in~size#1;call calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset := #Ultimate.allocOnHeap(calloc_model_~nmemb#1 * calloc_model_~size#1);calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset := calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;havoc calloc_model_#t~malloc3#1.base, calloc_model_#t~malloc3#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := calloc_model_~ptr~0#1.base, calloc_model_~ptr~0#1.offset, 0, calloc_model_~nmemb#1 * calloc_model_~size#1; {7474#true} is VALID [2022-02-20 23:46:30,621 INFO L272 TraceCheckUtils]: 3: Hoare triple {7474#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {7474#true} is VALID [2022-02-20 23:46:30,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {7474#true} assume { :begin_inline_l0_insert } true;l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset := ~#list~0.base, ~#list~0.offset;havoc l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset, l0_insert_#t~nondet19#1, l0_insert_#t~mem20#1.base, l0_insert_#t~mem20#1.offset, l0_insert_~list#1.base, l0_insert_~list#1.offset, l0_insert_~item~4#1.base, l0_insert_~item~4#1.offset;l0_insert_~list#1.base, l0_insert_~list#1.offset := l0_insert_#in~list#1.base, l0_insert_#in~list#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {7474#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet31#1, main_#t~mem32#1.base, main_#t~mem32#1.offset; {7474#true} is VALID [2022-02-20 23:46:30,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {7474#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(14, 2);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(4, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); {7474#true} is VALID [2022-02-20 23:46:30,623 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 83 proven. 17 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-02-20 23:46:30,623 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:30,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855624994] [2022-02-20 23:46:30,624 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:30,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721274318] [2022-02-20 23:46:30,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721274318] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:46:30,624 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:46:30,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2022-02-20 23:46:30,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338280817] [2022-02-20 23:46:30,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:30,625 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2022-02-20 23:46:30,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:30,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:30,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:30,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:46:30,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:30,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:46:30,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:46:30,679 INFO L87 Difference]: Start difference. First operand 222 states and 243 transitions. Second operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:42,593 INFO L93 Difference]: Finished difference Result 270 states and 294 transitions. [2022-02-20 23:46:42,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:46:42,594 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2022-02-20 23:46:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 254 transitions. [2022-02-20 23:46:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:42,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 254 transitions. [2022-02-20 23:46:42,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 254 transitions. [2022-02-20 23:46:42,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:42,812 INFO L225 Difference]: With dead ends: 270 [2022-02-20 23:46:42,812 INFO L226 Difference]: Without dead ends: 270 [2022-02-20 23:46:42,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 134 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:46:42,813 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 200 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:42,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 1303 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 684 Invalid, 0 Unknown, 118 Unchecked, 0.5s Time] [2022-02-20 23:46:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-02-20 23:46:42,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 217. [2022-02-20 23:46:42,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:42,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 270 states. Second operand has 217 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 204 states have internal predecessors, (218), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:46:42,827 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand has 217 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 204 states have internal predecessors, (218), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:46:42,829 INFO L87 Difference]: Start difference. First operand 270 states. Second operand has 217 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 204 states have internal predecessors, (218), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:46:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:42,837 INFO L93 Difference]: Finished difference Result 270 states and 294 transitions. [2022-02-20 23:46:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 294 transitions. [2022-02-20 23:46:42,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:42,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:42,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 204 states have internal predecessors, (218), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 270 states. [2022-02-20 23:46:42,839 INFO L87 Difference]: Start difference. First operand has 217 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 204 states have internal predecessors, (218), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 270 states. [2022-02-20 23:46:42,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:42,844 INFO L93 Difference]: Finished difference Result 270 states and 294 transitions. [2022-02-20 23:46:42,845 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 294 transitions. [2022-02-20 23:46:42,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:42,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:42,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:42,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 204 states have internal predecessors, (218), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:46:42,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 234 transitions. [2022-02-20 23:46:42,851 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 234 transitions. Word has length 76 [2022-02-20 23:46:42,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:42,851 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 234 transitions. [2022-02-20 23:46:42,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.5) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 23:46:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 234 transitions. [2022-02-20 23:46:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 23:46:42,852 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:42,852 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:42,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:43,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:43,071 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 71 more)] === [2022-02-20 23:46:43,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:43,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2090050401, now seen corresponding path program 1 times [2022-02-20 23:46:43,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:43,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016409707] [2022-02-20 23:46:43,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:43,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms