./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0235-2.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-0235-2.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 5243781ee83706d005235269371a592cabf9c2dbc613c235cbe81d6e89d326d7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:45:38,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:45:38,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:45:38,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:45:38,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:45:38,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:45:38,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:45:38,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:45:38,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:45:38,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:45:38,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:45:38,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:45:38,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:45:38,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:45:38,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:45:38,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:45:38,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:45:38,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:45:38,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:45:38,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:45:38,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:45:38,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:45:38,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:45:38,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:45:38,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:45:38,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:45:38,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:45:38,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:45:38,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:45:38,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:45:38,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:45:38,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:45:38,102 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:45:38,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:45:38,103 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:45:38,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:45:38,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:45:38,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:45:38,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:45:38,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:45:38,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:45:38,106 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:38,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:45:38,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:45:38,130 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:45:38,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:45:38,134 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:45:38,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:45:38,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:45:38,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:45:38,135 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:45:38,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:45:38,135 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:45:38,135 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:45:38,135 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:45:38,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:45:38,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:45:38,136 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:45:38,136 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:45:38,136 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:45:38,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:45:38,136 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:45:38,136 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:45:38,137 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:45:38,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:45:38,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:45:38,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:45:38,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:38,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:45:38,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:45:38,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:45:38,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:45:38,139 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 -> 5243781ee83706d005235269371a592cabf9c2dbc613c235cbe81d6e89d326d7 [2022-02-20 23:45:38,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:45:38,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:45:38,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:45:38,346 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:45:38,355 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:45:38,357 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0235-2.i [2022-02-20 23:45:38,425 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685a3b894/7ab3d3de474741fa9074bdc7b87c7a77/FLAG065b6d642 [2022-02-20 23:45:38,881 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:45:38,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0235-2.i [2022-02-20 23:45:38,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685a3b894/7ab3d3de474741fa9074bdc7b87c7a77/FLAG065b6d642 [2022-02-20 23:45:39,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685a3b894/7ab3d3de474741fa9074bdc7b87c7a77 [2022-02-20 23:45:39,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:45:39,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:45:39,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:39,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:45:39,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:45:39,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:39" (1/1) ... [2022-02-20 23:45:39,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5987064a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:39, skipping insertion in model container [2022-02-20 23:45:39,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:39" (1/1) ... [2022-02-20 23:45:39,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:45:39,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:45:39,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:39,548 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:45:39,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:39,604 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:45:39,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:39 WrapperNode [2022-02-20 23:45:39,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:39,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:39,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:45:39,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:45:39,609 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:39" (1/1) ... [2022-02-20 23:45:39,620 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:39" (1/1) ... [2022-02-20 23:45:39,646 INFO L137 Inliner]: procedures = 188, calls = 71, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 237 [2022-02-20 23:45:39,646 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:39,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:45:39,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:45:39,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:45:39,652 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:39" (1/1) ... [2022-02-20 23:45:39,652 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:39" (1/1) ... [2022-02-20 23:45:39,656 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:39" (1/1) ... [2022-02-20 23:45:39,656 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:39" (1/1) ... [2022-02-20 23:45:39,664 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:39" (1/1) ... [2022-02-20 23:45:39,667 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:39" (1/1) ... [2022-02-20 23:45:39,668 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:39" (1/1) ... [2022-02-20 23:45:39,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:45:39,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:45:39,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:45:39,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:45:39,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:39" (1/1) ... [2022-02-20 23:45:39,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:39,702 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 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:39,728 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:39,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:45:39,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:45:39,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:45:39,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:45:39,744 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2022-02-20 23:45:39,744 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2022-02-20 23:45:39,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:45:39,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:45:39,745 INFO L130 BoogieDeclarations]: Found specification of procedure l0_destroy [2022-02-20 23:45:39,745 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_destroy [2022-02-20 23:45:39,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:45:39,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:45:39,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:45:39,822 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:45:39,824 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:45:40,313 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:45:40,320 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:45:40,320 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 23:45:40,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:40 BoogieIcfgContainer [2022-02-20 23:45:40,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:45:40,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:45:40,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:45:40,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:45:40,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:45:39" (1/3) ... [2022-02-20 23:45:40,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4634eb5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:40, skipping insertion in model container [2022-02-20 23:45:40,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:39" (2/3) ... [2022-02-20 23:45:40,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4634eb5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:40, skipping insertion in model container [2022-02-20 23:45:40,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:40" (3/3) ... [2022-02-20 23:45:40,327 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0235-2.i [2022-02-20 23:45:40,330 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:45:40,331 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 87 error locations. [2022-02-20 23:45:40,358 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:45:40,362 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:40,362 INFO L340 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2022-02-20 23:45:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand has 238 states, 136 states have (on average 1.875) internal successors, (255), 223 states have internal predecessors, (255), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:40,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:45:40,383 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:40,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:45:40,383 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 83 more)] === [2022-02-20 23:45:40,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash 930118, now seen corresponding path program 1 times [2022-02-20 23:45:40,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:40,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222842850] [2022-02-20 23:45:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:40,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:40,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#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); {241#true} is VALID [2022-02-20 23:45:40,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {241#true} is VALID [2022-02-20 23:45:40,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {241#true} assume !true; {242#false} is VALID [2022-02-20 23:45:40,484 INFO L290 TraceCheckUtils]: 3: Hoare triple {242#false} assume !(1 == #valid[~#list~0.base]); {242#false} is VALID [2022-02-20 23:45:40,485 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:40,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:40,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222842850] [2022-02-20 23:45:40,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222842850] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:40,486 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:40,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:40,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197455542] [2022-02-20 23:45:40,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:40,491 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:40,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:40,494 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:40,499 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:40,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:45:40,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:40,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:45:40,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:45:40,516 INFO L87 Difference]: Start difference. First operand has 238 states, 136 states have (on average 1.875) internal successors, (255), 223 states have internal predecessors, (255), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,702 INFO L93 Difference]: Finished difference Result 238 states and 268 transitions. [2022-02-20 23:45:40,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:45:40,702 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:40,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:40,704 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:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 279 transitions. [2022-02-20 23:45:40,719 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:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 279 transitions. [2022-02-20 23:45:40,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 279 transitions. [2022-02-20 23:45:40,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:40,937 INFO L225 Difference]: With dead ends: 238 [2022-02-20 23:45:40,937 INFO L226 Difference]: Without dead ends: 236 [2022-02-20 23:45:40,938 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:40,941 INFO L933 BasicCegarLoop]: 268 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, 268 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:40,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 268 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:40,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-02-20 23:45:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2022-02-20 23:45:40,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:40,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 236 states, 135 states have (on average 1.7925925925925925) internal successors, (242), 221 states have internal predecessors, (242), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:40,975 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 236 states, 135 states have (on average 1.7925925925925925) internal successors, (242), 221 states have internal predecessors, (242), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:40,976 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 236 states, 135 states have (on average 1.7925925925925925) internal successors, (242), 221 states have internal predecessors, (242), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,993 INFO L93 Difference]: Finished difference Result 236 states and 266 transitions. [2022-02-20 23:45:40,993 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 266 transitions. [2022-02-20 23:45:40,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:40,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:40,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 135 states have (on average 1.7925925925925925) internal successors, (242), 221 states have internal predecessors, (242), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 236 states. [2022-02-20 23:45:40,999 INFO L87 Difference]: Start difference. First operand has 236 states, 135 states have (on average 1.7925925925925925) internal successors, (242), 221 states have internal predecessors, (242), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 236 states. [2022-02-20 23:45:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:41,008 INFO L93 Difference]: Finished difference Result 236 states and 266 transitions. [2022-02-20 23:45:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 266 transitions. [2022-02-20 23:45:41,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:41,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:41,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:41,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 135 states have (on average 1.7925925925925925) internal successors, (242), 221 states have internal predecessors, (242), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 266 transitions. [2022-02-20 23:45:41,019 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 266 transitions. Word has length 4 [2022-02-20 23:45:41,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:41,020 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 266 transitions. [2022-02-20 23:45:41,020 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:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 266 transitions. [2022-02-20 23:45:41,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:45:41,020 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:41,020 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:45:41,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:45:41,021 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 83 more)] === [2022-02-20 23:45:41,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:41,022 INFO L85 PathProgramCache]: Analyzing trace with hash 889937946, now seen corresponding path program 1 times [2022-02-20 23:45:41,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:41,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738143425] [2022-02-20 23:45:41,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:41,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:41,034 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:41,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [273346712] [2022-02-20 23:45:41,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:41,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:41,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:41,045 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:41,050 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:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:41,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:45:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:41,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:41,213 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:41,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {1191#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); {1191#true} is VALID [2022-02-20 23:45:41,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {1191#true} is VALID [2022-02-20 23:45:41,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#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; {1191#true} is VALID [2022-02-20 23:45:41,222 INFO L272 TraceCheckUtils]: 3: Hoare triple {1191#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {1191#true} is VALID [2022-02-20 23:45:41,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {1191#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; {1208#(= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)} is VALID [2022-02-20 23:45:41,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {1208#(= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)} assume !(1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {1192#false} is VALID [2022-02-20 23:45:41,224 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:41,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:41,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:41,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738143425] [2022-02-20 23:45:41,240 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:41,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273346712] [2022-02-20 23:45:41,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273346712] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:41,240 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:41,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:41,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441943276] [2022-02-20 23:45:41,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:41,242 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:41,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:41,242 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:41,247 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:41,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:41,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:41,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:41,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:41,249 INFO L87 Difference]: Start difference. First operand 236 states and 266 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:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:41,561 INFO L93 Difference]: Finished difference Result 235 states and 265 transitions. [2022-02-20 23:45:41,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:41,561 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:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:41,562 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:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2022-02-20 23:45:41,565 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:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2022-02-20 23:45:41,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 266 transitions. [2022-02-20 23:45:41,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:41,760 INFO L225 Difference]: With dead ends: 235 [2022-02-20 23:45:41,760 INFO L226 Difference]: Without dead ends: 235 [2022-02-20 23:45:41,760 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:41,761 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 9 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:41,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 428 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-02-20 23:45:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2022-02-20 23:45:41,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:41,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 235 states, 135 states have (on average 1.7851851851851852) internal successors, (241), 220 states have internal predecessors, (241), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:41,769 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 235 states, 135 states have (on average 1.7851851851851852) internal successors, (241), 220 states have internal predecessors, (241), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:41,770 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 235 states, 135 states have (on average 1.7851851851851852) internal successors, (241), 220 states have internal predecessors, (241), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:41,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:41,780 INFO L93 Difference]: Finished difference Result 235 states and 265 transitions. [2022-02-20 23:45:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 265 transitions. [2022-02-20 23:45:41,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:41,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:41,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 135 states have (on average 1.7851851851851852) internal successors, (241), 220 states have internal predecessors, (241), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 235 states. [2022-02-20 23:45:41,783 INFO L87 Difference]: Start difference. First operand has 235 states, 135 states have (on average 1.7851851851851852) internal successors, (241), 220 states have internal predecessors, (241), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 235 states. [2022-02-20 23:45:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:41,793 INFO L93 Difference]: Finished difference Result 235 states and 265 transitions. [2022-02-20 23:45:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 265 transitions. [2022-02-20 23:45:41,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:41,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:41,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:41,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 135 states have (on average 1.7851851851851852) internal successors, (241), 220 states have internal predecessors, (241), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 265 transitions. [2022-02-20 23:45:41,805 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 265 transitions. Word has length 6 [2022-02-20 23:45:41,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:41,805 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 265 transitions. [2022-02-20 23:45:41,805 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:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 265 transitions. [2022-02-20 23:45:41,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:45:41,806 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:41,806 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:41,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 23:45:42,042 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:42,043 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 83 more)] === [2022-02-20 23:45:42,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:42,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1818272976, now seen corresponding path program 1 times [2022-02-20 23:45:42,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:42,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103440812] [2022-02-20 23:45:42,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:42,054 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:42,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366399982] [2022-02-20 23:45:42,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:42,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:42,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:42,068 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:42,079 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:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:42,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:45:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:42,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:42,697 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:43,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {2151#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); {2151#true} is VALID [2022-02-20 23:45:43,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {2151#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {2151#true} is VALID [2022-02-20 23:45:43,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {2151#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; {2151#true} is VALID [2022-02-20 23:45:43,254 INFO L272 TraceCheckUtils]: 3: Hoare triple {2151#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {2151#true} is VALID [2022-02-20 23:45:43,256 INFO L290 TraceCheckUtils]: 4: Hoare triple {2151#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; {2168#(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:43,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {2168#(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]; {2168#(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:43,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {2168#(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); {2152#false} is VALID [2022-02-20 23:45:43,275 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:43,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:43,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:43,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103440812] [2022-02-20 23:45:43,276 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:43,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366399982] [2022-02-20 23:45:43,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366399982] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:43,278 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:43,279 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:43,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818703432] [2022-02-20 23:45:43,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:43,279 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:43,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:43,280 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:45,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 6 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:45,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:45,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:45,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:45,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:45,300 INFO L87 Difference]: Start difference. First operand 235 states and 265 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:45,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:45,537 INFO L93 Difference]: Finished difference Result 234 states and 264 transitions. [2022-02-20 23:45:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:45,538 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:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:45,538 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:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2022-02-20 23:45:45,541 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:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2022-02-20 23:45:45,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 265 transitions. [2022-02-20 23:45:45,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 265 edges. 265 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:45,717 INFO L225 Difference]: With dead ends: 234 [2022-02-20 23:45:45,717 INFO L226 Difference]: Without dead ends: 234 [2022-02-20 23:45:45,717 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:45,718 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:45,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 453 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 72 Unchecked, 0.0s Time] [2022-02-20 23:45:45,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-02-20 23:45:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-02-20 23:45:45,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:45,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 234 states, 135 states have (on average 1.7777777777777777) internal successors, (240), 219 states have internal predecessors, (240), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:45,725 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 234 states, 135 states have (on average 1.7777777777777777) internal successors, (240), 219 states have internal predecessors, (240), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:45,726 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 234 states, 135 states have (on average 1.7777777777777777) internal successors, (240), 219 states have internal predecessors, (240), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:45,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:45,731 INFO L93 Difference]: Finished difference Result 234 states and 264 transitions. [2022-02-20 23:45:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 264 transitions. [2022-02-20 23:45:45,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:45,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:45,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 135 states have (on average 1.7777777777777777) internal successors, (240), 219 states have internal predecessors, (240), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 234 states. [2022-02-20 23:45:45,734 INFO L87 Difference]: Start difference. First operand has 234 states, 135 states have (on average 1.7777777777777777) internal successors, (240), 219 states have internal predecessors, (240), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 234 states. [2022-02-20 23:45:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:45,740 INFO L93 Difference]: Finished difference Result 234 states and 264 transitions. [2022-02-20 23:45:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 264 transitions. [2022-02-20 23:45:45,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:45,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:45,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:45,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 135 states have (on average 1.7777777777777777) internal successors, (240), 219 states have internal predecessors, (240), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:45,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 264 transitions. [2022-02-20 23:45:45,747 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 264 transitions. Word has length 7 [2022-02-20 23:45:45,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:45,748 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 264 transitions. [2022-02-20 23:45:45,748 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:45,748 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 264 transitions. [2022-02-20 23:45:45,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 23:45:45,749 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:45,749 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:45,782 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:45,988 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:45,989 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 83 more)] === [2022-02-20 23:45:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:45,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1116483670, now seen corresponding path program 1 times [2022-02-20 23:45:45,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:45,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527559666] [2022-02-20 23:45:45,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:45,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:46,015 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:46,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210258839] [2022-02-20 23:45:46,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:46,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:46,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:46,032 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:46,075 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:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:46,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:45:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:46,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:46,617 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:45:46,617 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:46,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {3110#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); {3110#true} is VALID [2022-02-20 23:45:46,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {3110#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {3110#true} is VALID [2022-02-20 23:45:46,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,629 INFO L272 TraceCheckUtils]: 3: Hoare triple {3110#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {3110#true} is VALID [2022-02-20 23:45:46,629 INFO L290 TraceCheckUtils]: 4: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {3110#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3110#true} is VALID [2022-02-20 23:45:46,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {3110#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {3110#true} is VALID [2022-02-20 23:45:46,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {3110#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3110#true} is VALID [2022-02-20 23:45:46,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {3110#true} assume true; {3110#true} is VALID [2022-02-20 23:45:46,631 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3110#true} {3110#true} #413#return; {3110#true} is VALID [2022-02-20 23:45:46,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,631 INFO L272 TraceCheckUtils]: 15: Hoare triple {3110#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {3110#true} is VALID [2022-02-20 23:45:46,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {3110#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3110#true} is VALID [2022-02-20 23:45:46,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {3110#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {3110#true} is VALID [2022-02-20 23:45:46,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {3110#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3110#true} is VALID [2022-02-20 23:45:46,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {3110#true} assume true; {3110#true} is VALID [2022-02-20 23:45:46,632 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3110#true} {3110#true} #415#return; {3110#true} is VALID [2022-02-20 23:45:46,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,632 INFO L272 TraceCheckUtils]: 27: Hoare triple {3110#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {3110#true} is VALID [2022-02-20 23:45:46,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {3110#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3110#true} is VALID [2022-02-20 23:45:46,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {3110#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {3110#true} is VALID [2022-02-20 23:45:46,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {3110#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3110#true} is VALID [2022-02-20 23:45:46,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {3110#true} assume true; {3110#true} is VALID [2022-02-20 23:45:46,636 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3110#true} {3110#true} #417#return; {3110#true} is VALID [2022-02-20 23:45:46,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,638 INFO L272 TraceCheckUtils]: 39: Hoare triple {3110#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {3110#true} is VALID [2022-02-20 23:45:46,638 INFO L290 TraceCheckUtils]: 40: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {3110#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3110#true} is VALID [2022-02-20 23:45:46,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {3110#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {3110#true} is VALID [2022-02-20 23:45:46,639 INFO L290 TraceCheckUtils]: 43: Hoare triple {3110#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3110#true} is VALID [2022-02-20 23:45:46,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,639 INFO L290 TraceCheckUtils]: 47: Hoare triple {3110#true} assume true; {3110#true} is VALID [2022-02-20 23:45:46,639 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3110#true} {3110#true} #419#return; {3110#true} is VALID [2022-02-20 23:45:46,639 INFO L290 TraceCheckUtils]: 49: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:46,639 INFO L272 TraceCheckUtils]: 51: Hoare triple {3110#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {3110#true} is VALID [2022-02-20 23:45:46,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {3110#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; {3271#(= |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:46,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {3271#(= |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]; {3275#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:46,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {3275#(= (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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {3275#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:46,650 INFO L290 TraceCheckUtils]: 55: Hoare triple {3275#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3275#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:46,650 INFO L290 TraceCheckUtils]: 56: Hoare triple {3275#(= (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; {3285#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:46,651 INFO L290 TraceCheckUtils]: 57: Hoare triple {3285#(= (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; {3289#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:45:46,652 INFO L290 TraceCheckUtils]: 58: Hoare triple {3289#(= (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; {3293#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:46,652 INFO L290 TraceCheckUtils]: 59: Hoare triple {3293#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {3293#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:46,655 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3293#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {3110#true} #421#return; {3300#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:45:46,656 INFO L290 TraceCheckUtils]: 61: Hoare triple {3300#(= (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; {3304#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:46,656 INFO L272 TraceCheckUtils]: 62: Hoare triple {3304#(= (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); {3308#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:45:46,658 INFO L290 TraceCheckUtils]: 63: Hoare triple {3308#(= |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; {3312#(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:46,658 INFO L290 TraceCheckUtils]: 64: Hoare triple {3312#(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]; {3316#(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:46,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {3316#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {3316#(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:46,661 INFO L290 TraceCheckUtils]: 66: Hoare triple {3316#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3316#(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:46,662 INFO L290 TraceCheckUtils]: 67: Hoare triple {3316#(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; {3316#(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:46,662 INFO L290 TraceCheckUtils]: 68: Hoare triple {3316#(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; {3316#(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:46,662 INFO L290 TraceCheckUtils]: 69: Hoare triple {3316#(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; {3316#(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:46,663 INFO L290 TraceCheckUtils]: 70: Hoare triple {3316#(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; {3316#(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:46,663 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3316#(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)))} {3304#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #423#return; {3304#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:46,664 INFO L290 TraceCheckUtils]: 72: Hoare triple {3304#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {3111#false} is VALID [2022-02-20 23:45:46,664 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:46,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:45:47,037 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:45:47,038 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:47,125 INFO L290 TraceCheckUtils]: 72: Hoare triple {3304#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {3111#false} is VALID [2022-02-20 23:45:47,126 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3347#(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)))} {3304#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #423#return; {3304#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:47,127 INFO L290 TraceCheckUtils]: 70: Hoare triple {3347#(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; {3347#(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:47,127 INFO L290 TraceCheckUtils]: 69: Hoare triple {3347#(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; {3347#(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:47,128 INFO L290 TraceCheckUtils]: 68: Hoare triple {3347#(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; {3347#(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:47,128 INFO L290 TraceCheckUtils]: 67: Hoare triple {3347#(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; {3347#(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:47,129 INFO L290 TraceCheckUtils]: 66: Hoare triple {3347#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3347#(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:47,130 INFO L290 TraceCheckUtils]: 65: Hoare triple {3347#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {3347#(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:47,130 INFO L290 TraceCheckUtils]: 64: Hoare triple {3369#(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]; {3347#(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:47,132 INFO L290 TraceCheckUtils]: 63: Hoare triple {3347#(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; {3369#(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:47,132 INFO L272 TraceCheckUtils]: 62: Hoare triple {3304#(= (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); {3347#(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:47,132 INFO L290 TraceCheckUtils]: 61: Hoare triple {3300#(= (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; {3304#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:47,133 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3293#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {3110#true} #421#return; {3300#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:45:47,135 INFO L290 TraceCheckUtils]: 59: Hoare triple {3293#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {3293#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:47,135 INFO L290 TraceCheckUtils]: 58: Hoare triple {3289#(= (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; {3293#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:47,136 INFO L290 TraceCheckUtils]: 57: Hoare triple {3285#(= (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; {3289#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:45:47,136 INFO L290 TraceCheckUtils]: 56: Hoare triple {3275#(= (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; {3285#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:47,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {3275#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3275#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:47,138 INFO L290 TraceCheckUtils]: 54: Hoare triple {3275#(= (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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {3275#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:47,138 INFO L290 TraceCheckUtils]: 53: Hoare triple {3271#(= |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]; {3275#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:47,138 INFO L290 TraceCheckUtils]: 52: Hoare triple {3110#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; {3271#(= |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:47,138 INFO L272 TraceCheckUtils]: 51: Hoare triple {3110#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {3110#true} is VALID [2022-02-20 23:45:47,139 INFO L290 TraceCheckUtils]: 50: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,139 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3110#true} {3110#true} #419#return; {3110#true} is VALID [2022-02-20 23:45:47,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {3110#true} assume true; {3110#true} is VALID [2022-02-20 23:45:47,140 INFO L290 TraceCheckUtils]: 46: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,140 INFO L290 TraceCheckUtils]: 45: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,141 INFO L290 TraceCheckUtils]: 44: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,147 INFO L290 TraceCheckUtils]: 43: Hoare triple {3110#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3110#true} is VALID [2022-02-20 23:45:47,147 INFO L290 TraceCheckUtils]: 42: Hoare triple {3110#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {3110#true} is VALID [2022-02-20 23:45:47,147 INFO L290 TraceCheckUtils]: 41: Hoare triple {3110#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3110#true} is VALID [2022-02-20 23:45:47,148 INFO L290 TraceCheckUtils]: 40: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,148 INFO L272 TraceCheckUtils]: 39: Hoare triple {3110#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {3110#true} is VALID [2022-02-20 23:45:47,148 INFO L290 TraceCheckUtils]: 38: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,149 INFO L290 TraceCheckUtils]: 37: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,149 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3110#true} {3110#true} #417#return; {3110#true} is VALID [2022-02-20 23:45:47,149 INFO L290 TraceCheckUtils]: 35: Hoare triple {3110#true} assume true; {3110#true} is VALID [2022-02-20 23:45:47,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {3110#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3110#true} is VALID [2022-02-20 23:45:47,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {3110#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {3110#true} is VALID [2022-02-20 23:45:47,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {3110#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3110#true} is VALID [2022-02-20 23:45:47,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,150 INFO L272 TraceCheckUtils]: 27: Hoare triple {3110#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {3110#true} is VALID [2022-02-20 23:45:47,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,150 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3110#true} {3110#true} #415#return; {3110#true} is VALID [2022-02-20 23:45:47,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {3110#true} assume true; {3110#true} is VALID [2022-02-20 23:45:47,151 INFO L290 TraceCheckUtils]: 22: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {3110#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3110#true} is VALID [2022-02-20 23:45:47,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {3110#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {3110#true} is VALID [2022-02-20 23:45:47,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {3110#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3110#true} is VALID [2022-02-20 23:45:47,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,152 INFO L272 TraceCheckUtils]: 15: Hoare triple {3110#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {3110#true} is VALID [2022-02-20 23:45:47,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,152 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3110#true} {3110#true} #413#return; {3110#true} is VALID [2022-02-20 23:45:47,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {3110#true} assume true; {3110#true} is VALID [2022-02-20 23:45:47,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {3110#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3110#true} is VALID [2022-02-20 23:45:47,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {3110#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {3110#true} is VALID [2022-02-20 23:45:47,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {3110#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3110#true} is VALID [2022-02-20 23:45:47,153 INFO L290 TraceCheckUtils]: 4: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,153 INFO L272 TraceCheckUtils]: 3: Hoare triple {3110#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {3110#true} is VALID [2022-02-20 23:45:47,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {3110#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; {3110#true} is VALID [2022-02-20 23:45:47,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {3110#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {3110#true} is VALID [2022-02-20 23:45:47,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {3110#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); {3110#true} is VALID [2022-02-20 23:45:47,155 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:47,155 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:47,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527559666] [2022-02-20 23:45:47,155 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:47,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210258839] [2022-02-20 23:45:47,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210258839] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:45:47,155 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:45:47,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2022-02-20 23:45:47,156 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506747717] [2022-02-20 23:45:47,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:45:47,157 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:47,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:47,158 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:47,197 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:47,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:45:47,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:47,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:45:47,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:45:47,201 INFO L87 Difference]: Start difference. First operand 234 states and 264 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:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:59,037 INFO L93 Difference]: Finished difference Result 250 states and 284 transitions. [2022-02-20 23:45:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:45:59,038 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:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:59,038 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:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 286 transitions. [2022-02-20 23:45:59,041 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:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 286 transitions. [2022-02-20 23:45:59,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 286 transitions. [2022-02-20 23:45:59,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:59,233 INFO L225 Difference]: With dead ends: 250 [2022-02-20 23:45:59,233 INFO L226 Difference]: Without dead ends: 250 [2022-02-20 23:45:59,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:45:59,234 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 100 mSDsluCounter, 1686 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:59,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 1921 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 662 Invalid, 0 Unknown, 254 Unchecked, 0.4s Time] [2022-02-20 23:45:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-02-20 23:45:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 241. [2022-02-20 23:45:59,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:59,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand has 241 states, 143 states have (on average 1.7272727272727273) internal successors, (247), 225 states have internal predecessors, (247), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:59,245 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand has 241 states, 143 states have (on average 1.7272727272727273) internal successors, (247), 225 states have internal predecessors, (247), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:59,246 INFO L87 Difference]: Start difference. First operand 250 states. Second operand has 241 states, 143 states have (on average 1.7272727272727273) internal successors, (247), 225 states have internal predecessors, (247), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:59,255 INFO L93 Difference]: Finished difference Result 250 states and 284 transitions. [2022-02-20 23:45:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 284 transitions. [2022-02-20 23:45:59,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:59,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:59,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 143 states have (on average 1.7272727272727273) internal successors, (247), 225 states have internal predecessors, (247), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 250 states. [2022-02-20 23:45:59,257 INFO L87 Difference]: Start difference. First operand has 241 states, 143 states have (on average 1.7272727272727273) internal successors, (247), 225 states have internal predecessors, (247), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 250 states. [2022-02-20 23:45:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:59,263 INFO L93 Difference]: Finished difference Result 250 states and 284 transitions. [2022-02-20 23:45:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 284 transitions. [2022-02-20 23:45:59,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:59,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:59,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:59,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 143 states have (on average 1.7272727272727273) internal successors, (247), 225 states have internal predecessors, (247), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:45:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 271 transitions. [2022-02-20 23:45:59,270 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 271 transitions. Word has length 73 [2022-02-20 23:45:59,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:59,273 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 271 transitions. [2022-02-20 23:45:59,273 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:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 271 transitions. [2022-02-20 23:45:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 23:45:59,275 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:59,275 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:59,297 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:59,493 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:59,494 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 83 more)] === [2022-02-20 23:45:59,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1116483669, now seen corresponding path program 1 times [2022-02-20 23:45:59,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:59,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110024096] [2022-02-20 23:45:59,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:59,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:59,513 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:59,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755982946] [2022-02-20 23:45:59,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:59,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:59,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:59,515 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:59,516 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:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:59,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 53 conjunts are in the unsatisfiable core [2022-02-20 23:45:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:59,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:59,829 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:04,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:04,019 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:04,048 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:46:04,048 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:04,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {4571#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); {4571#true} is VALID [2022-02-20 23:46:04,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {4571#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {4571#true} is VALID [2022-02-20 23:46:04,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,110 INFO L272 TraceCheckUtils]: 3: Hoare triple {4571#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {4571#true} is VALID [2022-02-20 23:46:04,110 INFO L290 TraceCheckUtils]: 4: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {4571#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4571#true} is VALID [2022-02-20 23:46:04,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {4571#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {4571#true} is VALID [2022-02-20 23:46:04,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {4571#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4571#true} is VALID [2022-02-20 23:46:04,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {4571#true} assume true; {4571#true} is VALID [2022-02-20 23:46:04,111 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4571#true} {4571#true} #413#return; {4571#true} is VALID [2022-02-20 23:46:04,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,111 INFO L272 TraceCheckUtils]: 15: Hoare triple {4571#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {4571#true} is VALID [2022-02-20 23:46:04,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {4571#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4571#true} is VALID [2022-02-20 23:46:04,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {4571#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {4571#true} is VALID [2022-02-20 23:46:04,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {4571#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4571#true} is VALID [2022-02-20 23:46:04,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {4571#true} assume true; {4571#true} is VALID [2022-02-20 23:46:04,115 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4571#true} {4571#true} #415#return; {4571#true} is VALID [2022-02-20 23:46:04,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,116 INFO L272 TraceCheckUtils]: 27: Hoare triple {4571#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {4571#true} is VALID [2022-02-20 23:46:04,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {4571#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4571#true} is VALID [2022-02-20 23:46:04,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {4571#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {4571#true} is VALID [2022-02-20 23:46:04,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {4571#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4571#true} is VALID [2022-02-20 23:46:04,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,117 INFO L290 TraceCheckUtils]: 35: Hoare triple {4571#true} assume true; {4571#true} is VALID [2022-02-20 23:46:04,117 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4571#true} {4571#true} #417#return; {4571#true} is VALID [2022-02-20 23:46:04,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,121 INFO L272 TraceCheckUtils]: 39: Hoare triple {4571#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {4571#true} is VALID [2022-02-20 23:46:04,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {4571#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4571#true} is VALID [2022-02-20 23:46:04,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {4571#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {4571#true} is VALID [2022-02-20 23:46:04,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {4571#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4571#true} is VALID [2022-02-20 23:46:04,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,122 INFO L290 TraceCheckUtils]: 46: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {4571#true} assume true; {4571#true} is VALID [2022-02-20 23:46:04,122 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4571#true} {4571#true} #419#return; {4571#true} is VALID [2022-02-20 23:46:04,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,122 INFO L290 TraceCheckUtils]: 50: Hoare triple {4571#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; {4571#true} is VALID [2022-02-20 23:46:04,122 INFO L272 TraceCheckUtils]: 51: Hoare triple {4571#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {4571#true} is VALID [2022-02-20 23:46:04,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {4571#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; {4732#(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:04,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {4732#(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]; {4736#(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:04,128 INFO L290 TraceCheckUtils]: 54: Hoare triple {4736#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {4736#(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:04,129 INFO L290 TraceCheckUtils]: 55: Hoare triple {4736#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4736#(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:04,129 INFO L290 TraceCheckUtils]: 56: Hoare triple {4736#(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; {4746#(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:04,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {4746#(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; {4750#(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:04,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {4750#(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; {4754#(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:04,132 INFO L290 TraceCheckUtils]: 59: Hoare triple {4754#(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; {4754#(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:04,133 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4754#(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))} {4571#true} #421#return; {4761#(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:04,134 INFO L290 TraceCheckUtils]: 61: Hoare triple {4761#(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; {4765#(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:04,135 INFO L272 TraceCheckUtils]: 62: Hoare triple {4765#(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); {4769#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:46:04,136 INFO L290 TraceCheckUtils]: 63: Hoare triple {4769#(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; {4773#(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:04,137 INFO L290 TraceCheckUtils]: 64: Hoare triple {4773#(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]; {4773#(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:04,137 INFO L290 TraceCheckUtils]: 65: Hoare triple {4773#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {4773#(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:04,138 INFO L290 TraceCheckUtils]: 66: Hoare triple {4773#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4773#(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:04,139 INFO L290 TraceCheckUtils]: 67: Hoare triple {4773#(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; {4773#(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:04,139 INFO L290 TraceCheckUtils]: 68: Hoare triple {4773#(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; {4773#(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:04,140 INFO L290 TraceCheckUtils]: 69: Hoare triple {4773#(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; {4773#(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:04,141 INFO L290 TraceCheckUtils]: 70: Hoare triple {4773#(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; {4773#(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:04,144 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4773#(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|)))} {4765#(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))} #423#return; {4798#(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:04,145 INFO L290 TraceCheckUtils]: 72: Hoare triple {4798#(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); {4572#false} is VALID [2022-02-20 23:46:04,146 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:04,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:04,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:04,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110024096] [2022-02-20 23:46:04,307 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:04,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755982946] [2022-02-20 23:46:04,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755982946] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:46:04,307 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:46:04,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 23:46:04,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535645871] [2022-02-20 23:46:04,307 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:04,307 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:04,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:04,308 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:04,351 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:04,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:46:04,352 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:04,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:46:04,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:46:04,352 INFO L87 Difference]: Start difference. First operand 241 states and 271 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:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:07,681 INFO L93 Difference]: Finished difference Result 341 states and 391 transitions. [2022-02-20 23:46:07,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:46:07,682 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:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:07,682 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:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 383 transitions. [2022-02-20 23:46:07,686 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:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 383 transitions. [2022-02-20 23:46:07,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 383 transitions. [2022-02-20 23:46:07,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:07,962 INFO L225 Difference]: With dead ends: 341 [2022-02-20 23:46:07,962 INFO L226 Difference]: Without dead ends: 341 [2022-02-20 23:46:07,962 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:07,963 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 112 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 738 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:07,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 908 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1188 Invalid, 0 Unknown, 738 Unchecked, 1.1s Time] [2022-02-20 23:46:07,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-02-20 23:46:07,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 240. [2022-02-20 23:46:07,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:07,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 341 states. Second operand has 240 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 224 states have internal predecessors, (246), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:46:07,987 INFO L74 IsIncluded]: Start isIncluded. First operand 341 states. Second operand has 240 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 224 states have internal predecessors, (246), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:46:07,987 INFO L87 Difference]: Start difference. First operand 341 states. Second operand has 240 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 224 states have internal predecessors, (246), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:46:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:08,001 INFO L93 Difference]: Finished difference Result 341 states and 391 transitions. [2022-02-20 23:46:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 391 transitions. [2022-02-20 23:46:08,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:08,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:08,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 224 states have internal predecessors, (246), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 341 states. [2022-02-20 23:46:08,004 INFO L87 Difference]: Start difference. First operand has 240 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 224 states have internal predecessors, (246), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 341 states. [2022-02-20 23:46:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:08,029 INFO L93 Difference]: Finished difference Result 341 states and 391 transitions. [2022-02-20 23:46:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 391 transitions. [2022-02-20 23:46:08,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:08,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:08,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:08,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 143 states have (on average 1.7202797202797202) internal successors, (246), 224 states have internal predecessors, (246), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:46:08,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 270 transitions. [2022-02-20 23:46:08,036 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 270 transitions. Word has length 73 [2022-02-20 23:46:08,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:08,037 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 270 transitions. [2022-02-20 23:46:08,037 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:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 270 transitions. [2022-02-20 23:46:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 23:46:08,037 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:08,038 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:08,068 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:08,267 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:08,268 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 83 more)] === [2022-02-20 23:46:08,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:08,268 INFO L85 PathProgramCache]: Analyzing trace with hash 801017355, now seen corresponding path program 1 times [2022-02-20 23:46:08,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:08,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002046782] [2022-02-20 23:46:08,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:08,314 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:08,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406553533] [2022-02-20 23:46:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:08,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:08,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:08,317 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:08,318 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:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:08,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:46:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:08,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:08,799 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:08,799 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:09,026 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:09,027 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:09,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {6083#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); {6083#true} is VALID [2022-02-20 23:46:09,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {6083#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {6083#true} is VALID [2022-02-20 23:46:09,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,048 INFO L272 TraceCheckUtils]: 3: Hoare triple {6083#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {6083#true} is VALID [2022-02-20 23:46:09,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {6083#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6083#true} is VALID [2022-02-20 23:46:09,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {6083#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {6083#true} is VALID [2022-02-20 23:46:09,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {6083#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6083#true} is VALID [2022-02-20 23:46:09,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {6083#true} assume true; {6083#true} is VALID [2022-02-20 23:46:09,049 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6083#true} {6083#true} #413#return; {6083#true} is VALID [2022-02-20 23:46:09,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,049 INFO L272 TraceCheckUtils]: 15: Hoare triple {6083#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {6083#true} is VALID [2022-02-20 23:46:09,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {6083#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6083#true} is VALID [2022-02-20 23:46:09,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {6083#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {6083#true} is VALID [2022-02-20 23:46:09,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {6083#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6083#true} is VALID [2022-02-20 23:46:09,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {6083#true} assume true; {6083#true} is VALID [2022-02-20 23:46:09,051 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6083#true} {6083#true} #415#return; {6083#true} is VALID [2022-02-20 23:46:09,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,051 INFO L272 TraceCheckUtils]: 27: Hoare triple {6083#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {6083#true} is VALID [2022-02-20 23:46:09,053 INFO L290 TraceCheckUtils]: 28: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,053 INFO L290 TraceCheckUtils]: 29: Hoare triple {6083#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6083#true} is VALID [2022-02-20 23:46:09,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {6083#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {6083#true} is VALID [2022-02-20 23:46:09,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {6083#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6083#true} is VALID [2022-02-20 23:46:09,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {6083#true} assume true; {6083#true} is VALID [2022-02-20 23:46:09,055 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6083#true} {6083#true} #417#return; {6083#true} is VALID [2022-02-20 23:46:09,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,055 INFO L290 TraceCheckUtils]: 38: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,055 INFO L272 TraceCheckUtils]: 39: Hoare triple {6083#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {6083#true} is VALID [2022-02-20 23:46:09,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {6083#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; {6208#(= |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:09,056 INFO L290 TraceCheckUtils]: 41: Hoare triple {6208#(= |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]; {6212#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:09,056 INFO L290 TraceCheckUtils]: 42: Hoare triple {6212#(= (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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {6212#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:09,056 INFO L290 TraceCheckUtils]: 43: Hoare triple {6212#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6212#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:09,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {6212#(= (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; {6222#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:09,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {6222#(= (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; {6226#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:09,058 INFO L290 TraceCheckUtils]: 46: Hoare triple {6226#(= (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; {6230#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:09,058 INFO L290 TraceCheckUtils]: 47: Hoare triple {6230#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {6230#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:09,059 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6230#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {6083#true} #419#return; {6237#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} is VALID [2022-02-20 23:46:09,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {6237#(= (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; {6241#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:46:09,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {6241#(= (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; {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:09,060 INFO L272 TraceCheckUtils]: 51: Hoare triple {6245#(= (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); {6249#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:09,062 INFO L290 TraceCheckUtils]: 52: Hoare triple {6249#(= |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; {6253#(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:09,062 INFO L290 TraceCheckUtils]: 53: Hoare triple {6253#(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]; {6257#(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:09,063 INFO L290 TraceCheckUtils]: 54: Hoare triple {6257#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {6257#(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:09,064 INFO L290 TraceCheckUtils]: 55: Hoare triple {6257#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6257#(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:09,064 INFO L290 TraceCheckUtils]: 56: Hoare triple {6257#(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; {6257#(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:09,065 INFO L290 TraceCheckUtils]: 57: Hoare triple {6257#(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; {6257#(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:09,066 INFO L290 TraceCheckUtils]: 58: Hoare triple {6257#(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; {6257#(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:09,066 INFO L290 TraceCheckUtils]: 59: Hoare triple {6257#(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; {6257#(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:09,067 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6257#(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)))} {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #421#return; {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:09,068 INFO L290 TraceCheckUtils]: 61: Hoare triple {6245#(= (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; {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:09,068 INFO L272 TraceCheckUtils]: 62: Hoare triple {6245#(= (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); {6249#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:09,069 INFO L290 TraceCheckUtils]: 63: Hoare triple {6249#(= |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; {6253#(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:09,070 INFO L290 TraceCheckUtils]: 64: Hoare triple {6253#(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]; {6257#(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:09,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {6257#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {6257#(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:09,071 INFO L290 TraceCheckUtils]: 66: Hoare triple {6257#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6257#(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:09,072 INFO L290 TraceCheckUtils]: 67: Hoare triple {6257#(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; {6257#(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:09,072 INFO L290 TraceCheckUtils]: 68: Hoare triple {6257#(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; {6257#(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:09,073 INFO L290 TraceCheckUtils]: 69: Hoare triple {6257#(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; {6257#(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:09,074 INFO L290 TraceCheckUtils]: 70: Hoare triple {6257#(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; {6257#(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:09,075 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6257#(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)))} {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #423#return; {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:09,075 INFO L290 TraceCheckUtils]: 72: Hoare triple {6245#(= (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 {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:09,075 INFO L290 TraceCheckUtils]: 73: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:09,076 INFO L290 TraceCheckUtils]: 74: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} assume !(1 == #valid[l4_insert_~list#1.base]); {6084#false} is VALID [2022-02-20 23:46:09,076 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:09,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:09,724 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:46:09,725 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:09,825 INFO L290 TraceCheckUtils]: 74: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} assume !(1 == #valid[l4_insert_~list#1.base]); {6084#false} is VALID [2022-02-20 23:46:09,825 INFO L290 TraceCheckUtils]: 73: Hoare triple {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:09,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {6245#(= (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 {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:09,827 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {6333#(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))))} {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #423#return; {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:09,827 INFO L290 TraceCheckUtils]: 70: Hoare triple {6333#(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; {6333#(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:09,828 INFO L290 TraceCheckUtils]: 69: Hoare triple {6333#(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; {6333#(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:09,828 INFO L290 TraceCheckUtils]: 68: Hoare triple {6333#(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; {6333#(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:09,828 INFO L290 TraceCheckUtils]: 67: Hoare triple {6333#(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; {6333#(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:09,829 INFO L290 TraceCheckUtils]: 66: Hoare triple {6333#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6333#(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:09,829 INFO L290 TraceCheckUtils]: 65: Hoare triple {6333#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {6333#(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:09,829 INFO L290 TraceCheckUtils]: 64: Hoare triple {6355#(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]; {6333#(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:09,832 INFO L290 TraceCheckUtils]: 63: Hoare triple {6333#(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; {6355#(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:09,837 INFO L272 TraceCheckUtils]: 62: Hoare triple {6245#(= (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); {6333#(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:09,837 INFO L290 TraceCheckUtils]: 61: Hoare triple {6245#(= (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; {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:09,838 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6333#(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))))} {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #421#return; {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:09,839 INFO L290 TraceCheckUtils]: 59: Hoare triple {6333#(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; {6333#(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:09,839 INFO L290 TraceCheckUtils]: 58: Hoare triple {6333#(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; {6333#(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:09,839 INFO L290 TraceCheckUtils]: 57: Hoare triple {6333#(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; {6333#(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:09,840 INFO L290 TraceCheckUtils]: 56: Hoare triple {6333#(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; {6333#(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:09,840 INFO L290 TraceCheckUtils]: 55: Hoare triple {6333#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6333#(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:09,840 INFO L290 TraceCheckUtils]: 54: Hoare triple {6333#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {6333#(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:09,849 INFO L290 TraceCheckUtils]: 53: Hoare triple {6355#(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]; {6333#(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:09,852 INFO L290 TraceCheckUtils]: 52: Hoare triple {6333#(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; {6355#(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:09,854 INFO L272 TraceCheckUtils]: 51: Hoare triple {6245#(= (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); {6333#(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:09,855 INFO L290 TraceCheckUtils]: 50: Hoare triple {6241#(= (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; {6245#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:09,855 INFO L290 TraceCheckUtils]: 49: Hoare triple {6237#(= (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; {6241#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:46:09,856 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6230#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {6083#true} #419#return; {6237#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} is VALID [2022-02-20 23:46:09,856 INFO L290 TraceCheckUtils]: 47: Hoare triple {6230#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {6230#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:09,856 INFO L290 TraceCheckUtils]: 46: Hoare triple {6226#(= (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; {6230#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:09,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {6222#(= (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; {6226#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:09,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {6212#(= (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; {6222#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:09,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {6212#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6212#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:09,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {6212#(= (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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {6212#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:09,858 INFO L290 TraceCheckUtils]: 41: Hoare triple {6208#(= |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]; {6212#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:09,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {6083#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; {6208#(= |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:09,858 INFO L272 TraceCheckUtils]: 39: Hoare triple {6083#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {6083#true} is VALID [2022-02-20 23:46:09,858 INFO L290 TraceCheckUtils]: 38: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,858 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6083#true} {6083#true} #417#return; {6083#true} is VALID [2022-02-20 23:46:09,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {6083#true} assume true; {6083#true} is VALID [2022-02-20 23:46:09,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,859 INFO L290 TraceCheckUtils]: 32: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {6083#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6083#true} is VALID [2022-02-20 23:46:09,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {6083#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {6083#true} is VALID [2022-02-20 23:46:09,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {6083#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6083#true} is VALID [2022-02-20 23:46:09,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,859 INFO L272 TraceCheckUtils]: 27: Hoare triple {6083#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {6083#true} is VALID [2022-02-20 23:46:09,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,859 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6083#true} {6083#true} #415#return; {6083#true} is VALID [2022-02-20 23:46:09,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {6083#true} assume true; {6083#true} is VALID [2022-02-20 23:46:09,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {6083#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6083#true} is VALID [2022-02-20 23:46:09,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {6083#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {6083#true} is VALID [2022-02-20 23:46:09,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {6083#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6083#true} is VALID [2022-02-20 23:46:09,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,860 INFO L272 TraceCheckUtils]: 15: Hoare triple {6083#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {6083#true} is VALID [2022-02-20 23:46:09,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,861 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6083#true} {6083#true} #413#return; {6083#true} is VALID [2022-02-20 23:46:09,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {6083#true} assume true; {6083#true} is VALID [2022-02-20 23:46:09,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {6083#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6083#true} is VALID [2022-02-20 23:46:09,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {6083#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {6083#true} is VALID [2022-02-20 23:46:09,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {6083#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6083#true} is VALID [2022-02-20 23:46:09,861 INFO L290 TraceCheckUtils]: 4: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,861 INFO L272 TraceCheckUtils]: 3: Hoare triple {6083#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {6083#true} is VALID [2022-02-20 23:46:09,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {6083#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; {6083#true} is VALID [2022-02-20 23:46:09,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {6083#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {6083#true} is VALID [2022-02-20 23:46:09,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {6083#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); {6083#true} is VALID [2022-02-20 23:46:09,865 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:09,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:09,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002046782] [2022-02-20 23:46:09,866 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:09,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406553533] [2022-02-20 23:46:09,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406553533] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:46:09,866 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:46:09,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2022-02-20 23:46:09,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338764297] [2022-02-20 23:46:09,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:09,867 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:09,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:09,869 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:09,913 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:09,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:46:09,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:46:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:46:09,914 INFO L87 Difference]: Start difference. First operand 240 states and 270 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:19,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:19,885 INFO L93 Difference]: Finished difference Result 273 states and 311 transitions. [2022-02-20 23:46:19,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:46:19,886 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:19,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:19,886 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:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 295 transitions. [2022-02-20 23:46:19,888 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:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 295 transitions. [2022-02-20 23:46:19,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 295 transitions. [2022-02-20 23:46:20,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:20,107 INFO L225 Difference]: With dead ends: 273 [2022-02-20 23:46:20,107 INFO L226 Difference]: Without dead ends: 273 [2022-02-20 23:46:20,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 131 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:20,108 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 151 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:20,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 1874 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 761 Invalid, 0 Unknown, 133 Unchecked, 0.5s Time] [2022-02-20 23:46:20,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-02-20 23:46:20,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 264. [2022-02-20 23:46:20,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:20,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 264 states, 164 states have (on average 1.6402439024390243) internal successors, (269), 244 states have internal predecessors, (269), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-02-20 23:46:20,113 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 264 states, 164 states have (on average 1.6402439024390243) internal successors, (269), 244 states have internal predecessors, (269), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-02-20 23:46:20,113 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 264 states, 164 states have (on average 1.6402439024390243) internal successors, (269), 244 states have internal predecessors, (269), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-02-20 23:46:20,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:20,118 INFO L93 Difference]: Finished difference Result 273 states and 311 transitions. [2022-02-20 23:46:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 311 transitions. [2022-02-20 23:46:20,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:20,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:20,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 164 states have (on average 1.6402439024390243) internal successors, (269), 244 states have internal predecessors, (269), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Second operand 273 states. [2022-02-20 23:46:20,121 INFO L87 Difference]: Start difference. First operand has 264 states, 164 states have (on average 1.6402439024390243) internal successors, (269), 244 states have internal predecessors, (269), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) Second operand 273 states. [2022-02-20 23:46:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:20,126 INFO L93 Difference]: Finished difference Result 273 states and 311 transitions. [2022-02-20 23:46:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 311 transitions. [2022-02-20 23:46:20,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:20,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:20,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:20,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 164 states have (on average 1.6402439024390243) internal successors, (269), 244 states have internal predecessors, (269), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-02-20 23:46:20,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 299 transitions. [2022-02-20 23:46:20,133 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 299 transitions. Word has length 75 [2022-02-20 23:46:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:20,133 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 299 transitions. [2022-02-20 23:46:20,133 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:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 299 transitions. [2022-02-20 23:46:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 23:46:20,134 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:20,134 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:20,158 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:20,352 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:20,353 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 83 more)] === [2022-02-20 23:46:20,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash 801017356, now seen corresponding path program 1 times [2022-02-20 23:46:20,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:20,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479539353] [2022-02-20 23:46:20,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:20,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:20,370 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:20,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970380021] [2022-02-20 23:46:20,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:20,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:20,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:20,372 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:20,373 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:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:20,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 73 conjunts are in the unsatisfiable core [2022-02-20 23:46:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:20,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:20,655 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:27,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:27,831 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:27,873 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:46:27,874 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:28,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:28,506 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:28,552 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-20 23:46:28,553 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:28,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {7651#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); {7651#true} is VALID [2022-02-20 23:46:28,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {7651#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {7651#true} is VALID [2022-02-20 23:46:28,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,730 INFO L272 TraceCheckUtils]: 3: Hoare triple {7651#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {7651#true} is VALID [2022-02-20 23:46:28,730 INFO L290 TraceCheckUtils]: 4: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {7651#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7651#true} is VALID [2022-02-20 23:46:28,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {7651#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {7651#true} is VALID [2022-02-20 23:46:28,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {7651#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7651#true} is VALID [2022-02-20 23:46:28,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {7651#true} assume true; {7651#true} is VALID [2022-02-20 23:46:28,731 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7651#true} {7651#true} #413#return; {7651#true} is VALID [2022-02-20 23:46:28,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,732 INFO L272 TraceCheckUtils]: 15: Hoare triple {7651#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {7651#true} is VALID [2022-02-20 23:46:28,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {7651#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7651#true} is VALID [2022-02-20 23:46:28,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {7651#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {7651#true} is VALID [2022-02-20 23:46:28,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {7651#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7651#true} is VALID [2022-02-20 23:46:28,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {7651#true} assume true; {7651#true} is VALID [2022-02-20 23:46:28,733 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7651#true} {7651#true} #415#return; {7651#true} is VALID [2022-02-20 23:46:28,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,733 INFO L272 TraceCheckUtils]: 27: Hoare triple {7651#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {7651#true} is VALID [2022-02-20 23:46:28,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {7651#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7651#true} is VALID [2022-02-20 23:46:28,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {7651#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {7651#true} is VALID [2022-02-20 23:46:28,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {7651#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7651#true} is VALID [2022-02-20 23:46:28,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {7651#true} assume true; {7651#true} is VALID [2022-02-20 23:46:28,734 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7651#true} {7651#true} #417#return; {7651#true} is VALID [2022-02-20 23:46:28,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {7651#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; {7651#true} is VALID [2022-02-20 23:46:28,735 INFO L272 TraceCheckUtils]: 39: Hoare triple {7651#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {7651#true} is VALID [2022-02-20 23:46:28,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {7651#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; {7776#(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:28,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {7776#(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]; {7780#(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:28,744 INFO L290 TraceCheckUtils]: 42: Hoare triple {7780#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {7780#(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:28,745 INFO L290 TraceCheckUtils]: 43: Hoare triple {7780#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7780#(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:28,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {7780#(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; {7790#(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:28,760 INFO L290 TraceCheckUtils]: 45: Hoare triple {7790#(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; {7794#(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:28,762 INFO L290 TraceCheckUtils]: 46: Hoare triple {7794#(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; {7798#(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:28,764 INFO L290 TraceCheckUtils]: 47: Hoare triple {7798#(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; {7798#(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:28,765 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7798#(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))} {7651#true} #419#return; {7805#(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:28,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {7805#(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; {7809#(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:28,766 INFO L290 TraceCheckUtils]: 50: Hoare triple {7809#(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; {7813#(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:28,767 INFO L272 TraceCheckUtils]: 51: Hoare triple {7813#(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); {7817#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:46:28,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {7817#(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; {7821#(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:28,769 INFO L290 TraceCheckUtils]: 53: Hoare triple {7821#(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]; {7825#(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:28,770 INFO L290 TraceCheckUtils]: 54: Hoare triple {7825#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {7825#(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:28,771 INFO L290 TraceCheckUtils]: 55: Hoare triple {7825#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7825#(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:28,772 INFO L290 TraceCheckUtils]: 56: Hoare triple {7825#(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; {7825#(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:28,773 INFO L290 TraceCheckUtils]: 57: Hoare triple {7825#(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; {7825#(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:28,773 INFO L290 TraceCheckUtils]: 58: Hoare triple {7825#(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; {7825#(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:28,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {7825#(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; {7825#(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:28,778 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7825#(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)))} {7813#(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))))} #421#return; {7847#(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:28,779 INFO L290 TraceCheckUtils]: 61: Hoare triple {7847#(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; {7847#(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:28,781 INFO L272 TraceCheckUtils]: 62: Hoare triple {7847#(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); {7817#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:46:28,783 INFO L290 TraceCheckUtils]: 63: Hoare triple {7817#(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; {7857#(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:28,784 INFO L290 TraceCheckUtils]: 64: Hoare triple {7857#(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]; {7857#(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:28,784 INFO L290 TraceCheckUtils]: 65: Hoare triple {7857#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {7857#(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:28,785 INFO L290 TraceCheckUtils]: 66: Hoare triple {7857#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7857#(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:28,786 INFO L290 TraceCheckUtils]: 67: Hoare triple {7857#(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; {7857#(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:28,786 INFO L290 TraceCheckUtils]: 68: Hoare triple {7857#(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; {7857#(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:28,787 INFO L290 TraceCheckUtils]: 69: Hoare triple {7857#(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; {7857#(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:28,787 INFO L290 TraceCheckUtils]: 70: Hoare triple {7857#(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; {7857#(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:28,803 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7857#(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|)))} {7847#(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))))} #423#return; {7882#(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:28,805 INFO L290 TraceCheckUtils]: 72: Hoare triple {7882#(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 {7882#(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:28,807 INFO L290 TraceCheckUtils]: 73: Hoare triple {7882#(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; {7882#(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:28,808 INFO L290 TraceCheckUtils]: 74: Hoare triple {7882#(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); {7652#false} is VALID [2022-02-20 23:46:28,809 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:28,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:29,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:29,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479539353] [2022-02-20 23:46:29,013 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:29,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970380021] [2022-02-20 23:46:29,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970380021] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:46:29,013 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:46:29,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-02-20 23:46:29,014 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557504217] [2022-02-20 23:46:29,014 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:29,014 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:29,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:29,015 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:29,077 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:29,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:46:29,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:29,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:46:29,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:46:29,079 INFO L87 Difference]: Start difference. First operand 264 states and 299 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:33,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:33,621 INFO L93 Difference]: Finished difference Result 370 states and 426 transitions. [2022-02-20 23:46:33,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:46:33,621 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:33,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:33,621 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:33,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 392 transitions. [2022-02-20 23:46:33,624 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:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 392 transitions. [2022-02-20 23:46:33,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 392 transitions. [2022-02-20 23:46:34,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:34,019 INFO L225 Difference]: With dead ends: 370 [2022-02-20 23:46:34,019 INFO L226 Difference]: Without dead ends: 370 [2022-02-20 23:46:34,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:46:34,020 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 114 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 951 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:34,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 815 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1172 Invalid, 0 Unknown, 951 Unchecked, 1.5s Time] [2022-02-20 23:46:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-02-20 23:46:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 269. [2022-02-20 23:46:34,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:34,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 370 states. Second operand has 269 states, 168 states have (on average 1.625) internal successors, (273), 247 states have internal predecessors, (273), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-02-20 23:46:34,025 INFO L74 IsIncluded]: Start isIncluded. First operand 370 states. Second operand has 269 states, 168 states have (on average 1.625) internal successors, (273), 247 states have internal predecessors, (273), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-02-20 23:46:34,026 INFO L87 Difference]: Start difference. First operand 370 states. Second operand has 269 states, 168 states have (on average 1.625) internal successors, (273), 247 states have internal predecessors, (273), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-02-20 23:46:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:34,034 INFO L93 Difference]: Finished difference Result 370 states and 426 transitions. [2022-02-20 23:46:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 426 transitions. [2022-02-20 23:46:34,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:34,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:34,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 269 states, 168 states have (on average 1.625) internal successors, (273), 247 states have internal predecessors, (273), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) Second operand 370 states. [2022-02-20 23:46:34,036 INFO L87 Difference]: Start difference. First operand has 269 states, 168 states have (on average 1.625) internal successors, (273), 247 states have internal predecessors, (273), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) Second operand 370 states. [2022-02-20 23:46:34,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:34,044 INFO L93 Difference]: Finished difference Result 370 states and 426 transitions. [2022-02-20 23:46:34,044 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 426 transitions. [2022-02-20 23:46:34,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:34,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:34,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:34,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 168 states have (on average 1.625) internal successors, (273), 247 states have internal predecessors, (273), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-02-20 23:46:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 305 transitions. [2022-02-20 23:46:34,051 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 305 transitions. Word has length 75 [2022-02-20 23:46:34,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:34,051 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 305 transitions. [2022-02-20 23:46:34,051 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:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 305 transitions. [2022-02-20 23:46:34,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 23:46:34,052 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:34,052 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:34,072 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:34,267 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:34,267 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 83 more)] === [2022-02-20 23:46:34,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:34,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1579784161, now seen corresponding path program 1 times [2022-02-20 23:46:34,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:34,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607755979] [2022-02-20 23:46:34,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:34,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:34,293 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:34,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189498708] [2022-02-20 23:46:34,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:34,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:34,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:34,308 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:34,351 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:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:34,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:46:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:34,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:34,837 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:34,838 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:35,037 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:35,037 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:35,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {9295#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); {9295#true} is VALID [2022-02-20 23:46:35,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {9295#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {9295#true} is VALID [2022-02-20 23:46:35,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,058 INFO L272 TraceCheckUtils]: 3: Hoare triple {9295#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {9295#true} is VALID [2022-02-20 23:46:35,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {9295#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9295#true} is VALID [2022-02-20 23:46:35,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {9295#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {9295#true} is VALID [2022-02-20 23:46:35,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {9295#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9295#true} is VALID [2022-02-20 23:46:35,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {9295#true} assume true; {9295#true} is VALID [2022-02-20 23:46:35,060 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9295#true} {9295#true} #413#return; {9295#true} is VALID [2022-02-20 23:46:35,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,060 INFO L272 TraceCheckUtils]: 15: Hoare triple {9295#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {9295#true} is VALID [2022-02-20 23:46:35,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {9295#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9295#true} is VALID [2022-02-20 23:46:35,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {9295#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {9295#true} is VALID [2022-02-20 23:46:35,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {9295#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9295#true} is VALID [2022-02-20 23:46:35,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,061 INFO L290 TraceCheckUtils]: 21: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {9295#true} assume true; {9295#true} is VALID [2022-02-20 23:46:35,061 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9295#true} {9295#true} #415#return; {9295#true} is VALID [2022-02-20 23:46:35,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,062 INFO L272 TraceCheckUtils]: 27: Hoare triple {9295#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {9295#true} is VALID [2022-02-20 23:46:35,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {9295#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9295#true} is VALID [2022-02-20 23:46:35,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {9295#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {9295#true} is VALID [2022-02-20 23:46:35,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {9295#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9295#true} is VALID [2022-02-20 23:46:35,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {9295#true} assume true; {9295#true} is VALID [2022-02-20 23:46:35,063 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9295#true} {9295#true} #417#return; {9295#true} is VALID [2022-02-20 23:46:35,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,063 INFO L272 TraceCheckUtils]: 39: Hoare triple {9295#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {9295#true} is VALID [2022-02-20 23:46:35,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {9295#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; {9420#(= |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:35,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {9420#(= |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]; {9424#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:35,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {9424#(= (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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {9424#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:35,065 INFO L290 TraceCheckUtils]: 43: Hoare triple {9424#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9424#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:35,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {9424#(= (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; {9434#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:35,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {9434#(= (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; {9438#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:35,066 INFO L290 TraceCheckUtils]: 46: Hoare triple {9438#(= (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; {9442#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:35,066 INFO L290 TraceCheckUtils]: 47: Hoare triple {9442#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {9442#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:35,067 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9442#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {9295#true} #419#return; {9449#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} is VALID [2022-02-20 23:46:35,067 INFO L290 TraceCheckUtils]: 49: Hoare triple {9449#(= (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; {9453#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:46:35,068 INFO L290 TraceCheckUtils]: 50: Hoare triple {9453#(= (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; {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:35,068 INFO L272 TraceCheckUtils]: 51: Hoare triple {9457#(= (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); {9461#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:35,071 INFO L290 TraceCheckUtils]: 52: Hoare triple {9461#(= |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; {9465#(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:35,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {9465#(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]; {9469#(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:35,073 INFO L290 TraceCheckUtils]: 54: Hoare triple {9469#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {9469#(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:35,074 INFO L290 TraceCheckUtils]: 55: Hoare triple {9469#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#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~loopctr40#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr40#1 := #Ultimate.C_memset_#value#1 % 256];#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr40#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr40#1 := 1 + #Ultimate.C_memset_#t~loopctr40#1; {9469#(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:35,075 INFO L290 TraceCheckUtils]: 56: Hoare triple {9469#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9469#(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:35,076 INFO L290 TraceCheckUtils]: 57: Hoare triple {9469#(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; {9469#(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:35,077 INFO L290 TraceCheckUtils]: 58: Hoare triple {9469#(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; {9469#(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:35,077 INFO L290 TraceCheckUtils]: 59: Hoare triple {9469#(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; {9469#(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:35,078 INFO L290 TraceCheckUtils]: 60: Hoare triple {9469#(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; {9469#(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:35,079 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {9469#(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)))} {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #421#return; {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:35,079 INFO L290 TraceCheckUtils]: 62: Hoare triple {9457#(= (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; {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:35,080 INFO L272 TraceCheckUtils]: 63: Hoare triple {9457#(= (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); {9461#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:35,083 INFO L290 TraceCheckUtils]: 64: Hoare triple {9461#(= |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; {9465#(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:35,084 INFO L290 TraceCheckUtils]: 65: Hoare triple {9465#(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]; {9469#(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:35,084 INFO L290 TraceCheckUtils]: 66: Hoare triple {9469#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {9469#(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:35,085 INFO L290 TraceCheckUtils]: 67: Hoare triple {9469#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9469#(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:35,086 INFO L290 TraceCheckUtils]: 68: Hoare triple {9469#(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; {9469#(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:35,087 INFO L290 TraceCheckUtils]: 69: Hoare triple {9469#(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; {9469#(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:35,087 INFO L290 TraceCheckUtils]: 70: Hoare triple {9469#(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; {9469#(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:35,088 INFO L290 TraceCheckUtils]: 71: Hoare triple {9469#(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; {9469#(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:35,089 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {9469#(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)))} {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #423#return; {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:35,089 INFO L290 TraceCheckUtils]: 73: Hoare triple {9457#(= (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 {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:35,089 INFO L290 TraceCheckUtils]: 74: Hoare triple {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:35,090 INFO L290 TraceCheckUtils]: 75: Hoare triple {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} assume !(1 == #valid[l4_insert_~list#1.base]); {9296#false} is VALID [2022-02-20 23:46:35,090 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:35,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:35,763 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:46:35,763 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:35,834 INFO L290 TraceCheckUtils]: 75: Hoare triple {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} assume !(1 == #valid[l4_insert_~list#1.base]); {9296#false} is VALID [2022-02-20 23:46:35,835 INFO L290 TraceCheckUtils]: 74: Hoare triple {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:35,835 INFO L290 TraceCheckUtils]: 73: Hoare triple {9457#(= (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 {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:35,836 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {9548#(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)))} {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #423#return; {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:35,836 INFO L290 TraceCheckUtils]: 71: Hoare triple {9548#(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; {9548#(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:35,837 INFO L290 TraceCheckUtils]: 70: Hoare triple {9548#(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; {9548#(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:35,838 INFO L290 TraceCheckUtils]: 69: Hoare triple {9548#(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; {9548#(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:35,838 INFO L290 TraceCheckUtils]: 68: Hoare triple {9548#(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; {9548#(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:35,839 INFO L290 TraceCheckUtils]: 67: Hoare triple {9548#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9548#(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:35,840 INFO L290 TraceCheckUtils]: 66: Hoare triple {9548#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {9548#(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:35,840 INFO L290 TraceCheckUtils]: 65: Hoare triple {9570#(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]; {9548#(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:35,843 INFO L290 TraceCheckUtils]: 64: Hoare triple {9548#(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; {9570#(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:35,844 INFO L272 TraceCheckUtils]: 63: Hoare triple {9457#(= (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); {9548#(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:35,845 INFO L290 TraceCheckUtils]: 62: Hoare triple {9457#(= (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; {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:35,846 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {9548#(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)))} {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #421#return; {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:35,846 INFO L290 TraceCheckUtils]: 60: Hoare triple {9548#(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; {9548#(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:35,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {9548#(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; {9548#(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:35,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {9548#(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; {9548#(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:35,848 INFO L290 TraceCheckUtils]: 57: Hoare triple {9548#(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; {9548#(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:35,849 INFO L290 TraceCheckUtils]: 56: Hoare triple {9548#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9548#(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:35,850 INFO L290 TraceCheckUtils]: 55: Hoare triple {9548#(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~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#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~loopctr40#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr40#1 := #Ultimate.C_memset_#value#1 % 256];#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr40#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr40#1 := 1 + #Ultimate.C_memset_#t~loopctr40#1; {9548#(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:35,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {9548#(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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {9548#(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:35,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {9570#(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]; {9548#(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:35,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {9548#(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; {9570#(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:35,855 INFO L272 TraceCheckUtils]: 51: Hoare triple {9457#(= (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); {9548#(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:35,855 INFO L290 TraceCheckUtils]: 50: Hoare triple {9453#(= (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; {9457#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:35,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {9449#(= (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; {9453#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:46:35,856 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9442#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {9295#true} #419#return; {9449#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} is VALID [2022-02-20 23:46:35,857 INFO L290 TraceCheckUtils]: 47: Hoare triple {9442#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {9442#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:35,857 INFO L290 TraceCheckUtils]: 46: Hoare triple {9438#(= (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; {9442#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:35,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {9434#(= (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; {9438#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:35,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {9424#(= (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; {9434#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:35,858 INFO L290 TraceCheckUtils]: 43: Hoare triple {9424#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9424#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:35,858 INFO L290 TraceCheckUtils]: 42: Hoare triple {9424#(= (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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {9424#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:35,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {9420#(= |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]; {9424#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:35,859 INFO L290 TraceCheckUtils]: 40: Hoare triple {9295#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; {9420#(= |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:35,859 INFO L272 TraceCheckUtils]: 39: Hoare triple {9295#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {9295#true} is VALID [2022-02-20 23:46:35,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,859 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9295#true} {9295#true} #417#return; {9295#true} is VALID [2022-02-20 23:46:35,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {9295#true} assume true; {9295#true} is VALID [2022-02-20 23:46:35,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,860 INFO L290 TraceCheckUtils]: 32: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,860 INFO L290 TraceCheckUtils]: 31: Hoare triple {9295#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9295#true} is VALID [2022-02-20 23:46:35,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {9295#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {9295#true} is VALID [2022-02-20 23:46:35,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {9295#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9295#true} is VALID [2022-02-20 23:46:35,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,860 INFO L272 TraceCheckUtils]: 27: Hoare triple {9295#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {9295#true} is VALID [2022-02-20 23:46:35,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,860 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9295#true} {9295#true} #415#return; {9295#true} is VALID [2022-02-20 23:46:35,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {9295#true} assume true; {9295#true} is VALID [2022-02-20 23:46:35,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {9295#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9295#true} is VALID [2022-02-20 23:46:35,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {9295#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {9295#true} is VALID [2022-02-20 23:46:35,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {9295#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9295#true} is VALID [2022-02-20 23:46:35,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,861 INFO L272 TraceCheckUtils]: 15: Hoare triple {9295#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {9295#true} is VALID [2022-02-20 23:46:35,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,861 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9295#true} {9295#true} #413#return; {9295#true} is VALID [2022-02-20 23:46:35,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {9295#true} assume true; {9295#true} is VALID [2022-02-20 23:46:35,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {9295#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9295#true} is VALID [2022-02-20 23:46:35,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {9295#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {9295#true} is VALID [2022-02-20 23:46:35,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {9295#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9295#true} is VALID [2022-02-20 23:46:35,862 INFO L290 TraceCheckUtils]: 4: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,862 INFO L272 TraceCheckUtils]: 3: Hoare triple {9295#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {9295#true} is VALID [2022-02-20 23:46:35,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {9295#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; {9295#true} is VALID [2022-02-20 23:46:35,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {9295#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {9295#true} is VALID [2022-02-20 23:46:35,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {9295#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); {9295#true} is VALID [2022-02-20 23:46:35,863 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:35,863 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:35,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607755979] [2022-02-20 23:46:35,863 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:35,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189498708] [2022-02-20 23:46:35,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189498708] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:46:35,863 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:46:35,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2022-02-20 23:46:35,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902420264] [2022-02-20 23:46:35,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:35,864 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:35,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:35,864 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:35,920 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:35,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:46:35,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:35,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:46:35,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:46:35,921 INFO L87 Difference]: Start difference. First operand 269 states and 305 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:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:38,761 INFO L93 Difference]: Finished difference Result 428 states and 496 transitions. [2022-02-20 23:46:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:46:38,762 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:38,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:38,762 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:38,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 453 transitions. [2022-02-20 23:46:38,766 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:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 453 transitions. [2022-02-20 23:46:38,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 453 transitions. [2022-02-20 23:46:39,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 453 edges. 453 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:39,138 INFO L225 Difference]: With dead ends: 428 [2022-02-20 23:46:39,138 INFO L226 Difference]: Without dead ends: 428 [2022-02-20 23:46:39,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 133 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:46:39,138 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 297 mSDsluCounter, 1878 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 413 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:39,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 2067 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 977 Invalid, 0 Unknown, 413 Unchecked, 0.8s Time] [2022-02-20 23:46:39,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-02-20 23:46:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 273. [2022-02-20 23:46:39,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:39,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 428 states. Second operand has 273 states, 172 states have (on average 1.6104651162790697) internal successors, (277), 252 states have internal predecessors, (277), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-02-20 23:46:39,144 INFO L74 IsIncluded]: Start isIncluded. First operand 428 states. Second operand has 273 states, 172 states have (on average 1.6104651162790697) internal successors, (277), 252 states have internal predecessors, (277), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-02-20 23:46:39,145 INFO L87 Difference]: Start difference. First operand 428 states. Second operand has 273 states, 172 states have (on average 1.6104651162790697) internal successors, (277), 252 states have internal predecessors, (277), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-02-20 23:46:39,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:39,154 INFO L93 Difference]: Finished difference Result 428 states and 496 transitions. [2022-02-20 23:46:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 496 transitions. [2022-02-20 23:46:39,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:39,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:39,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 172 states have (on average 1.6104651162790697) internal successors, (277), 252 states have internal predecessors, (277), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Second operand 428 states. [2022-02-20 23:46:39,158 INFO L87 Difference]: Start difference. First operand has 273 states, 172 states have (on average 1.6104651162790697) internal successors, (277), 252 states have internal predecessors, (277), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Second operand 428 states. [2022-02-20 23:46:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:39,168 INFO L93 Difference]: Finished difference Result 428 states and 496 transitions. [2022-02-20 23:46:39,168 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 496 transitions. [2022-02-20 23:46:39,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:39,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:39,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:39,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:39,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 172 states have (on average 1.6104651162790697) internal successors, (277), 252 states have internal predecessors, (277), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-02-20 23:46:39,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 306 transitions. [2022-02-20 23:46:39,176 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 306 transitions. Word has length 76 [2022-02-20 23:46:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:39,176 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 306 transitions. [2022-02-20 23:46:39,176 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:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 306 transitions. [2022-02-20 23:46:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 23:46:39,177 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:39,177 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:39,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-20 23:46:39,403 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:39,403 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 83 more)] === [2022-02-20 23:46:39,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash -938265759, now seen corresponding path program 1 times [2022-02-20 23:46:39,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:39,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688961935] [2022-02-20 23:46:39,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:39,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:39,424 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:39,426 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [371902084] [2022-02-20 23:46:39,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:39,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:39,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:39,427 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:46:39,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 23:46:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:39,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:46:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:39,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:39,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {11337#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); {11337#true} is VALID [2022-02-20 23:46:39,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {11337#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {11337#true} is VALID [2022-02-20 23:46:39,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,843 INFO L272 TraceCheckUtils]: 3: Hoare triple {11337#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {11337#true} is VALID [2022-02-20 23:46:39,843 INFO L290 TraceCheckUtils]: 4: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {11337#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {11337#true} is VALID [2022-02-20 23:46:39,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {11337#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {11337#true} is VALID [2022-02-20 23:46:39,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {11337#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {11337#true} is VALID [2022-02-20 23:46:39,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {11337#true} assume true; {11337#true} is VALID [2022-02-20 23:46:39,844 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11337#true} {11337#true} #413#return; {11337#true} is VALID [2022-02-20 23:46:39,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,844 INFO L272 TraceCheckUtils]: 15: Hoare triple {11337#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {11337#true} is VALID [2022-02-20 23:46:39,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {11337#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {11337#true} is VALID [2022-02-20 23:46:39,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {11337#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {11337#true} is VALID [2022-02-20 23:46:39,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {11337#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {11337#true} is VALID [2022-02-20 23:46:39,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {11337#true} assume true; {11337#true} is VALID [2022-02-20 23:46:39,845 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11337#true} {11337#true} #415#return; {11337#true} is VALID [2022-02-20 23:46:39,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,845 INFO L272 TraceCheckUtils]: 27: Hoare triple {11337#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {11337#true} is VALID [2022-02-20 23:46:39,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {11337#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {11337#true} is VALID [2022-02-20 23:46:39,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {11337#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {11337#true} is VALID [2022-02-20 23:46:39,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {11337#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {11337#true} is VALID [2022-02-20 23:46:39,846 INFO L290 TraceCheckUtils]: 32: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {11337#true} assume true; {11337#true} is VALID [2022-02-20 23:46:39,846 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11337#true} {11337#true} #417#return; {11337#true} is VALID [2022-02-20 23:46:39,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,846 INFO L290 TraceCheckUtils]: 38: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,846 INFO L272 TraceCheckUtils]: 39: Hoare triple {11337#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {11337#true} is VALID [2022-02-20 23:46:39,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {11337#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {11337#true} is VALID [2022-02-20 23:46:39,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {11337#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {11337#true} is VALID [2022-02-20 23:46:39,847 INFO L290 TraceCheckUtils]: 43: Hoare triple {11337#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {11337#true} is VALID [2022-02-20 23:46:39,847 INFO L290 TraceCheckUtils]: 44: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,847 INFO L290 TraceCheckUtils]: 46: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,847 INFO L290 TraceCheckUtils]: 47: Hoare triple {11337#true} assume true; {11337#true} is VALID [2022-02-20 23:46:39,847 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {11337#true} {11337#true} #419#return; {11337#true} is VALID [2022-02-20 23:46:39,847 INFO L290 TraceCheckUtils]: 49: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,847 INFO L290 TraceCheckUtils]: 50: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,847 INFO L272 TraceCheckUtils]: 51: Hoare triple {11337#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {11337#true} is VALID [2022-02-20 23:46:39,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {11337#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; {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} is VALID [2022-02-20 23:46:39,848 INFO L290 TraceCheckUtils]: 53: Hoare triple {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} is VALID [2022-02-20 23:46:39,849 INFO L290 TraceCheckUtils]: 54: Hoare triple {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} 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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} is VALID [2022-02-20 23:46:39,849 INFO L290 TraceCheckUtils]: 55: Hoare triple {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} is VALID [2022-02-20 23:46:39,849 INFO L290 TraceCheckUtils]: 56: Hoare triple {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} 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; {11511#(<= 0 |zalloc_or_die_calloc_model_#res#1.offset|)} is VALID [2022-02-20 23:46:39,850 INFO L290 TraceCheckUtils]: 57: Hoare triple {11511#(<= 0 |zalloc_or_die_calloc_model_#res#1.offset|)} #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; {11515#(<= 0 |zalloc_or_die_~ptr~1#1.offset|)} is VALID [2022-02-20 23:46:39,850 INFO L290 TraceCheckUtils]: 58: Hoare triple {11515#(<= 0 |zalloc_or_die_~ptr~1#1.offset|)} 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; {11519#(<= 0 |zalloc_or_die_#res#1.offset|)} is VALID [2022-02-20 23:46:39,851 INFO L290 TraceCheckUtils]: 59: Hoare triple {11519#(<= 0 |zalloc_or_die_#res#1.offset|)} assume true; {11519#(<= 0 |zalloc_or_die_#res#1.offset|)} is VALID [2022-02-20 23:46:39,851 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11519#(<= 0 |zalloc_or_die_#res#1.offset|)} {11337#true} #421#return; {11526#(<= 0 |ULTIMATE.start_l4_insert_#t~ret6#1.offset|)} is VALID [2022-02-20 23:46:39,852 INFO L290 TraceCheckUtils]: 61: Hoare triple {11526#(<= 0 |ULTIMATE.start_l4_insert_#t~ret6#1.offset|)} 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; {11530#(<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|)} is VALID [2022-02-20 23:46:39,852 INFO L272 TraceCheckUtils]: 62: Hoare triple {11530#(<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {11337#true} is VALID [2022-02-20 23:46:39,852 INFO L290 TraceCheckUtils]: 63: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,852 INFO L290 TraceCheckUtils]: 64: Hoare triple {11337#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {11337#true} is VALID [2022-02-20 23:46:39,852 INFO L290 TraceCheckUtils]: 65: Hoare triple {11337#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {11337#true} is VALID [2022-02-20 23:46:39,852 INFO L290 TraceCheckUtils]: 66: Hoare triple {11337#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {11337#true} is VALID [2022-02-20 23:46:39,852 INFO L290 TraceCheckUtils]: 67: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,853 INFO L290 TraceCheckUtils]: 68: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,853 INFO L290 TraceCheckUtils]: 69: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:39,853 INFO L290 TraceCheckUtils]: 70: Hoare triple {11337#true} assume true; {11337#true} is VALID [2022-02-20 23:46:39,853 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11337#true} {11530#(<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|)} #423#return; {11530#(<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|)} is VALID [2022-02-20 23:46:39,854 INFO L290 TraceCheckUtils]: 72: Hoare triple {11530#(<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|)} 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 {11564#(and (<= (+ 8 |ULTIMATE.start_l4_insert_~item~0#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|))} is VALID [2022-02-20 23:46:39,854 INFO L290 TraceCheckUtils]: 73: Hoare triple {11564#(and (<= (+ 8 |ULTIMATE.start_l4_insert_~item~0#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|))} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {11564#(and (<= (+ 8 |ULTIMATE.start_l4_insert_~item~0#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|))} is VALID [2022-02-20 23:46:39,855 INFO L290 TraceCheckUtils]: 74: Hoare triple {11564#(and (<= (+ 8 |ULTIMATE.start_l4_insert_~item~0#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|))} SUMMARY for call l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset := read~$Pointer$(l4_insert_~list#1.base, l4_insert_~list#1.offset, 4); srcloc: L676 {11564#(and (<= (+ 8 |ULTIMATE.start_l4_insert_~item~0#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|))} is VALID [2022-02-20 23:46:39,856 INFO L290 TraceCheckUtils]: 75: Hoare triple {11564#(and (<= (+ 8 |ULTIMATE.start_l4_insert_~item~0#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|))} assume !(4 + l4_insert_~item~0#1.offset <= #length[l4_insert_~item~0#1.base] && 0 <= l4_insert_~item~0#1.offset); {11338#false} is VALID [2022-02-20 23:46:39,856 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-02-20 23:46:39,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:39,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-02-20 23:46:40,196 INFO L290 TraceCheckUtils]: 75: Hoare triple {11574#(and (<= (+ 4 |ULTIMATE.start_l4_insert_~item~0#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|))} assume !(4 + l4_insert_~item~0#1.offset <= #length[l4_insert_~item~0#1.base] && 0 <= l4_insert_~item~0#1.offset); {11338#false} is VALID [2022-02-20 23:46:40,197 INFO L290 TraceCheckUtils]: 74: Hoare triple {11574#(and (<= (+ 4 |ULTIMATE.start_l4_insert_~item~0#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|))} SUMMARY for call l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset := read~$Pointer$(l4_insert_~list#1.base, l4_insert_~list#1.offset, 4); srcloc: L676 {11574#(and (<= (+ 4 |ULTIMATE.start_l4_insert_~item~0#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|))} is VALID [2022-02-20 23:46:40,197 INFO L290 TraceCheckUtils]: 73: Hoare triple {11574#(and (<= (+ 4 |ULTIMATE.start_l4_insert_~item~0#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|))} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {11574#(and (<= (+ 4 |ULTIMATE.start_l4_insert_~item~0#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|))} is VALID [2022-02-20 23:46:40,198 INFO L290 TraceCheckUtils]: 72: Hoare triple {11530#(<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|)} 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 {11574#(and (<= (+ 4 |ULTIMATE.start_l4_insert_~item~0#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|))} is VALID [2022-02-20 23:46:40,199 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {11337#true} {11530#(<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|)} #423#return; {11530#(<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|)} is VALID [2022-02-20 23:46:40,199 INFO L290 TraceCheckUtils]: 70: Hoare triple {11337#true} assume true; {11337#true} is VALID [2022-02-20 23:46:40,199 INFO L290 TraceCheckUtils]: 69: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,199 INFO L290 TraceCheckUtils]: 68: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,199 INFO L290 TraceCheckUtils]: 67: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {11337#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {11337#true} is VALID [2022-02-20 23:46:40,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {11337#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {11337#true} is VALID [2022-02-20 23:46:40,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {11337#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {11337#true} is VALID [2022-02-20 23:46:40,200 INFO L290 TraceCheckUtils]: 63: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,200 INFO L272 TraceCheckUtils]: 62: Hoare triple {11530#(<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {11337#true} is VALID [2022-02-20 23:46:40,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {11526#(<= 0 |ULTIMATE.start_l4_insert_#t~ret6#1.offset|)} 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; {11530#(<= 0 |ULTIMATE.start_l4_insert_~item~0#1.offset|)} is VALID [2022-02-20 23:46:40,201 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11519#(<= 0 |zalloc_or_die_#res#1.offset|)} {11337#true} #421#return; {11526#(<= 0 |ULTIMATE.start_l4_insert_#t~ret6#1.offset|)} is VALID [2022-02-20 23:46:40,211 INFO L290 TraceCheckUtils]: 59: Hoare triple {11519#(<= 0 |zalloc_or_die_#res#1.offset|)} assume true; {11519#(<= 0 |zalloc_or_die_#res#1.offset|)} is VALID [2022-02-20 23:46:40,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {11515#(<= 0 |zalloc_or_die_~ptr~1#1.offset|)} 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; {11519#(<= 0 |zalloc_or_die_#res#1.offset|)} is VALID [2022-02-20 23:46:40,222 INFO L290 TraceCheckUtils]: 57: Hoare triple {11511#(<= 0 |zalloc_or_die_calloc_model_#res#1.offset|)} #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; {11515#(<= 0 |zalloc_or_die_~ptr~1#1.offset|)} is VALID [2022-02-20 23:46:40,222 INFO L290 TraceCheckUtils]: 56: Hoare triple {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} 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; {11511#(<= 0 |zalloc_or_die_calloc_model_#res#1.offset|)} is VALID [2022-02-20 23:46:40,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} is VALID [2022-02-20 23:46:40,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} 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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} is VALID [2022-02-20 23:46:40,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} is VALID [2022-02-20 23:46:40,224 INFO L290 TraceCheckUtils]: 52: Hoare triple {11337#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; {11498#(<= 0 |zalloc_or_die_calloc_model_~ptr~0#1.offset|)} is VALID [2022-02-20 23:46:40,224 INFO L272 TraceCheckUtils]: 51: Hoare triple {11337#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {11337#true} is VALID [2022-02-20 23:46:40,224 INFO L290 TraceCheckUtils]: 50: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,225 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {11337#true} {11337#true} #419#return; {11337#true} is VALID [2022-02-20 23:46:40,225 INFO L290 TraceCheckUtils]: 47: Hoare triple {11337#true} assume true; {11337#true} is VALID [2022-02-20 23:46:40,225 INFO L290 TraceCheckUtils]: 46: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,225 INFO L290 TraceCheckUtils]: 45: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,225 INFO L290 TraceCheckUtils]: 44: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {11337#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {11337#true} is VALID [2022-02-20 23:46:40,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {11337#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {11337#true} is VALID [2022-02-20 23:46:40,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {11337#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {11337#true} is VALID [2022-02-20 23:46:40,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,226 INFO L272 TraceCheckUtils]: 39: Hoare triple {11337#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {11337#true} is VALID [2022-02-20 23:46:40,226 INFO L290 TraceCheckUtils]: 38: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,226 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11337#true} {11337#true} #417#return; {11337#true} is VALID [2022-02-20 23:46:40,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {11337#true} assume true; {11337#true} is VALID [2022-02-20 23:46:40,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {11337#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {11337#true} is VALID [2022-02-20 23:46:40,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {11337#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {11337#true} is VALID [2022-02-20 23:46:40,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {11337#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {11337#true} is VALID [2022-02-20 23:46:40,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,227 INFO L272 TraceCheckUtils]: 27: Hoare triple {11337#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {11337#true} is VALID [2022-02-20 23:46:40,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,227 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11337#true} {11337#true} #415#return; {11337#true} is VALID [2022-02-20 23:46:40,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {11337#true} assume true; {11337#true} is VALID [2022-02-20 23:46:40,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {11337#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {11337#true} is VALID [2022-02-20 23:46:40,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {11337#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {11337#true} is VALID [2022-02-20 23:46:40,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {11337#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {11337#true} is VALID [2022-02-20 23:46:40,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,228 INFO L272 TraceCheckUtils]: 15: Hoare triple {11337#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {11337#true} is VALID [2022-02-20 23:46:40,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,229 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11337#true} {11337#true} #413#return; {11337#true} is VALID [2022-02-20 23:46:40,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {11337#true} assume true; {11337#true} is VALID [2022-02-20 23:46:40,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {11337#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {11337#true} is VALID [2022-02-20 23:46:40,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {11337#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {11337#true} is VALID [2022-02-20 23:46:40,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {11337#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {11337#true} is VALID [2022-02-20 23:46:40,230 INFO L290 TraceCheckUtils]: 4: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,230 INFO L272 TraceCheckUtils]: 3: Hoare triple {11337#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {11337#true} is VALID [2022-02-20 23:46:40,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {11337#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; {11337#true} is VALID [2022-02-20 23:46:40,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {11337#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {11337#true} is VALID [2022-02-20 23:46:40,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {11337#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); {11337#true} is VALID [2022-02-20 23:46:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-02-20 23:46:40,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:40,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688961935] [2022-02-20 23:46:40,231 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:40,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371902084] [2022-02-20 23:46:40,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371902084] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:46:40,231 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:46:40,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-02-20 23:46:40,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937684707] [2022-02-20 23:46:40,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:40,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76 [2022-02-20 23:46:40,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:40,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:40,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:40,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:46:40,263 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:40,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:46:40,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:46:40,263 INFO L87 Difference]: Start difference. First operand 273 states and 306 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:41,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:41,693 INFO L93 Difference]: Finished difference Result 291 states and 331 transitions. [2022-02-20 23:46:41,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:46:41,693 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 76 [2022-02-20 23:46:41,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 287 transitions. [2022-02-20 23:46:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 287 transitions. [2022-02-20 23:46:41,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 287 transitions. [2022-02-20 23:46:41,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:41,967 INFO L225 Difference]: With dead ends: 291 [2022-02-20 23:46:41,967 INFO L226 Difference]: Without dead ends: 291 [2022-02-20 23:46:41,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:46:41,968 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 317 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:41,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 1533 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:46:41,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-02-20 23:46:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 272. [2022-02-20 23:46:41,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:41,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 272 states, 172 states have (on average 1.6046511627906976) internal successors, (276), 251 states have internal predecessors, (276), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-02-20 23:46:41,983 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 272 states, 172 states have (on average 1.6046511627906976) internal successors, (276), 251 states have internal predecessors, (276), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-02-20 23:46:41,988 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 272 states, 172 states have (on average 1.6046511627906976) internal successors, (276), 251 states have internal predecessors, (276), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-02-20 23:46:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:42,001 INFO L93 Difference]: Finished difference Result 291 states and 331 transitions. [2022-02-20 23:46:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 331 transitions. [2022-02-20 23:46:42,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:42,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:42,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 272 states, 172 states have (on average 1.6046511627906976) internal successors, (276), 251 states have internal predecessors, (276), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Second operand 291 states. [2022-02-20 23:46:42,004 INFO L87 Difference]: Start difference. First operand has 272 states, 172 states have (on average 1.6046511627906976) internal successors, (276), 251 states have internal predecessors, (276), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Second operand 291 states. [2022-02-20 23:46:42,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:42,009 INFO L93 Difference]: Finished difference Result 291 states and 331 transitions. [2022-02-20 23:46:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 331 transitions. [2022-02-20 23:46:42,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:42,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:42,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:42,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 172 states have (on average 1.6046511627906976) internal successors, (276), 251 states have internal predecessors, (276), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-02-20 23:46:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 305 transitions. [2022-02-20 23:46:42,016 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 305 transitions. Word has length 76 [2022-02-20 23:46:42,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:42,016 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 305 transitions. [2022-02-20 23:46:42,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:42,016 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 305 transitions. [2022-02-20 23:46:42,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 23:46:42,017 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:42,017 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, 1, 1] [2022-02-20 23:46:42,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:42,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-02-20 23:46:42,234 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 83 more)] === [2022-02-20 23:46:42,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:42,235 INFO L85 PathProgramCache]: Analyzing trace with hash 269737250, now seen corresponding path program 1 times [2022-02-20 23:46:42,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:42,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734472178] [2022-02-20 23:46:42,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:42,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:42,252 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:42,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1901920550] [2022-02-20 23:46:42,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:42,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:42,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:42,260 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:46:42,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 23:46:42,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:42,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:46:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:42,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:42,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {12950#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); {12950#true} is VALID [2022-02-20 23:46:42,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {12950#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {12950#true} is VALID [2022-02-20 23:46:42,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,552 INFO L272 TraceCheckUtils]: 3: Hoare triple {12950#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {12950#true} is VALID [2022-02-20 23:46:42,553 INFO L290 TraceCheckUtils]: 4: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {12950#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {12950#true} is VALID [2022-02-20 23:46:42,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {12950#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {12950#true} is VALID [2022-02-20 23:46:42,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {12950#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {12950#true} is VALID [2022-02-20 23:46:42,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-02-20 23:46:42,554 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12950#true} {12950#true} #413#return; {12950#true} is VALID [2022-02-20 23:46:42,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,554 INFO L272 TraceCheckUtils]: 15: Hoare triple {12950#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {12950#true} is VALID [2022-02-20 23:46:42,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {12950#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {12950#true} is VALID [2022-02-20 23:46:42,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {12950#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {12950#true} is VALID [2022-02-20 23:46:42,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {12950#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {12950#true} is VALID [2022-02-20 23:46:42,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-02-20 23:46:42,555 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {12950#true} {12950#true} #415#return; {12950#true} is VALID [2022-02-20 23:46:42,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,555 INFO L272 TraceCheckUtils]: 27: Hoare triple {12950#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {12950#true} is VALID [2022-02-20 23:46:42,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {12950#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {12950#true} is VALID [2022-02-20 23:46:42,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {12950#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {12950#true} is VALID [2022-02-20 23:46:42,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {12950#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {12950#true} is VALID [2022-02-20 23:46:42,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-02-20 23:46:42,556 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12950#true} {12950#true} #417#return; {12950#true} is VALID [2022-02-20 23:46:42,556 INFO L290 TraceCheckUtils]: 37: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,557 INFO L272 TraceCheckUtils]: 39: Hoare triple {12950#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {12950#true} is VALID [2022-02-20 23:46:42,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {12950#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {12950#true} is VALID [2022-02-20 23:46:42,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {12950#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {12950#true} is VALID [2022-02-20 23:46:42,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {12950#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {12950#true} is VALID [2022-02-20 23:46:42,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,557 INFO L290 TraceCheckUtils]: 45: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,558 INFO L290 TraceCheckUtils]: 46: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,558 INFO L290 TraceCheckUtils]: 47: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-02-20 23:46:42,558 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12950#true} {12950#true} #419#return; {12950#true} is VALID [2022-02-20 23:46:42,558 INFO L290 TraceCheckUtils]: 49: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,558 INFO L290 TraceCheckUtils]: 50: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,558 INFO L272 TraceCheckUtils]: 51: Hoare triple {12950#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {12950#true} is VALID [2022-02-20 23:46:42,558 INFO L290 TraceCheckUtils]: 52: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,558 INFO L290 TraceCheckUtils]: 53: Hoare triple {12950#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {12950#true} is VALID [2022-02-20 23:46:42,559 INFO L290 TraceCheckUtils]: 54: Hoare triple {12950#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {12950#true} is VALID [2022-02-20 23:46:42,559 INFO L290 TraceCheckUtils]: 55: Hoare triple {12950#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {12950#true} is VALID [2022-02-20 23:46:42,559 INFO L290 TraceCheckUtils]: 56: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,559 INFO L290 TraceCheckUtils]: 57: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,559 INFO L290 TraceCheckUtils]: 58: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,559 INFO L290 TraceCheckUtils]: 59: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-02-20 23:46:42,559 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {12950#true} {12950#true} #421#return; {12950#true} is VALID [2022-02-20 23:46:42,559 INFO L290 TraceCheckUtils]: 61: Hoare triple {12950#true} 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; {12950#true} is VALID [2022-02-20 23:46:42,559 INFO L272 TraceCheckUtils]: 62: Hoare triple {12950#true} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {12950#true} is VALID [2022-02-20 23:46:42,560 INFO L290 TraceCheckUtils]: 63: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,560 INFO L290 TraceCheckUtils]: 64: Hoare triple {12950#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {12950#true} is VALID [2022-02-20 23:46:42,560 INFO L290 TraceCheckUtils]: 65: Hoare triple {12950#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {12950#true} is VALID [2022-02-20 23:46:42,560 INFO L290 TraceCheckUtils]: 66: Hoare triple {12950#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {12950#true} is VALID [2022-02-20 23:46:42,560 INFO L290 TraceCheckUtils]: 67: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,560 INFO L290 TraceCheckUtils]: 68: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,560 INFO L290 TraceCheckUtils]: 69: Hoare triple {12950#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; {12950#true} is VALID [2022-02-20 23:46:42,560 INFO L290 TraceCheckUtils]: 70: Hoare triple {12950#true} assume true; {12950#true} is VALID [2022-02-20 23:46:42,561 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12950#true} {12950#true} #423#return; {12950#true} is VALID [2022-02-20 23:46:42,561 INFO L290 TraceCheckUtils]: 72: Hoare triple {12950#true} 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 {12950#true} is VALID [2022-02-20 23:46:42,561 INFO L290 TraceCheckUtils]: 73: Hoare triple {12950#true} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {12950#true} is VALID [2022-02-20 23:46:42,561 INFO L290 TraceCheckUtils]: 74: Hoare triple {12950#true} SUMMARY for call l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset := read~$Pointer$(l4_insert_~list#1.base, l4_insert_~list#1.offset, 4); srcloc: L676 {13177#(and (<= (+ 4 |ULTIMATE.start_l4_insert_~list#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} is VALID [2022-02-20 23:46:42,562 INFO L290 TraceCheckUtils]: 75: Hoare triple {13177#(and (<= (+ 4 |ULTIMATE.start_l4_insert_~list#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} SUMMARY for call write~$Pointer$(l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset, 4); srcloc: L676-1 {13177#(and (<= (+ 4 |ULTIMATE.start_l4_insert_~list#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} is VALID [2022-02-20 23:46:42,562 INFO L290 TraceCheckUtils]: 76: Hoare triple {13177#(and (<= (+ 4 |ULTIMATE.start_l4_insert_~list#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} havoc l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset; {13177#(and (<= (+ 4 |ULTIMATE.start_l4_insert_~list#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} is VALID [2022-02-20 23:46:42,562 INFO L290 TraceCheckUtils]: 77: Hoare triple {13177#(and (<= (+ 4 |ULTIMATE.start_l4_insert_~list#1.offset|) (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|)) (<= 0 |ULTIMATE.start_l4_insert_~list#1.offset|))} assume !(4 + l4_insert_~list#1.offset <= #length[l4_insert_~list#1.base] && 0 <= l4_insert_~list#1.offset); {12951#false} is VALID [2022-02-20 23:46:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-02-20 23:46:42,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:42,563 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:42,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734472178] [2022-02-20 23:46:42,563 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:42,563 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901920550] [2022-02-20 23:46:42,563 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901920550] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:42,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:42,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:42,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621946902] [2022-02-20 23:46:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:42,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 78 [2022-02-20 23:46:42,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:42,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 23:46:42,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:42,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:42,591 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:42,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:42,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:42,591 INFO L87 Difference]: Start difference. First operand 272 states and 305 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 23:46:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:43,002 INFO L93 Difference]: Finished difference Result 279 states and 316 transitions. [2022-02-20 23:46:43,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:43,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 78 [2022-02-20 23:46:43,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 23:46:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2022-02-20 23:46:43,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 23:46:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2022-02-20 23:46:43,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 272 transitions. [2022-02-20 23:46:43,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:43,301 INFO L225 Difference]: With dead ends: 279 [2022-02-20 23:46:43,301 INFO L226 Difference]: Without dead ends: 279 [2022-02-20 23:46:43,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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:46:43,302 INFO L933 BasicCegarLoop]: 231 mSDtfsCounter, 94 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:43,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 357 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:43,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-02-20 23:46:43,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 271. [2022-02-20 23:46:43,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:43,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 279 states. Second operand has 271 states, 172 states have (on average 1.5988372093023255) internal successors, (275), 250 states have internal predecessors, (275), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-02-20 23:46:43,305 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand has 271 states, 172 states have (on average 1.5988372093023255) internal successors, (275), 250 states have internal predecessors, (275), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-02-20 23:46:43,306 INFO L87 Difference]: Start difference. First operand 279 states. Second operand has 271 states, 172 states have (on average 1.5988372093023255) internal successors, (275), 250 states have internal predecessors, (275), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-02-20 23:46:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:43,313 INFO L93 Difference]: Finished difference Result 279 states and 316 transitions. [2022-02-20 23:46:43,313 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 316 transitions. [2022-02-20 23:46:43,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:43,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:43,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 271 states, 172 states have (on average 1.5988372093023255) internal successors, (275), 250 states have internal predecessors, (275), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Second operand 279 states. [2022-02-20 23:46:43,315 INFO L87 Difference]: Start difference. First operand has 271 states, 172 states have (on average 1.5988372093023255) internal successors, (275), 250 states have internal predecessors, (275), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Second operand 279 states. [2022-02-20 23:46:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:43,319 INFO L93 Difference]: Finished difference Result 279 states and 316 transitions. [2022-02-20 23:46:43,320 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 316 transitions. [2022-02-20 23:46:43,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:43,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:43,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:43,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:43,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 172 states have (on average 1.5988372093023255) internal successors, (275), 250 states have internal predecessors, (275), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-02-20 23:46:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 304 transitions. [2022-02-20 23:46:43,325 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 304 transitions. Word has length 78 [2022-02-20 23:46:43,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:43,325 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 304 transitions. [2022-02-20 23:46:43,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-20 23:46:43,325 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 304 transitions. [2022-02-20 23:46:43,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 23:46:43,326 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:43,326 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, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:43,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:43,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 23:46:43,542 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 83 more)] === [2022-02-20 23:46:43,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:43,543 INFO L85 PathProgramCache]: Analyzing trace with hash -88647287, now seen corresponding path program 1 times [2022-02-20 23:46:43,543 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:43,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211945538] [2022-02-20 23:46:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:43,570 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:43,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881109571] [2022-02-20 23:46:43,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:43,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:43,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:43,588 INFO L229 MonitoredProcess]: Starting monitored process 11 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:43,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 23:46:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:43,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-20 23:46:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:43,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:44,081 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:46:44,082 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:44,292 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:46:44,293 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:44,494 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:44,494 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:44,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {14294#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); {14294#true} is VALID [2022-02-20 23:46:44,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {14294#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, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset; {14294#true} is VALID [2022-02-20 23:46:44,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 23:46:44,529 INFO L272 TraceCheckUtils]: 3: Hoare triple {14294#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {14294#true} is VALID [2022-02-20 23:46:44,529 INFO L290 TraceCheckUtils]: 4: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 23:46:44,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {14294#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {14294#true} is VALID [2022-02-20 23:46:44,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {14294#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {14294#true} is VALID [2022-02-20 23:46:44,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {14294#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {14294#true} is VALID [2022-02-20 23:46:44,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 23:46:44,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 23:46:44,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 23:46:44,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {14294#true} assume true; {14294#true} is VALID [2022-02-20 23:46:44,529 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {14294#true} {14294#true} #413#return; {14294#true} is VALID [2022-02-20 23:46:44,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 23:46:44,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 23:46:44,530 INFO L272 TraceCheckUtils]: 15: Hoare triple {14294#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {14294#true} is VALID [2022-02-20 23:46:44,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 23:46:44,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {14294#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {14294#true} is VALID [2022-02-20 23:46:44,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {14294#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {14294#true} is VALID [2022-02-20 23:46:44,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {14294#true} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {14294#true} is VALID [2022-02-20 23:46:44,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 23:46:44,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 23:46:44,530 INFO L290 TraceCheckUtils]: 22: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 23:46:44,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {14294#true} assume true; {14294#true} is VALID [2022-02-20 23:46:44,530 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {14294#true} {14294#true} #415#return; {14294#true} is VALID [2022-02-20 23:46:44,530 INFO L290 TraceCheckUtils]: 25: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 23:46:44,530 INFO L290 TraceCheckUtils]: 26: Hoare triple {14294#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; {14294#true} is VALID [2022-02-20 23:46:44,530 INFO L272 TraceCheckUtils]: 27: Hoare triple {14294#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {14294#true} is VALID [2022-02-20 23:46:44,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {14294#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; {14383#(= |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:44,531 INFO L290 TraceCheckUtils]: 29: Hoare triple {14383#(= |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]; {14387#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:44,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {14387#(= (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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {14387#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:44,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {14387#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {14387#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:44,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {14387#(= (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; {14397#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:44,533 INFO L290 TraceCheckUtils]: 33: Hoare triple {14397#(= (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; {14401#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:44,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {14401#(= (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; {14405#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:44,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {14405#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {14405#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:44,534 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14405#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {14294#true} #417#return; {14412#(= (select |#valid| |ULTIMATE.start_l2_insert_#t~ret12#1.base|) 1)} is VALID [2022-02-20 23:46:44,534 INFO L290 TraceCheckUtils]: 37: Hoare triple {14412#(= (select |#valid| |ULTIMATE.start_l2_insert_#t~ret12#1.base|) 1)} 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; {14416#(= (select |#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1)} is VALID [2022-02-20 23:46:44,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {14416#(= (select |#valid| |ULTIMATE.start_l2_insert_~item~2#1.base|) 1)} 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; {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,535 INFO L272 TraceCheckUtils]: 39: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {14424#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:44,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {14424#(= |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; {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} 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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,540 INFO L290 TraceCheckUtils]: 43: Hoare triple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} 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; {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,541 INFO L290 TraceCheckUtils]: 45: Hoare triple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} #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; {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,542 INFO L290 TraceCheckUtils]: 46: Hoare triple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} 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; {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,542 INFO L290 TraceCheckUtils]: 47: Hoare triple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} assume true; {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,543 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} #419#return; {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,544 INFO L290 TraceCheckUtils]: 49: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#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; {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,544 INFO L290 TraceCheckUtils]: 50: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#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; {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,544 INFO L272 TraceCheckUtils]: 51: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {14424#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:44,546 INFO L290 TraceCheckUtils]: 52: Hoare triple {14424#(= |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; {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,547 INFO L290 TraceCheckUtils]: 53: Hoare triple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,547 INFO L290 TraceCheckUtils]: 54: Hoare triple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} 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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,548 INFO L290 TraceCheckUtils]: 55: Hoare triple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,548 INFO L290 TraceCheckUtils]: 56: Hoare triple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} 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; {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,549 INFO L290 TraceCheckUtils]: 57: Hoare triple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} #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; {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,550 INFO L290 TraceCheckUtils]: 58: Hoare triple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} 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; {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,550 INFO L290 TraceCheckUtils]: 59: Hoare triple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} assume true; {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} is VALID [2022-02-20 23:46:44,551 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {14428#(exists ((v_ArrVal_355 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(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_355) |#valid|)))} {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} #421#return; {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,551 INFO L290 TraceCheckUtils]: 61: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_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; {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,552 INFO L272 TraceCheckUtils]: 62: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {14424#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:44,553 INFO L290 TraceCheckUtils]: 63: Hoare triple {14424#(= |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; {14498#(exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#valid|))} is VALID [2022-02-20 23:46:44,554 INFO L290 TraceCheckUtils]: 64: Hoare triple {14498#(exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#valid|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {14502#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:44,555 INFO L290 TraceCheckUtils]: 65: Hoare triple {14502#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#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~loopctr40#1;#Ultimate.C_memset_#t~loopctr40#1 := 0; {14502#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:44,555 INFO L290 TraceCheckUtils]: 66: Hoare triple {14502#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr40#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {14502#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:44,556 INFO L290 TraceCheckUtils]: 67: Hoare triple {14502#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#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; {14502#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:44,557 INFO L290 TraceCheckUtils]: 68: Hoare triple {14502#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#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; {14502#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:44,557 INFO L290 TraceCheckUtils]: 69: Hoare triple {14502#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#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; {14502#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:44,558 INFO L290 TraceCheckUtils]: 70: Hoare triple {14502#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {14502#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:44,559 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {14502#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_357 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_357) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} #423#return; {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,559 INFO L290 TraceCheckUtils]: 72: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_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 {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,559 INFO L290 TraceCheckUtils]: 73: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,559 INFO L290 TraceCheckUtils]: 74: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} SUMMARY for call l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset := read~$Pointer$(l4_insert_~list#1.base, l4_insert_~list#1.offset, 4); srcloc: L676 {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,560 INFO L290 TraceCheckUtils]: 75: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} SUMMARY for call write~$Pointer$(l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset, l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset, 4); srcloc: L676-1 {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,560 INFO L290 TraceCheckUtils]: 76: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} havoc l4_insert_#t~mem8#1.base, l4_insert_#t~mem8#1.offset; {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,560 INFO L290 TraceCheckUtils]: 77: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} SUMMARY for call write~$Pointer$(l4_insert_~item~0#1.base, l4_insert_~item~0#1.offset, l4_insert_~list#1.base, l4_insert_~list#1.offset, 4); srcloc: L677 {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,561 INFO L290 TraceCheckUtils]: 78: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} assume { :end_inline_l4_insert } true; {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,561 INFO L290 TraceCheckUtils]: 79: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} assume -2147483648 <= l3_insert_#t~nondet10#1 && l3_insert_#t~nondet10#1 <= 2147483647; {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,561 INFO L290 TraceCheckUtils]: 80: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} assume !(0 != l3_insert_#t~nondet10#1);havoc l3_insert_#t~nondet10#1; {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:44,562 INFO L290 TraceCheckUtils]: 81: Hoare triple {14420#(= (select |#valid| |ULTIMATE.start_l3_insert_~list#1.base|) 1)} assume !(1 == #valid[l3_insert_~list#1.base]); {14295#false} is VALID [2022-02-20 23:46:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 73 proven. 40 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-20 23:46:44,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:44,941 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:44,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211945538] [2022-02-20 23:46:44,941 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:44,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881109571] [2022-02-20 23:46:44,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881109571] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:46:44,942 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:46:44,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-02-20 23:46:44,942 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093029413] [2022-02-20 23:46:44,942 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:44,942 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 82 [2022-02-20 23:46:44,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:44,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:44,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:44,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:46:44,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:44,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:46:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:46:44,998 INFO L87 Difference]: Start difference. First operand 271 states and 304 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:47,993 INFO L93 Difference]: Finished difference Result 436 states and 508 transitions. [2022-02-20 23:46:47,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:46:47,994 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 82 [2022-02-20 23:46:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 454 transitions. [2022-02-20 23:46:47,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 454 transitions. [2022-02-20 23:46:47,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 454 transitions. [2022-02-20 23:46:48,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:48,367 INFO L225 Difference]: With dead ends: 436 [2022-02-20 23:46:48,368 INFO L226 Difference]: Without dead ends: 436 [2022-02-20 23:46:48,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:46:48,368 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 270 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1986 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 527 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:48,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 1986 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 958 Invalid, 0 Unknown, 527 Unchecked, 0.8s Time] [2022-02-20 23:46:48,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-02-20 23:46:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 294. [2022-02-20 23:46:48,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:48,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 436 states. Second operand has 294 states, 191 states have (on average 1.5549738219895288) internal successors, (297), 268 states have internal predecessors, (297), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-02-20 23:46:48,378 INFO L74 IsIncluded]: Start isIncluded. First operand 436 states. Second operand has 294 states, 191 states have (on average 1.5549738219895288) internal successors, (297), 268 states have internal predecessors, (297), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-02-20 23:46:48,378 INFO L87 Difference]: Start difference. First operand 436 states. Second operand has 294 states, 191 states have (on average 1.5549738219895288) internal successors, (297), 268 states have internal predecessors, (297), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-02-20 23:46:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:48,388 INFO L93 Difference]: Finished difference Result 436 states and 508 transitions. [2022-02-20 23:46:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 508 transitions. [2022-02-20 23:46:48,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:48,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:48,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 294 states, 191 states have (on average 1.5549738219895288) internal successors, (297), 268 states have internal predecessors, (297), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) Second operand 436 states. [2022-02-20 23:46:48,391 INFO L87 Difference]: Start difference. First operand has 294 states, 191 states have (on average 1.5549738219895288) internal successors, (297), 268 states have internal predecessors, (297), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) Second operand 436 states. [2022-02-20 23:46:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:48,400 INFO L93 Difference]: Finished difference Result 436 states and 508 transitions. [2022-02-20 23:46:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 508 transitions. [2022-02-20 23:46:48,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:48,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:48,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:48,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:48,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 191 states have (on average 1.5549738219895288) internal successors, (297), 268 states have internal predecessors, (297), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-02-20 23:46:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 337 transitions. [2022-02-20 23:46:48,407 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 337 transitions. Word has length 82 [2022-02-20 23:46:48,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:48,408 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 337 transitions. [2022-02-20 23:46:48,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 337 transitions. [2022-02-20 23:46:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-20 23:46:48,408 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:48,409 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, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:48,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:48,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 23:46:48,626 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 83 more)] === [2022-02-20 23:46:48,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:48,626 INFO L85 PathProgramCache]: Analyzing trace with hash -88647286, now seen corresponding path program 1 times [2022-02-20 23:46:48,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:48,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931078100] [2022-02-20 23:46:48,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:48,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:48,651 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:48,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164284196] [2022-02-20 23:46:48,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:48,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:48,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:48,668 INFO L229 MonitoredProcess]: Starting monitored process 12 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:48,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 23:46:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:48,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 97 conjunts are in the unsatisfiable core [2022-02-20 23:46:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:48,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:48,913 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