./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0235-3.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-3.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 02c65307022e35fe6a7161faa785e5b34e94ccda4b82967e279eadaf3aa37bc3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:45:51,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:45:51,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:45:51,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:45:51,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:45:51,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:45:51,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:45:51,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:45:51,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:45:51,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:45:51,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:45:51,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:45:51,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:45:51,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:45:51,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:45:51,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:45:51,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:45:51,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:45:51,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:45:51,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:45:51,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:45:51,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:45:51,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:45:51,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:45:51,366 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:45:51,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:45:51,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:45:51,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:45:51,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:45:51,369 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:45:51,369 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:45:51,370 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:45:51,371 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:45:51,372 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:45:51,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:45:51,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:45:51,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:45:51,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:45:51,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:45:51,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:45:51,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:45:51,376 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:51,405 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:45:51,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:45:51,408 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:45:51,408 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:45:51,409 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:45:51,409 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:45:51,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:45:51,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:45:51,410 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:45:51,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:45:51,411 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:45:51,411 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:45:51,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:45:51,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:45:51,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:45:51,412 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:45:51,412 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:45:51,412 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:45:51,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:45:51,413 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:45:51,413 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:45:51,413 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:45:51,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:45:51,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:45:51,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:45:51,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:51,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:45:51,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:45:51,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:45:51,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:45:51,415 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 -> 02c65307022e35fe6a7161faa785e5b34e94ccda4b82967e279eadaf3aa37bc3 [2022-02-20 23:45:51,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:45:51,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:45:51,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:45:51,687 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:45:51,688 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:45:51,692 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0235-3.i [2022-02-20 23:45:51,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10022a625/665051990d37474bbaef9a23c13bc7df/FLAGbd1131906 [2022-02-20 23:45:52,188 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:45:52,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0235-3.i [2022-02-20 23:45:52,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10022a625/665051990d37474bbaef9a23c13bc7df/FLAGbd1131906 [2022-02-20 23:45:52,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10022a625/665051990d37474bbaef9a23c13bc7df [2022-02-20 23:45:52,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:45:52,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:45:52,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:52,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:45:52,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:45:52,229 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:52" (1/1) ... [2022-02-20 23:45:52,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7314b0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:52, skipping insertion in model container [2022-02-20 23:45:52,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:52" (1/1) ... [2022-02-20 23:45:52,235 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:45:52,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:45:52,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:52,732 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:45:52,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:52,824 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:45:52,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:52 WrapperNode [2022-02-20 23:45:52,825 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:52,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:52,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:45:52,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:45:52,834 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:52" (1/1) ... [2022-02-20 23:45:52,866 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:52" (1/1) ... [2022-02-20 23:45:52,917 INFO L137 Inliner]: procedures = 188, calls = 73, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 240 [2022-02-20 23:45:52,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:52,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:45:52,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:45:52,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:45:52,927 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:52" (1/1) ... [2022-02-20 23:45:52,928 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:52" (1/1) ... [2022-02-20 23:45:52,941 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:52" (1/1) ... [2022-02-20 23:45:52,942 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:52" (1/1) ... [2022-02-20 23:45:52,957 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:52" (1/1) ... [2022-02-20 23:45:52,979 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:52" (1/1) ... [2022-02-20 23:45:52,981 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:52" (1/1) ... [2022-02-20 23:45:52,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:45:52,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:45:52,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:45:52,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:45:52,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:52" (1/1) ... [2022-02-20 23:45:52,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:53,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:53,020 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:53,039 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:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:45:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:45:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:45:53,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:45:53,069 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2022-02-20 23:45:53,069 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2022-02-20 23:45:53,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:45:53,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:45:53,069 INFO L130 BoogieDeclarations]: Found specification of procedure l0_destroy [2022-02-20 23:45:53,070 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_destroy [2022-02-20 23:45:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:45:53,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:45:53,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:45:53,231 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:45:53,233 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:45:53,911 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:45:53,919 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:45:53,920 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 23:45:53,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:53 BoogieIcfgContainer [2022-02-20 23:45:53,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:45:53,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:45:53,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:45:53,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:45:53,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:45:52" (1/3) ... [2022-02-20 23:45:53,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc72556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:53, skipping insertion in model container [2022-02-20 23:45:53,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:52" (2/3) ... [2022-02-20 23:45:53,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc72556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:53, skipping insertion in model container [2022-02-20 23:45:53,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:53" (3/3) ... [2022-02-20 23:45:53,928 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0235-3.i [2022-02-20 23:45:53,933 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:45:53,933 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 89 error locations. [2022-02-20 23:45:53,962 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:45:53,968 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:53,968 INFO L340 AbstractCegarLoop]: Starting to check reachability of 89 error locations. [2022-02-20 23:45:53,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 138 states have (on average 1.8768115942028984) internal successors, (259), 227 states have internal predecessors, (259), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:45:54,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:45:54,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:54,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:45:54,002 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 85 more)] === [2022-02-20 23:45:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:54,007 INFO L85 PathProgramCache]: Analyzing trace with hash 930118, now seen corresponding path program 1 times [2022-02-20 23:45:54,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:54,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672869044] [2022-02-20 23:45:54,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:54,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:54,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {246#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); {246#true} is VALID [2022-02-20 23:45:54,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#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, main_#t~mem39#1.base, main_#t~mem39#1.offset; {246#true} is VALID [2022-02-20 23:45:54,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume !true; {247#false} is VALID [2022-02-20 23:45:54,120 INFO L290 TraceCheckUtils]: 3: Hoare triple {247#false} assume !(1 == #valid[~#list~0.base]); {247#false} is VALID [2022-02-20 23:45:54,120 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:54,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:54,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672869044] [2022-02-20 23:45:54,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672869044] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:54,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:54,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:54,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116707496] [2022-02-20 23:45:54,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:54,129 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:54,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:54,133 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:54,139 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:54,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:45:54,139 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:54,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:45:54,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:45:54,160 INFO L87 Difference]: Start difference. First operand has 243 states, 138 states have (on average 1.8768115942028984) internal successors, (259), 227 states have internal predecessors, (259), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:54,375 INFO L93 Difference]: Finished difference Result 243 states and 274 transitions. [2022-02-20 23:45:54,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:45:54,375 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:54,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:54,377 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:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 285 transitions. [2022-02-20 23:45:54,389 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:54,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 285 transitions. [2022-02-20 23:45:54,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 285 transitions. [2022-02-20 23:45:54,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:54,681 INFO L225 Difference]: With dead ends: 243 [2022-02-20 23:45:54,681 INFO L226 Difference]: Without dead ends: 241 [2022-02-20 23:45:54,683 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:54,686 INFO L933 BasicCegarLoop]: 274 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, 274 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:54,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 274 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:54,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-02-20 23:45:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-02-20 23:45:54,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:54,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 241 states, 137 states have (on average 1.7956204379562044) internal successors, (246), 225 states have internal predecessors, (246), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:45:54,724 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 241 states, 137 states have (on average 1.7956204379562044) internal successors, (246), 225 states have internal predecessors, (246), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:45:54,725 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 241 states, 137 states have (on average 1.7956204379562044) internal successors, (246), 225 states have internal predecessors, (246), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:45:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:54,746 INFO L93 Difference]: Finished difference Result 241 states and 272 transitions. [2022-02-20 23:45:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2022-02-20 23:45:54,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:54,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:54,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 137 states have (on average 1.7956204379562044) internal successors, (246), 225 states have internal predecessors, (246), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 241 states. [2022-02-20 23:45:54,762 INFO L87 Difference]: Start difference. First operand has 241 states, 137 states have (on average 1.7956204379562044) internal successors, (246), 225 states have internal predecessors, (246), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 241 states. [2022-02-20 23:45:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:54,783 INFO L93 Difference]: Finished difference Result 241 states and 272 transitions. [2022-02-20 23:45:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2022-02-20 23:45:54,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:54,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:54,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:54,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 137 states have (on average 1.7956204379562044) internal successors, (246), 225 states have internal predecessors, (246), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:45:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2022-02-20 23:45:54,802 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 4 [2022-02-20 23:45:54,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:54,803 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2022-02-20 23:45:54,803 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:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2022-02-20 23:45:54,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:45:54,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:54,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:45:54,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:45:54,805 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 85 more)] === [2022-02-20 23:45:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:54,807 INFO L85 PathProgramCache]: Analyzing trace with hash 889942911, now seen corresponding path program 1 times [2022-02-20 23:45:54,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:54,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953154135] [2022-02-20 23:45:54,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:54,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:54,837 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:54,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008902362] [2022-02-20 23:45:54,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:54,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:54,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:54,844 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:54,845 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:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:54,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:45:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:54,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:54,990 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:54,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {1216#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); {1216#true} is VALID [2022-02-20 23:45:54,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {1216#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, main_#t~mem39#1.base, main_#t~mem39#1.offset; {1216#true} is VALID [2022-02-20 23:45:54,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {1216#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; {1216#true} is VALID [2022-02-20 23:45:54,997 INFO L272 TraceCheckUtils]: 3: Hoare triple {1216#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {1216#true} is VALID [2022-02-20 23:45:54,998 INFO L290 TraceCheckUtils]: 4: Hoare triple {1216#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; {1233#(= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)} is VALID [2022-02-20 23:45:54,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {1233#(= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)} assume !(1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {1217#false} is VALID [2022-02-20 23:45:54,999 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:54,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:55,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:55,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953154135] [2022-02-20 23:45:55,000 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:55,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008902362] [2022-02-20 23:45:55,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008902362] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:55,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:55,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:55,002 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97046203] [2022-02-20 23:45:55,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:55,003 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:55,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:55,003 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:55,009 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:55,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:55,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:55,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:55,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:55,011 INFO L87 Difference]: Start difference. First operand 241 states and 272 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:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:55,482 INFO L93 Difference]: Finished difference Result 240 states and 271 transitions. [2022-02-20 23:45:55,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:55,483 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:55,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:55,483 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:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2022-02-20 23:45:55,490 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:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2022-02-20 23:45:55,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 272 transitions. [2022-02-20 23:45:55,723 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:45:55,728 INFO L225 Difference]: With dead ends: 240 [2022-02-20 23:45:55,728 INFO L226 Difference]: Without dead ends: 240 [2022-02-20 23:45:55,728 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:55,730 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 9 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:55,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 438 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-02-20 23:45:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2022-02-20 23:45:55,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:55,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 240 states, 137 states have (on average 1.7883211678832116) internal successors, (245), 224 states have internal predecessors, (245), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:45:55,747 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 240 states, 137 states have (on average 1.7883211678832116) internal successors, (245), 224 states have internal predecessors, (245), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:45:55,748 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 240 states, 137 states have (on average 1.7883211678832116) internal successors, (245), 224 states have internal predecessors, (245), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:45:55,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:55,762 INFO L93 Difference]: Finished difference Result 240 states and 271 transitions. [2022-02-20 23:45:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 271 transitions. [2022-02-20 23:45:55,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:55,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:55,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 137 states have (on average 1.7883211678832116) internal successors, (245), 224 states have internal predecessors, (245), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 240 states. [2022-02-20 23:45:55,766 INFO L87 Difference]: Start difference. First operand has 240 states, 137 states have (on average 1.7883211678832116) internal successors, (245), 224 states have internal predecessors, (245), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 240 states. [2022-02-20 23:45:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:55,792 INFO L93 Difference]: Finished difference Result 240 states and 271 transitions. [2022-02-20 23:45:55,793 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 271 transitions. [2022-02-20 23:45:55,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:55,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:55,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:55,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:55,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 137 states have (on average 1.7883211678832116) internal successors, (245), 224 states have internal predecessors, (245), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:45:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 271 transitions. [2022-02-20 23:45:55,805 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 271 transitions. Word has length 6 [2022-02-20 23:45:55,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:55,805 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 271 transitions. [2022-02-20 23:45:55,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:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 271 transitions. [2022-02-20 23:45:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:45:55,806 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:55,806 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:55,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:56,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:56,020 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 85 more)] === [2022-02-20 23:45:56,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:56,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1818426896, now seen corresponding path program 1 times [2022-02-20 23:45:56,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:56,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403166369] [2022-02-20 23:45:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:56,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:56,035 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:56,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1522014988] [2022-02-20 23:45:56,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:56,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:56,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:56,037 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:56,055 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:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:56,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:45:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:56,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:56,464 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:57,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {2196#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); {2196#true} is VALID [2022-02-20 23:45:57,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {2196#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, main_#t~mem39#1.base, main_#t~mem39#1.offset; {2196#true} is VALID [2022-02-20 23:45:57,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {2196#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; {2196#true} is VALID [2022-02-20 23:45:57,016 INFO L272 TraceCheckUtils]: 3: Hoare triple {2196#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {2196#true} is VALID [2022-02-20 23:45:57,019 INFO L290 TraceCheckUtils]: 4: Hoare triple {2196#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; {2213#(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:57,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {2213#(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]; {2213#(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:57,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {2213#(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); {2197#false} is VALID [2022-02-20 23:45:57,021 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:57,021 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:57,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:57,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403166369] [2022-02-20 23:45:57,021 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:57,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522014988] [2022-02-20 23:45:57,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522014988] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:57,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:57,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:57,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806336853] [2022-02-20 23:45:57,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:57,022 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:57,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:57,022 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:57,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:57,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:57,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:57,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:57,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:57,059 INFO L87 Difference]: Start difference. First operand 240 states and 271 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:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:57,334 INFO L93 Difference]: Finished difference Result 239 states and 270 transitions. [2022-02-20 23:45:57,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:57,335 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:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:57,335 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:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2022-02-20 23:45:57,339 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:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2022-02-20 23:45:57,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 271 transitions. [2022-02-20 23:45:57,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:57,527 INFO L225 Difference]: With dead ends: 239 [2022-02-20 23:45:57,527 INFO L226 Difference]: Without dead ends: 239 [2022-02-20 23:45:57,528 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:57,529 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 0 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:57,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 463 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 74 Unchecked, 0.0s Time] [2022-02-20 23:45:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-02-20 23:45:57,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2022-02-20 23:45:57,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:57,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 239 states, 137 states have (on average 1.781021897810219) internal successors, (244), 223 states have internal predecessors, (244), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:45:57,538 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 239 states, 137 states have (on average 1.781021897810219) internal successors, (244), 223 states have internal predecessors, (244), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:45:57,538 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 239 states, 137 states have (on average 1.781021897810219) internal successors, (244), 223 states have internal predecessors, (244), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:45:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:57,546 INFO L93 Difference]: Finished difference Result 239 states and 270 transitions. [2022-02-20 23:45:57,546 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 270 transitions. [2022-02-20 23:45:57,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:57,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:57,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 137 states have (on average 1.781021897810219) internal successors, (244), 223 states have internal predecessors, (244), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 239 states. [2022-02-20 23:45:57,550 INFO L87 Difference]: Start difference. First operand has 239 states, 137 states have (on average 1.781021897810219) internal successors, (244), 223 states have internal predecessors, (244), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 239 states. [2022-02-20 23:45:57,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:57,558 INFO L93 Difference]: Finished difference Result 239 states and 270 transitions. [2022-02-20 23:45:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 270 transitions. [2022-02-20 23:45:57,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:57,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:57,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:57,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:57,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 137 states have (on average 1.781021897810219) internal successors, (244), 223 states have internal predecessors, (244), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:45:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 270 transitions. [2022-02-20 23:45:57,567 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 270 transitions. Word has length 7 [2022-02-20 23:45:57,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:57,568 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 270 transitions. [2022-02-20 23:45:57,568 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:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 270 transitions. [2022-02-20 23:45:57,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 23:45:57,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:57,570 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:57,590 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:57,779 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:57,779 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 85 more)] === [2022-02-20 23:45:57,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:57,780 INFO L85 PathProgramCache]: Analyzing trace with hash 946384938, now seen corresponding path program 1 times [2022-02-20 23:45:57,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:57,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883584279] [2022-02-20 23:45:57,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:57,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:57,819 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:57,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1529304154] [2022-02-20 23:45:57,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:57,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:57,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:57,821 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:57,849 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:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:57,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:45:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:58,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:58,530 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:45:58,531 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:58,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {3175#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); {3175#true} is VALID [2022-02-20 23:45:58,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {3175#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, main_#t~mem39#1.base, main_#t~mem39#1.offset; {3175#true} is VALID [2022-02-20 23:45:58,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,551 INFO L272 TraceCheckUtils]: 3: Hoare triple {3175#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {3175#true} is VALID [2022-02-20 23:45:58,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {3175#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3175#true} is VALID [2022-02-20 23:45:58,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {3175#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {3175#true} is VALID [2022-02-20 23:45:58,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {3175#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3175#true} is VALID [2022-02-20 23:45:58,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 23:45:58,552 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3175#true} {3175#true} #418#return; {3175#true} is VALID [2022-02-20 23:45:58,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,553 INFO L272 TraceCheckUtils]: 15: Hoare triple {3175#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {3175#true} is VALID [2022-02-20 23:45:58,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {3175#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3175#true} is VALID [2022-02-20 23:45:58,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {3175#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {3175#true} is VALID [2022-02-20 23:45:58,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {3175#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3175#true} is VALID [2022-02-20 23:45:58,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 23:45:58,554 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3175#true} {3175#true} #420#return; {3175#true} is VALID [2022-02-20 23:45:58,555 INFO L290 TraceCheckUtils]: 25: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,555 INFO L272 TraceCheckUtils]: 27: Hoare triple {3175#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {3175#true} is VALID [2022-02-20 23:45:58,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {3175#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3175#true} is VALID [2022-02-20 23:45:58,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {3175#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {3175#true} is VALID [2022-02-20 23:45:58,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {3175#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3175#true} is VALID [2022-02-20 23:45:58,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 23:45:58,556 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3175#true} {3175#true} #422#return; {3175#true} is VALID [2022-02-20 23:45:58,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,557 INFO L272 TraceCheckUtils]: 39: Hoare triple {3175#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {3175#true} is VALID [2022-02-20 23:45:58,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {3175#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3175#true} is VALID [2022-02-20 23:45:58,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {3175#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {3175#true} is VALID [2022-02-20 23:45:58,563 INFO L290 TraceCheckUtils]: 43: Hoare triple {3175#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3175#true} is VALID [2022-02-20 23:45:58,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,563 INFO L290 TraceCheckUtils]: 45: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,564 INFO L290 TraceCheckUtils]: 46: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,564 INFO L290 TraceCheckUtils]: 47: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 23:45:58,564 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3175#true} {3175#true} #424#return; {3175#true} is VALID [2022-02-20 23:45:58,564 INFO L290 TraceCheckUtils]: 49: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,565 INFO L290 TraceCheckUtils]: 50: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:58,565 INFO L272 TraceCheckUtils]: 51: Hoare triple {3175#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {3175#true} is VALID [2022-02-20 23:45:58,566 INFO L290 TraceCheckUtils]: 52: Hoare triple {3175#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; {3336#(= |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:58,566 INFO L290 TraceCheckUtils]: 53: Hoare triple {3336#(= |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]; {3340#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:58,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {3340#(= (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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {3340#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:58,567 INFO L290 TraceCheckUtils]: 55: Hoare triple {3340#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3340#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:58,568 INFO L290 TraceCheckUtils]: 56: Hoare triple {3340#(= (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; {3350#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:58,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {3350#(= (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; {3354#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:45:58,571 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#(= (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; {3358#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:58,571 INFO L290 TraceCheckUtils]: 59: Hoare triple {3358#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {3358#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:58,572 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3358#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {3175#true} #426#return; {3365#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:45:58,573 INFO L290 TraceCheckUtils]: 61: Hoare triple {3365#(= (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; {3369#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:58,573 INFO L272 TraceCheckUtils]: 62: Hoare triple {3369#(= (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); {3373#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:45:58,575 INFO L290 TraceCheckUtils]: 63: Hoare triple {3373#(= |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; {3377#(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:58,575 INFO L290 TraceCheckUtils]: 64: Hoare triple {3377#(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]; {3381#(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:58,576 INFO L290 TraceCheckUtils]: 65: Hoare triple {3381#(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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {3381#(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:58,576 INFO L290 TraceCheckUtils]: 66: Hoare triple {3381#(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~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3381#(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:58,577 INFO L290 TraceCheckUtils]: 67: Hoare triple {3381#(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; {3381#(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:58,577 INFO L290 TraceCheckUtils]: 68: Hoare triple {3381#(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; {3381#(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:58,577 INFO L290 TraceCheckUtils]: 69: Hoare triple {3381#(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; {3381#(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:58,578 INFO L290 TraceCheckUtils]: 70: Hoare triple {3381#(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; {3381#(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:58,579 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3381#(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)))} {3369#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #428#return; {3369#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:58,579 INFO L290 TraceCheckUtils]: 72: Hoare triple {3369#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {3176#false} is VALID [2022-02-20 23:45:58,580 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:58,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:45:59,054 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:45:59,054 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:59,184 INFO L290 TraceCheckUtils]: 72: Hoare triple {3369#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {3176#false} is VALID [2022-02-20 23:45:59,186 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3412#(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)))} {3369#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #428#return; {3369#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:59,187 INFO L290 TraceCheckUtils]: 70: Hoare triple {3412#(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; {3412#(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:59,187 INFO L290 TraceCheckUtils]: 69: Hoare triple {3412#(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; {3412#(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:59,188 INFO L290 TraceCheckUtils]: 68: Hoare triple {3412#(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; {3412#(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:59,189 INFO L290 TraceCheckUtils]: 67: Hoare triple {3412#(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; {3412#(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:59,190 INFO L290 TraceCheckUtils]: 66: Hoare triple {3412#(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~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3412#(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:59,191 INFO L290 TraceCheckUtils]: 65: Hoare triple {3412#(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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {3412#(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:59,192 INFO L290 TraceCheckUtils]: 64: Hoare triple {3434#(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]; {3412#(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:59,193 INFO L290 TraceCheckUtils]: 63: Hoare triple {3412#(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; {3434#(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:59,194 INFO L272 TraceCheckUtils]: 62: Hoare triple {3369#(= (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); {3412#(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:59,194 INFO L290 TraceCheckUtils]: 61: Hoare triple {3365#(= (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; {3369#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:59,195 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3358#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {3175#true} #426#return; {3365#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:45:59,196 INFO L290 TraceCheckUtils]: 59: Hoare triple {3358#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {3358#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:59,198 INFO L290 TraceCheckUtils]: 58: Hoare triple {3354#(= (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; {3358#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:59,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {3350#(= (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; {3354#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:45:59,199 INFO L290 TraceCheckUtils]: 56: Hoare triple {3340#(= (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; {3350#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:59,200 INFO L290 TraceCheckUtils]: 55: Hoare triple {3340#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3340#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:59,200 INFO L290 TraceCheckUtils]: 54: Hoare triple {3340#(= (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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {3340#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:59,201 INFO L290 TraceCheckUtils]: 53: Hoare triple {3336#(= |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]; {3340#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:59,201 INFO L290 TraceCheckUtils]: 52: Hoare triple {3175#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; {3336#(= |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:59,201 INFO L272 TraceCheckUtils]: 51: Hoare triple {3175#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {3175#true} is VALID [2022-02-20 23:45:59,201 INFO L290 TraceCheckUtils]: 50: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,202 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3175#true} {3175#true} #424#return; {3175#true} is VALID [2022-02-20 23:45:59,202 INFO L290 TraceCheckUtils]: 47: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 23:45:59,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {3175#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3175#true} is VALID [2022-02-20 23:45:59,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {3175#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {3175#true} is VALID [2022-02-20 23:45:59,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {3175#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3175#true} is VALID [2022-02-20 23:45:59,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,203 INFO L272 TraceCheckUtils]: 39: Hoare triple {3175#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {3175#true} is VALID [2022-02-20 23:45:59,203 INFO L290 TraceCheckUtils]: 38: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,204 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3175#true} {3175#true} #422#return; {3175#true} is VALID [2022-02-20 23:45:59,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 23:45:59,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {3175#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3175#true} is VALID [2022-02-20 23:45:59,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {3175#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {3175#true} is VALID [2022-02-20 23:45:59,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {3175#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3175#true} is VALID [2022-02-20 23:45:59,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,206 INFO L272 TraceCheckUtils]: 27: Hoare triple {3175#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {3175#true} is VALID [2022-02-20 23:45:59,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,206 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3175#true} {3175#true} #420#return; {3175#true} is VALID [2022-02-20 23:45:59,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 23:45:59,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {3175#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3175#true} is VALID [2022-02-20 23:45:59,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {3175#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {3175#true} is VALID [2022-02-20 23:45:59,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {3175#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3175#true} is VALID [2022-02-20 23:45:59,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,208 INFO L272 TraceCheckUtils]: 15: Hoare triple {3175#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {3175#true} is VALID [2022-02-20 23:45:59,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,208 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3175#true} {3175#true} #418#return; {3175#true} is VALID [2022-02-20 23:45:59,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-02-20 23:45:59,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {3175#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3175#true} is VALID [2022-02-20 23:45:59,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {3175#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {3175#true} is VALID [2022-02-20 23:45:59,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {3175#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3175#true} is VALID [2022-02-20 23:45:59,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,210 INFO L272 TraceCheckUtils]: 3: Hoare triple {3175#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {3175#true} is VALID [2022-02-20 23:45:59,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {3175#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; {3175#true} is VALID [2022-02-20 23:45:59,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {3175#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, main_#t~mem39#1.base, main_#t~mem39#1.offset; {3175#true} is VALID [2022-02-20 23:45:59,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {3175#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); {3175#true} is VALID [2022-02-20 23:45:59,211 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:59,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:59,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883584279] [2022-02-20 23:45:59,212 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:59,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529304154] [2022-02-20 23:45:59,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529304154] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:45:59,212 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:45:59,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2022-02-20 23:45:59,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967408895] [2022-02-20 23:45:59,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:45:59,214 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,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:59,214 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:59,272 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:59,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:45:59,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:59,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:45:59,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:45:59,274 INFO L87 Difference]: Start difference. First operand 239 states and 270 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:46:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:09,327 INFO L93 Difference]: Finished difference Result 258 states and 294 transitions. [2022-02-20 23:46:09,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:46:09,327 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:46:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:09,328 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:46:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 296 transitions. [2022-02-20 23:46:09,334 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:46:09,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 296 transitions. [2022-02-20 23:46:09,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 296 transitions. [2022-02-20 23:46:09,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:09,563 INFO L225 Difference]: With dead ends: 258 [2022-02-20 23:46:09,563 INFO L226 Difference]: Without dead ends: 258 [2022-02-20 23:46:09,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:46:09,565 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 99 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:09,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 1805 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 682 Invalid, 0 Unknown, 131 Unchecked, 0.5s Time] [2022-02-20 23:46:09,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-02-20 23:46:09,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 248. [2022-02-20 23:46:09,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:09,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 248 states, 146 states have (on average 1.7397260273972603) internal successors, (254), 230 states have internal predecessors, (254), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-02-20 23:46:09,574 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 248 states, 146 states have (on average 1.7397260273972603) internal successors, (254), 230 states have internal predecessors, (254), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-02-20 23:46:09,574 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 248 states, 146 states have (on average 1.7397260273972603) internal successors, (254), 230 states have internal predecessors, (254), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-02-20 23:46:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:09,583 INFO L93 Difference]: Finished difference Result 258 states and 294 transitions. [2022-02-20 23:46:09,583 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 294 transitions. [2022-02-20 23:46:09,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:09,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:09,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 248 states, 146 states have (on average 1.7397260273972603) internal successors, (254), 230 states have internal predecessors, (254), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) Second operand 258 states. [2022-02-20 23:46:09,587 INFO L87 Difference]: Start difference. First operand has 248 states, 146 states have (on average 1.7397260273972603) internal successors, (254), 230 states have internal predecessors, (254), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) Second operand 258 states. [2022-02-20 23:46:09,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:09,595 INFO L93 Difference]: Finished difference Result 258 states and 294 transitions. [2022-02-20 23:46:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 294 transitions. [2022-02-20 23:46:09,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:09,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:09,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:09,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 146 states have (on average 1.7397260273972603) internal successors, (254), 230 states have internal predecessors, (254), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-02-20 23:46:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 281 transitions. [2022-02-20 23:46:09,606 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 281 transitions. Word has length 73 [2022-02-20 23:46:09,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:09,607 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 281 transitions. [2022-02-20 23:46:09,607 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:46:09,607 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 281 transitions. [2022-02-20 23:46:09,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 23:46:09,609 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:09,609 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:46:09,637 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:46:09,830 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:46:09,831 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 85 more)] === [2022-02-20 23:46:09,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:09,831 INFO L85 PathProgramCache]: Analyzing trace with hash 946384939, now seen corresponding path program 1 times [2022-02-20 23:46:09,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:09,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953902879] [2022-02-20 23:46:09,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:09,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:09,860 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:09,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [547817279] [2022-02-20 23:46:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:09,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:09,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:09,870 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:46:09,900 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:46:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:10,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 57 conjunts are in the unsatisfiable core [2022-02-20 23:46:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:10,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:10,248 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:16,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:16,273 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:16,312 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:46:16,313 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:16,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {4666#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); {4666#true} is VALID [2022-02-20 23:46:16,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {4666#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, main_#t~mem39#1.base, main_#t~mem39#1.offset; {4666#true} is VALID [2022-02-20 23:46:16,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,385 INFO L272 TraceCheckUtils]: 3: Hoare triple {4666#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {4666#true} is VALID [2022-02-20 23:46:16,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {4666#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4666#true} is VALID [2022-02-20 23:46:16,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {4666#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {4666#true} is VALID [2022-02-20 23:46:16,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {4666#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4666#true} is VALID [2022-02-20 23:46:16,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {4666#true} assume true; {4666#true} is VALID [2022-02-20 23:46:16,386 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4666#true} {4666#true} #418#return; {4666#true} is VALID [2022-02-20 23:46:16,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,386 INFO L272 TraceCheckUtils]: 15: Hoare triple {4666#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {4666#true} is VALID [2022-02-20 23:46:16,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {4666#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4666#true} is VALID [2022-02-20 23:46:16,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {4666#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {4666#true} is VALID [2022-02-20 23:46:16,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {4666#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4666#true} is VALID [2022-02-20 23:46:16,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {4666#true} assume true; {4666#true} is VALID [2022-02-20 23:46:16,388 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4666#true} {4666#true} #420#return; {4666#true} is VALID [2022-02-20 23:46:16,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,388 INFO L272 TraceCheckUtils]: 27: Hoare triple {4666#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {4666#true} is VALID [2022-02-20 23:46:16,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {4666#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4666#true} is VALID [2022-02-20 23:46:16,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {4666#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {4666#true} is VALID [2022-02-20 23:46:16,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {4666#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4666#true} is VALID [2022-02-20 23:46:16,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {4666#true} assume true; {4666#true} is VALID [2022-02-20 23:46:16,389 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4666#true} {4666#true} #422#return; {4666#true} is VALID [2022-02-20 23:46:16,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,390 INFO L272 TraceCheckUtils]: 39: Hoare triple {4666#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {4666#true} is VALID [2022-02-20 23:46:16,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {4666#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4666#true} is VALID [2022-02-20 23:46:16,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {4666#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {4666#true} is VALID [2022-02-20 23:46:16,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {4666#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4666#true} is VALID [2022-02-20 23:46:16,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {4666#true} assume true; {4666#true} is VALID [2022-02-20 23:46:16,391 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4666#true} {4666#true} #424#return; {4666#true} is VALID [2022-02-20 23:46:16,392 INFO L290 TraceCheckUtils]: 49: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,392 INFO L290 TraceCheckUtils]: 50: Hoare triple {4666#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; {4666#true} is VALID [2022-02-20 23:46:16,392 INFO L272 TraceCheckUtils]: 51: Hoare triple {4666#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {4666#true} is VALID [2022-02-20 23:46:16,395 INFO L290 TraceCheckUtils]: 52: Hoare triple {4666#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; {4827#(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:16,396 INFO L290 TraceCheckUtils]: 53: Hoare triple {4827#(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]; {4831#(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:16,397 INFO L290 TraceCheckUtils]: 54: Hoare triple {4831#(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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {4831#(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:16,399 INFO L290 TraceCheckUtils]: 55: Hoare triple {4831#(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~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4831#(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:16,400 INFO L290 TraceCheckUtils]: 56: Hoare triple {4831#(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; {4841#(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:16,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {4841#(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; {4845#(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:16,402 INFO L290 TraceCheckUtils]: 58: Hoare triple {4845#(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; {4849#(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:16,403 INFO L290 TraceCheckUtils]: 59: Hoare triple {4849#(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; {4849#(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:16,404 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4849#(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))} {4666#true} #426#return; {4856#(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:16,405 INFO L290 TraceCheckUtils]: 61: Hoare triple {4856#(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; {4860#(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:16,406 INFO L272 TraceCheckUtils]: 62: Hoare triple {4860#(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); {4864#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:46:16,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {4864#(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; {4868#(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:16,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {4868#(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]; {4868#(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:16,409 INFO L290 TraceCheckUtils]: 65: Hoare triple {4868#(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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {4868#(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:16,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {4868#(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~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4868#(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:16,411 INFO L290 TraceCheckUtils]: 67: Hoare triple {4868#(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; {4868#(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:16,411 INFO L290 TraceCheckUtils]: 68: Hoare triple {4868#(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; {4868#(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:16,412 INFO L290 TraceCheckUtils]: 69: Hoare triple {4868#(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; {4868#(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:16,413 INFO L290 TraceCheckUtils]: 70: Hoare triple {4868#(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; {4868#(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:16,417 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4868#(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|)))} {4860#(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))} #428#return; {4893#(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:16,418 INFO L290 TraceCheckUtils]: 72: Hoare triple {4893#(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); {4667#false} is VALID [2022-02-20 23:46:16,418 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:16,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:16,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:16,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953902879] [2022-02-20 23:46:16,610 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:16,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547817279] [2022-02-20 23:46:16,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547817279] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:46:16,611 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:46:16,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 23:46:16,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056710173] [2022-02-20 23:46:16,611 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:16,612 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:16,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:16,612 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:16,661 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:16,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:46:16,661 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:16,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:46:16,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:46:16,662 INFO L87 Difference]: Start difference. First operand 248 states and 281 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:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:20,147 INFO L93 Difference]: Finished difference Result 348 states and 401 transitions. [2022-02-20 23:46:20,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:46:20,147 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:20,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:20,148 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:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 391 transitions. [2022-02-20 23:46:20,153 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:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 391 transitions. [2022-02-20 23:46:20,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 391 transitions. [2022-02-20 23:46:20,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:20,462 INFO L225 Difference]: With dead ends: 348 [2022-02-20 23:46:20,462 INFO L226 Difference]: Without dead ends: 348 [2022-02-20 23:46:20,463 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:20,466 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 112 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 597 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:20,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 780 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1211 Invalid, 0 Unknown, 597 Unchecked, 1.3s Time] [2022-02-20 23:46:20,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-02-20 23:46:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 247. [2022-02-20 23:46:20,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:20,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 247 states, 146 states have (on average 1.726027397260274) internal successors, (252), 229 states have internal predecessors, (252), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-02-20 23:46:20,478 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 247 states, 146 states have (on average 1.726027397260274) internal successors, (252), 229 states have internal predecessors, (252), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-02-20 23:46:20,478 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 247 states, 146 states have (on average 1.726027397260274) internal successors, (252), 229 states have internal predecessors, (252), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-02-20 23:46:20,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:20,504 INFO L93 Difference]: Finished difference Result 348 states and 401 transitions. [2022-02-20 23:46:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 401 transitions. [2022-02-20 23:46:20,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:20,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:20,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 146 states have (on average 1.726027397260274) internal successors, (252), 229 states have internal predecessors, (252), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) Second operand 348 states. [2022-02-20 23:46:20,508 INFO L87 Difference]: Start difference. First operand has 247 states, 146 states have (on average 1.726027397260274) internal successors, (252), 229 states have internal predecessors, (252), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) Second operand 348 states. [2022-02-20 23:46:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:20,520 INFO L93 Difference]: Finished difference Result 348 states and 401 transitions. [2022-02-20 23:46:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 401 transitions. [2022-02-20 23:46:20,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:20,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:20,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:20,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:20,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 146 states have (on average 1.726027397260274) internal successors, (252), 229 states have internal predecessors, (252), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 14 states have call predecessors, (14), 13 states have call successors, (14) [2022-02-20 23:46:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 279 transitions. [2022-02-20 23:46:20,530 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 279 transitions. Word has length 73 [2022-02-20 23:46:20,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:20,530 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 279 transitions. [2022-02-20 23:46:20,531 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:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 279 transitions. [2022-02-20 23:46:20,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 23:46:20,532 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:20,532 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] [2022-02-20 23:46:20,559 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:20,756 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:20,756 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 85 more)] === [2022-02-20 23:46:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:20,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1752586491, now seen corresponding path program 1 times [2022-02-20 23:46:20,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:20,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218429119] [2022-02-20 23:46:20,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:20,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:20,796 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:20,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1680042944] [2022-02-20 23:46:20,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:20,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:20,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:20,808 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:20,809 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:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:20,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:46:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:20,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:21,433 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:21,434 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:21,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {6206#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); {6206#true} is VALID [2022-02-20 23:46:21,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {6206#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, main_#t~mem39#1.base, main_#t~mem39#1.offset; {6206#true} is VALID [2022-02-20 23:46:21,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,448 INFO L272 TraceCheckUtils]: 3: Hoare triple {6206#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {6206#true} is VALID [2022-02-20 23:46:21,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {6206#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6206#true} is VALID [2022-02-20 23:46:21,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {6206#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {6206#true} is VALID [2022-02-20 23:46:21,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {6206#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6206#true} is VALID [2022-02-20 23:46:21,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {6206#true} assume true; {6206#true} is VALID [2022-02-20 23:46:21,449 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6206#true} {6206#true} #418#return; {6206#true} is VALID [2022-02-20 23:46:21,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,453 INFO L272 TraceCheckUtils]: 15: Hoare triple {6206#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {6206#true} is VALID [2022-02-20 23:46:21,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {6206#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6206#true} is VALID [2022-02-20 23:46:21,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {6206#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {6206#true} is VALID [2022-02-20 23:46:21,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {6206#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6206#true} is VALID [2022-02-20 23:46:21,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {6206#true} assume true; {6206#true} is VALID [2022-02-20 23:46:21,454 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6206#true} {6206#true} #420#return; {6206#true} is VALID [2022-02-20 23:46:21,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,455 INFO L272 TraceCheckUtils]: 27: Hoare triple {6206#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {6206#true} is VALID [2022-02-20 23:46:21,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {6206#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6206#true} is VALID [2022-02-20 23:46:21,455 INFO L290 TraceCheckUtils]: 30: Hoare triple {6206#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {6206#true} is VALID [2022-02-20 23:46:21,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {6206#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6206#true} is VALID [2022-02-20 23:46:21,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {6206#true} assume true; {6206#true} is VALID [2022-02-20 23:46:21,461 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6206#true} {6206#true} #422#return; {6206#true} is VALID [2022-02-20 23:46:21,462 INFO L290 TraceCheckUtils]: 37: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,462 INFO L272 TraceCheckUtils]: 39: Hoare triple {6206#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {6206#true} is VALID [2022-02-20 23:46:21,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {6206#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6206#true} is VALID [2022-02-20 23:46:21,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {6206#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {6206#true} is VALID [2022-02-20 23:46:21,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {6206#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6206#true} is VALID [2022-02-20 23:46:21,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,464 INFO L290 TraceCheckUtils]: 47: Hoare triple {6206#true} assume true; {6206#true} is VALID [2022-02-20 23:46:21,465 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6206#true} {6206#true} #424#return; {6206#true} is VALID [2022-02-20 23:46:21,465 INFO L290 TraceCheckUtils]: 49: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:21,465 INFO L272 TraceCheckUtils]: 51: Hoare triple {6206#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {6206#true} is VALID [2022-02-20 23:46:21,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {6206#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; {6367#(= |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:21,466 INFO L290 TraceCheckUtils]: 53: Hoare triple {6367#(= |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]; {6371#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:21,467 INFO L290 TraceCheckUtils]: 54: Hoare triple {6371#(= (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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {6371#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:21,467 INFO L290 TraceCheckUtils]: 55: Hoare triple {6371#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6371#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:21,467 INFO L290 TraceCheckUtils]: 56: Hoare triple {6371#(= (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; {6381#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:21,468 INFO L290 TraceCheckUtils]: 57: Hoare triple {6381#(= (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; {6385#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:21,468 INFO L290 TraceCheckUtils]: 58: Hoare triple {6385#(= (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; {6389#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:21,469 INFO L290 TraceCheckUtils]: 59: Hoare triple {6389#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {6389#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:21,470 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6389#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {6206#true} #426#return; {6396#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:46:21,471 INFO L290 TraceCheckUtils]: 61: Hoare triple {6396#(= (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; {6400#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:21,471 INFO L272 TraceCheckUtils]: 62: Hoare triple {6400#(= (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); {6404#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:21,473 INFO L290 TraceCheckUtils]: 63: Hoare triple {6404#(= |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; {6408#(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:21,474 INFO L290 TraceCheckUtils]: 64: Hoare triple {6408#(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]; {6412#(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:21,475 INFO L290 TraceCheckUtils]: 65: Hoare triple {6412#(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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {6412#(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:21,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {6412#(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~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr41#1 := #Ultimate.C_memset_#value#1];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr41#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr41#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr41#1 := 1 + #Ultimate.C_memset_#t~loopctr41#1; {6412#(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:21,477 INFO L290 TraceCheckUtils]: 67: Hoare triple {6412#(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~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6412#(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:21,478 INFO L290 TraceCheckUtils]: 68: Hoare triple {6412#(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; {6412#(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:21,478 INFO L290 TraceCheckUtils]: 69: Hoare triple {6412#(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; {6412#(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:21,479 INFO L290 TraceCheckUtils]: 70: Hoare triple {6412#(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; {6412#(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:21,480 INFO L290 TraceCheckUtils]: 71: Hoare triple {6412#(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; {6412#(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:21,481 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {6412#(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)))} {6400#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #428#return; {6400#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:21,481 INFO L290 TraceCheckUtils]: 73: Hoare triple {6400#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {6207#false} is VALID [2022-02-20 23:46:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 73 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-02-20 23:46:21,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:21,898 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:46:21,898 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:22,011 INFO L290 TraceCheckUtils]: 73: Hoare triple {6400#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {6207#false} is VALID [2022-02-20 23:46:22,013 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} {6400#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #428#return; {6400#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:22,013 INFO L290 TraceCheckUtils]: 71: Hoare triple {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} assume true; {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:22,014 INFO L290 TraceCheckUtils]: 70: Hoare triple {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 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; {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:22,014 INFO L290 TraceCheckUtils]: 69: Hoare triple {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 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; {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:22,014 INFO L290 TraceCheckUtils]: 68: Hoare triple {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 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; {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:22,015 INFO L290 TraceCheckUtils]: 67: Hoare triple {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:22,015 INFO L290 TraceCheckUtils]: 66: Hoare triple {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} assume #Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr41#1 := #Ultimate.C_memset_#value#1];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr41#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr41#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr41#1 := 1 + #Ultimate.C_memset_#t~loopctr41#1; {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:22,016 INFO L290 TraceCheckUtils]: 65: Hoare triple {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:22,016 INFO L290 TraceCheckUtils]: 64: Hoare triple {6471#(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_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1)))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:22,019 INFO L290 TraceCheckUtils]: 63: Hoare triple {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 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; {6471#(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_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1)))))} is VALID [2022-02-20 23:46:22,019 INFO L272 TraceCheckUtils]: 62: Hoare triple {6400#(= (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); {6446#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5| Int)) (or (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1) (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_5|) 1))))} is VALID [2022-02-20 23:46:22,020 INFO L290 TraceCheckUtils]: 61: Hoare triple {6396#(= (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; {6400#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:22,021 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {6389#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {6206#true} #426#return; {6396#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:46:22,021 INFO L290 TraceCheckUtils]: 59: Hoare triple {6389#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {6389#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:22,022 INFO L290 TraceCheckUtils]: 58: Hoare triple {6385#(= (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; {6389#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:22,022 INFO L290 TraceCheckUtils]: 57: Hoare triple {6381#(= (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; {6385#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:22,023 INFO L290 TraceCheckUtils]: 56: Hoare triple {6371#(= (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; {6381#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:22,023 INFO L290 TraceCheckUtils]: 55: Hoare triple {6371#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6371#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:22,024 INFO L290 TraceCheckUtils]: 54: Hoare triple {6371#(= (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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {6371#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:22,024 INFO L290 TraceCheckUtils]: 53: Hoare triple {6367#(= |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]; {6371#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:22,024 INFO L290 TraceCheckUtils]: 52: Hoare triple {6206#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; {6367#(= |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:22,025 INFO L272 TraceCheckUtils]: 51: Hoare triple {6206#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {6206#true} is VALID [2022-02-20 23:46:22,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,025 INFO L290 TraceCheckUtils]: 49: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,025 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6206#true} {6206#true} #424#return; {6206#true} is VALID [2022-02-20 23:46:22,025 INFO L290 TraceCheckUtils]: 47: Hoare triple {6206#true} assume true; {6206#true} is VALID [2022-02-20 23:46:22,025 INFO L290 TraceCheckUtils]: 46: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,025 INFO L290 TraceCheckUtils]: 45: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,025 INFO L290 TraceCheckUtils]: 44: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {6206#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6206#true} is VALID [2022-02-20 23:46:22,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {6206#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {6206#true} is VALID [2022-02-20 23:46:22,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {6206#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6206#true} is VALID [2022-02-20 23:46:22,026 INFO L290 TraceCheckUtils]: 40: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,026 INFO L272 TraceCheckUtils]: 39: Hoare triple {6206#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {6206#true} is VALID [2022-02-20 23:46:22,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,026 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6206#true} {6206#true} #422#return; {6206#true} is VALID [2022-02-20 23:46:22,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {6206#true} assume true; {6206#true} is VALID [2022-02-20 23:46:22,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {6206#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6206#true} is VALID [2022-02-20 23:46:22,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {6206#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {6206#true} is VALID [2022-02-20 23:46:22,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {6206#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6206#true} is VALID [2022-02-20 23:46:22,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,028 INFO L272 TraceCheckUtils]: 27: Hoare triple {6206#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {6206#true} is VALID [2022-02-20 23:46:22,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,028 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6206#true} {6206#true} #420#return; {6206#true} is VALID [2022-02-20 23:46:22,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {6206#true} assume true; {6206#true} is VALID [2022-02-20 23:46:22,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {6206#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6206#true} is VALID [2022-02-20 23:46:22,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {6206#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {6206#true} is VALID [2022-02-20 23:46:22,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {6206#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6206#true} is VALID [2022-02-20 23:46:22,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,029 INFO L272 TraceCheckUtils]: 15: Hoare triple {6206#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {6206#true} is VALID [2022-02-20 23:46:22,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,034 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6206#true} {6206#true} #418#return; {6206#true} is VALID [2022-02-20 23:46:22,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {6206#true} assume true; {6206#true} is VALID [2022-02-20 23:46:22,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {6206#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6206#true} is VALID [2022-02-20 23:46:22,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {6206#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {6206#true} is VALID [2022-02-20 23:46:22,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {6206#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6206#true} is VALID [2022-02-20 23:46:22,037 INFO L290 TraceCheckUtils]: 4: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,037 INFO L272 TraceCheckUtils]: 3: Hoare triple {6206#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {6206#true} is VALID [2022-02-20 23:46:22,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {6206#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; {6206#true} is VALID [2022-02-20 23:46:22,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {6206#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, main_#t~mem39#1.base, main_#t~mem39#1.offset; {6206#true} is VALID [2022-02-20 23:46:22,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {6206#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); {6206#true} is VALID [2022-02-20 23:46:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 73 proven. 9 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-02-20 23:46:22,043 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:22,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218429119] [2022-02-20 23:46:22,043 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:22,043 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680042944] [2022-02-20 23:46:22,043 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680042944] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:46:22,043 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:46:22,043 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2022-02-20 23:46:22,043 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960176169] [2022-02-20 23:46:22,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:22,046 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 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 74 [2022-02-20 23:46:22,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:22,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 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:46:22,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:22,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:46:22,110 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:22,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:46:22,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:46:22,111 INFO L87 Difference]: Start difference. First operand 247 states and 279 transitions. Second operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 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:46:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:32,028 INFO L93 Difference]: Finished difference Result 261 states and 297 transitions. [2022-02-20 23:46:32,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:46:32,029 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 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 74 [2022-02-20 23:46:32,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:32,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 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:46:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 290 transitions. [2022-02-20 23:46:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 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:46:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 290 transitions. [2022-02-20 23:46:32,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 290 transitions. [2022-02-20 23:46:32,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:32,282 INFO L225 Difference]: With dead ends: 261 [2022-02-20 23:46:32,282 INFO L226 Difference]: Without dead ends: 261 [2022-02-20 23:46:32,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:46:32,283 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 98 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:32,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 1638 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 668 Invalid, 0 Unknown, 145 Unchecked, 0.5s Time] [2022-02-20 23:46:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-02-20 23:46:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 245. [2022-02-20 23:46:32,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:32,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 245 states, 145 states have (on average 1.7241379310344827) internal successors, (250), 228 states have internal predecessors, (250), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:46:32,290 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 245 states, 145 states have (on average 1.7241379310344827) internal successors, (250), 228 states have internal predecessors, (250), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:46:32,290 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 245 states, 145 states have (on average 1.7241379310344827) internal successors, (250), 228 states have internal predecessors, (250), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:46:32,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:32,298 INFO L93 Difference]: Finished difference Result 261 states and 297 transitions. [2022-02-20 23:46:32,298 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 297 transitions. [2022-02-20 23:46:32,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:32,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:32,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 245 states, 145 states have (on average 1.7241379310344827) internal successors, (250), 228 states have internal predecessors, (250), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 261 states. [2022-02-20 23:46:32,301 INFO L87 Difference]: Start difference. First operand has 245 states, 145 states have (on average 1.7241379310344827) internal successors, (250), 228 states have internal predecessors, (250), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 261 states. [2022-02-20 23:46:32,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:32,309 INFO L93 Difference]: Finished difference Result 261 states and 297 transitions. [2022-02-20 23:46:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 297 transitions. [2022-02-20 23:46:32,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:32,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:32,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:32,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 145 states have (on average 1.7241379310344827) internal successors, (250), 228 states have internal predecessors, (250), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:46:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 276 transitions. [2022-02-20 23:46:32,318 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 276 transitions. Word has length 74 [2022-02-20 23:46:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:32,318 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 276 transitions. [2022-02-20 23:46:32,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 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:46:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 276 transitions. [2022-02-20 23:46:32,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 23:46:32,319 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:32,319 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:32,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 23:46:32,535 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:32,535 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 85 more)] === [2022-02-20 23:46:32,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1057141109, now seen corresponding path program 1 times [2022-02-20 23:46:32,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:32,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572568928] [2022-02-20 23:46:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:32,567 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:32,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [413962558] [2022-02-20 23:46:32,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:32,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:32,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:32,572 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:32,596 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:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:32,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:46:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:32,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:33,123 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:33,123 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:33,353 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:33,354 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:33,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {7710#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); {7710#true} is VALID [2022-02-20 23:46:33,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {7710#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, main_#t~mem39#1.base, main_#t~mem39#1.offset; {7710#true} is VALID [2022-02-20 23:46:33,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,381 INFO L272 TraceCheckUtils]: 3: Hoare triple {7710#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {7710#true} is VALID [2022-02-20 23:46:33,381 INFO L290 TraceCheckUtils]: 4: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {7710#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7710#true} is VALID [2022-02-20 23:46:33,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {7710#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {7710#true} is VALID [2022-02-20 23:46:33,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {7710#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7710#true} is VALID [2022-02-20 23:46:33,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {7710#true} assume true; {7710#true} is VALID [2022-02-20 23:46:33,382 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7710#true} {7710#true} #418#return; {7710#true} is VALID [2022-02-20 23:46:33,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,382 INFO L272 TraceCheckUtils]: 15: Hoare triple {7710#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {7710#true} is VALID [2022-02-20 23:46:33,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {7710#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7710#true} is VALID [2022-02-20 23:46:33,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {7710#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {7710#true} is VALID [2022-02-20 23:46:33,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {7710#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7710#true} is VALID [2022-02-20 23:46:33,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {7710#true} assume true; {7710#true} is VALID [2022-02-20 23:46:33,383 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7710#true} {7710#true} #420#return; {7710#true} is VALID [2022-02-20 23:46:33,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,383 INFO L272 TraceCheckUtils]: 27: Hoare triple {7710#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {7710#true} is VALID [2022-02-20 23:46:33,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {7710#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7710#true} is VALID [2022-02-20 23:46:33,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {7710#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {7710#true} is VALID [2022-02-20 23:46:33,384 INFO L290 TraceCheckUtils]: 31: Hoare triple {7710#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7710#true} is VALID [2022-02-20 23:46:33,384 INFO L290 TraceCheckUtils]: 32: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,384 INFO L290 TraceCheckUtils]: 33: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,384 INFO L290 TraceCheckUtils]: 35: Hoare triple {7710#true} assume true; {7710#true} is VALID [2022-02-20 23:46:33,384 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7710#true} {7710#true} #422#return; {7710#true} is VALID [2022-02-20 23:46:33,384 INFO L290 TraceCheckUtils]: 37: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,385 INFO L290 TraceCheckUtils]: 38: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:33,385 INFO L272 TraceCheckUtils]: 39: Hoare triple {7710#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {7710#true} is VALID [2022-02-20 23:46:33,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {7710#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; {7835#(= |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:33,386 INFO L290 TraceCheckUtils]: 41: Hoare triple {7835#(= |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]; {7839#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:33,386 INFO L290 TraceCheckUtils]: 42: Hoare triple {7839#(= (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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {7839#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:33,386 INFO L290 TraceCheckUtils]: 43: Hoare triple {7839#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7839#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:33,387 INFO L290 TraceCheckUtils]: 44: Hoare triple {7839#(= (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; {7849#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:33,387 INFO L290 TraceCheckUtils]: 45: Hoare triple {7849#(= (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; {7853#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:33,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {7853#(= (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; {7857#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:33,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {7857#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {7857#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:33,389 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7857#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {7710#true} #424#return; {7864#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} is VALID [2022-02-20 23:46:33,389 INFO L290 TraceCheckUtils]: 49: Hoare triple {7864#(= (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; {7868#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:46:33,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {7868#(= (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; {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:33,390 INFO L272 TraceCheckUtils]: 51: Hoare triple {7872#(= (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); {7876#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:33,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {7876#(= |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; {7880#(exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|))} is VALID [2022-02-20 23:46:33,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {7880#(exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:33,394 INFO L290 TraceCheckUtils]: 54: Hoare triple {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:33,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:33,396 INFO L290 TraceCheckUtils]: 56: Hoare triple {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#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; {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:33,397 INFO L290 TraceCheckUtils]: 57: Hoare triple {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#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; {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:33,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#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; {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:33,398 INFO L290 TraceCheckUtils]: 59: Hoare triple {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:33,400 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #426#return; {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:33,400 INFO L290 TraceCheckUtils]: 61: Hoare triple {7872#(= (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; {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:33,401 INFO L272 TraceCheckUtils]: 62: Hoare triple {7872#(= (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); {7876#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:33,402 INFO L290 TraceCheckUtils]: 63: Hoare triple {7876#(= |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; {7880#(exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|))} is VALID [2022-02-20 23:46:33,403 INFO L290 TraceCheckUtils]: 64: Hoare triple {7880#(exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:33,404 INFO L290 TraceCheckUtils]: 65: Hoare triple {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:33,405 INFO L290 TraceCheckUtils]: 66: Hoare triple {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:33,406 INFO L290 TraceCheckUtils]: 67: Hoare triple {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#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; {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:33,407 INFO L290 TraceCheckUtils]: 68: Hoare triple {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#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; {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:33,407 INFO L290 TraceCheckUtils]: 69: Hoare triple {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#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; {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:33,408 INFO L290 TraceCheckUtils]: 70: Hoare triple {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:33,409 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7884#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_144 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_144) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #428#return; {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:33,410 INFO L290 TraceCheckUtils]: 72: Hoare triple {7872#(= (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 {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:33,410 INFO L290 TraceCheckUtils]: 73: Hoare triple {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:33,411 INFO L290 TraceCheckUtils]: 74: Hoare triple {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} assume !(1 == #valid[l4_insert_~list#1.base]); {7711#false} is VALID [2022-02-20 23:46:33,411 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:33,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:34,176 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:46:34,176 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:34,264 INFO L290 TraceCheckUtils]: 74: Hoare triple {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} assume !(1 == #valid[l4_insert_~list#1.base]); {7711#false} is VALID [2022-02-20 23:46:34,264 INFO L290 TraceCheckUtils]: 73: Hoare triple {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:34,264 INFO L290 TraceCheckUtils]: 72: Hoare triple {7872#(= (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 {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:34,265 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {7960#(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))))} {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #428#return; {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:34,266 INFO L290 TraceCheckUtils]: 70: Hoare triple {7960#(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; {7960#(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:34,266 INFO L290 TraceCheckUtils]: 69: Hoare triple {7960#(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; {7960#(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:34,266 INFO L290 TraceCheckUtils]: 68: Hoare triple {7960#(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; {7960#(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:34,267 INFO L290 TraceCheckUtils]: 67: Hoare triple {7960#(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; {7960#(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:34,267 INFO L290 TraceCheckUtils]: 66: Hoare triple {7960#(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~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7960#(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:34,267 INFO L290 TraceCheckUtils]: 65: Hoare triple {7960#(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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {7960#(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:34,268 INFO L290 TraceCheckUtils]: 64: Hoare triple {7982#(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]; {7960#(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:34,273 INFO L290 TraceCheckUtils]: 63: Hoare triple {7960#(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; {7982#(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:34,273 INFO L272 TraceCheckUtils]: 62: Hoare triple {7872#(= (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); {7960#(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:34,274 INFO L290 TraceCheckUtils]: 61: Hoare triple {7872#(= (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; {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:34,275 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7960#(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))))} {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #426#return; {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:34,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {7960#(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; {7960#(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:34,276 INFO L290 TraceCheckUtils]: 58: Hoare triple {7960#(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; {7960#(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:34,276 INFO L290 TraceCheckUtils]: 57: Hoare triple {7960#(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; {7960#(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:34,277 INFO L290 TraceCheckUtils]: 56: Hoare triple {7960#(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; {7960#(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:34,277 INFO L290 TraceCheckUtils]: 55: Hoare triple {7960#(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~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7960#(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:34,277 INFO L290 TraceCheckUtils]: 54: Hoare triple {7960#(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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {7960#(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:34,278 INFO L290 TraceCheckUtils]: 53: Hoare triple {7982#(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]; {7960#(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:34,280 INFO L290 TraceCheckUtils]: 52: Hoare triple {7960#(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; {7982#(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:34,281 INFO L272 TraceCheckUtils]: 51: Hoare triple {7872#(= (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); {7960#(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:34,282 INFO L290 TraceCheckUtils]: 50: Hoare triple {7868#(= (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; {7872#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:34,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {7864#(= (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; {7868#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:46:34,283 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7857#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {7710#true} #424#return; {7864#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} is VALID [2022-02-20 23:46:34,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {7857#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {7857#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:34,284 INFO L290 TraceCheckUtils]: 46: Hoare triple {7853#(= (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; {7857#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:34,284 INFO L290 TraceCheckUtils]: 45: Hoare triple {7849#(= (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; {7853#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:34,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {7839#(= (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; {7849#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:34,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {7839#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7839#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:34,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {7839#(= (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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {7839#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:34,286 INFO L290 TraceCheckUtils]: 41: Hoare triple {7835#(= |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]; {7839#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:34,286 INFO L290 TraceCheckUtils]: 40: Hoare triple {7710#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; {7835#(= |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:34,287 INFO L272 TraceCheckUtils]: 39: Hoare triple {7710#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {7710#true} is VALID [2022-02-20 23:46:34,287 INFO L290 TraceCheckUtils]: 38: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,287 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7710#true} {7710#true} #422#return; {7710#true} is VALID [2022-02-20 23:46:34,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {7710#true} assume true; {7710#true} is VALID [2022-02-20 23:46:34,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {7710#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7710#true} is VALID [2022-02-20 23:46:34,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {7710#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {7710#true} is VALID [2022-02-20 23:46:34,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {7710#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7710#true} is VALID [2022-02-20 23:46:34,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,288 INFO L272 TraceCheckUtils]: 27: Hoare triple {7710#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {7710#true} is VALID [2022-02-20 23:46:34,291 INFO L290 TraceCheckUtils]: 26: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,291 INFO L290 TraceCheckUtils]: 25: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,292 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7710#true} {7710#true} #420#return; {7710#true} is VALID [2022-02-20 23:46:34,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {7710#true} assume true; {7710#true} is VALID [2022-02-20 23:46:34,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {7710#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7710#true} is VALID [2022-02-20 23:46:34,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {7710#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {7710#true} is VALID [2022-02-20 23:46:34,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {7710#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7710#true} is VALID [2022-02-20 23:46:34,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,293 INFO L272 TraceCheckUtils]: 15: Hoare triple {7710#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {7710#true} is VALID [2022-02-20 23:46:34,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,294 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7710#true} {7710#true} #418#return; {7710#true} is VALID [2022-02-20 23:46:34,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {7710#true} assume true; {7710#true} is VALID [2022-02-20 23:46:34,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {7710#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7710#true} is VALID [2022-02-20 23:46:34,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {7710#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {7710#true} is VALID [2022-02-20 23:46:34,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {7710#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7710#true} is VALID [2022-02-20 23:46:34,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,296 INFO L272 TraceCheckUtils]: 3: Hoare triple {7710#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {7710#true} is VALID [2022-02-20 23:46:34,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {7710#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; {7710#true} is VALID [2022-02-20 23:46:34,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {7710#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, main_#t~mem39#1.base, main_#t~mem39#1.offset; {7710#true} is VALID [2022-02-20 23:46:34,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {7710#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); {7710#true} is VALID [2022-02-20 23:46:34,296 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:34,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:34,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572568928] [2022-02-20 23:46:34,297 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:34,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413962558] [2022-02-20 23:46:34,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413962558] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:46:34,297 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:46:34,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2022-02-20 23:46:34,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439829576] [2022-02-20 23:46:34,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:34,299 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:34,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:34,301 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:34,359 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:34,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:46:34,359 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:34,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:46:34,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:46:34,360 INFO L87 Difference]: Start difference. First operand 245 states and 276 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:44,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:44,639 INFO L93 Difference]: Finished difference Result 278 states and 317 transitions. [2022-02-20 23:46:44,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:46:44,640 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:44,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:44,640 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:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 301 transitions. [2022-02-20 23:46:44,643 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:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 301 transitions. [2022-02-20 23:46:44,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 301 transitions. [2022-02-20 23:46:44,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:44,887 INFO L225 Difference]: With dead ends: 278 [2022-02-20 23:46:44,887 INFO L226 Difference]: Without dead ends: 278 [2022-02-20 23:46:44,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 131 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:46:44,888 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 151 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:44,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 1918 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 775 Invalid, 0 Unknown, 242 Unchecked, 0.6s Time] [2022-02-20 23:46:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-02-20 23:46:44,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 269. [2022-02-20 23:46:44,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:44,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 278 states. Second operand has 269 states, 166 states have (on average 1.644578313253012) internal successors, (273), 248 states have internal predecessors, (273), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2022-02-20 23:46:44,895 INFO L74 IsIncluded]: Start isIncluded. First operand 278 states. Second operand has 269 states, 166 states have (on average 1.644578313253012) internal successors, (273), 248 states have internal predecessors, (273), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2022-02-20 23:46:44,896 INFO L87 Difference]: Start difference. First operand 278 states. Second operand has 269 states, 166 states have (on average 1.644578313253012) internal successors, (273), 248 states have internal predecessors, (273), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2022-02-20 23:46:44,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:44,917 INFO L93 Difference]: Finished difference Result 278 states and 317 transitions. [2022-02-20 23:46:44,917 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 317 transitions. [2022-02-20 23:46:44,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:44,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:44,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 269 states, 166 states have (on average 1.644578313253012) internal successors, (273), 248 states have internal predecessors, (273), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) Second operand 278 states. [2022-02-20 23:46:44,920 INFO L87 Difference]: Start difference. First operand has 269 states, 166 states have (on average 1.644578313253012) internal successors, (273), 248 states have internal predecessors, (273), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) Second operand 278 states. [2022-02-20 23:46:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:44,928 INFO L93 Difference]: Finished difference Result 278 states and 317 transitions. [2022-02-20 23:46:44,929 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 317 transitions. [2022-02-20 23:46:44,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:44,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:44,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:44,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 166 states have (on average 1.644578313253012) internal successors, (273), 248 states have internal predecessors, (273), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2022-02-20 23:46:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 305 transitions. [2022-02-20 23:46:44,938 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 305 transitions. Word has length 75 [2022-02-20 23:46:44,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:44,938 INFO L470 AbstractCegarLoop]: Abstraction has 269 states and 305 transitions. [2022-02-20 23:46:44,938 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:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 305 transitions. [2022-02-20 23:46:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 23:46:44,940 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:44,940 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:44,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-20 23:46:45,156 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:45,156 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 85 more)] === [2022-02-20 23:46:45,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:45,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1057141108, now seen corresponding path program 1 times [2022-02-20 23:46:45,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:45,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566840824] [2022-02-20 23:46:45,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:45,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:45,176 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:45,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1973099582] [2022-02-20 23:46:45,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:45,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:45,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:45,178 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:45,196 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:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:45,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 73 conjunts are in the unsatisfiable core [2022-02-20 23:46:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:45,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:45,455 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:50,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:50,600 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:50,664 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:46:50,664 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:51,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:51,367 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:51,427 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-20 23:46:51,428 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:51,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {9298#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); {9298#true} is VALID [2022-02-20 23:46:51,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {9298#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, main_#t~mem39#1.base, main_#t~mem39#1.offset; {9298#true} is VALID [2022-02-20 23:46:51,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,622 INFO L272 TraceCheckUtils]: 3: Hoare triple {9298#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {9298#true} is VALID [2022-02-20 23:46:51,622 INFO L290 TraceCheckUtils]: 4: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,622 INFO L290 TraceCheckUtils]: 5: Hoare triple {9298#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9298#true} is VALID [2022-02-20 23:46:51,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {9298#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {9298#true} is VALID [2022-02-20 23:46:51,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {9298#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9298#true} is VALID [2022-02-20 23:46:51,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {9298#true} assume true; {9298#true} is VALID [2022-02-20 23:46:51,622 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9298#true} {9298#true} #418#return; {9298#true} is VALID [2022-02-20 23:46:51,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,623 INFO L272 TraceCheckUtils]: 15: Hoare triple {9298#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {9298#true} is VALID [2022-02-20 23:46:51,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {9298#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9298#true} is VALID [2022-02-20 23:46:51,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {9298#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {9298#true} is VALID [2022-02-20 23:46:51,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {9298#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9298#true} is VALID [2022-02-20 23:46:51,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {9298#true} assume true; {9298#true} is VALID [2022-02-20 23:46:51,623 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9298#true} {9298#true} #420#return; {9298#true} is VALID [2022-02-20 23:46:51,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,623 INFO L272 TraceCheckUtils]: 27: Hoare triple {9298#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {9298#true} is VALID [2022-02-20 23:46:51,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {9298#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9298#true} is VALID [2022-02-20 23:46:51,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {9298#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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {9298#true} is VALID [2022-02-20 23:46:51,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {9298#true} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9298#true} is VALID [2022-02-20 23:46:51,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,624 INFO L290 TraceCheckUtils]: 33: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,625 INFO L290 TraceCheckUtils]: 35: Hoare triple {9298#true} assume true; {9298#true} is VALID [2022-02-20 23:46:51,625 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9298#true} {9298#true} #422#return; {9298#true} is VALID [2022-02-20 23:46:51,625 INFO L290 TraceCheckUtils]: 37: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,625 INFO L290 TraceCheckUtils]: 38: Hoare triple {9298#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; {9298#true} is VALID [2022-02-20 23:46:51,625 INFO L272 TraceCheckUtils]: 39: Hoare triple {9298#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {9298#true} is VALID [2022-02-20 23:46:51,633 INFO L290 TraceCheckUtils]: 40: Hoare triple {9298#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; {9423#(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:51,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {9423#(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]; {9427#(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:51,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {9427#(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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {9427#(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:51,637 INFO L290 TraceCheckUtils]: 43: Hoare triple {9427#(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~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9427#(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:51,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {9427#(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; {9437#(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:51,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {9437#(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; {9441#(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:51,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {9441#(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; {9445#(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:51,644 INFO L290 TraceCheckUtils]: 47: Hoare triple {9445#(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; {9445#(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:51,645 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9445#(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))} {9298#true} #424#return; {9452#(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_47| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (= (mod (select |#length| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0))))} is VALID [2022-02-20 23:46:51,647 INFO L290 TraceCheckUtils]: 49: Hoare triple {9452#(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_47| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (= (mod (select |#length| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 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; {9456#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l3_insert_~item~1#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l3_insert_~item~1#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|))) (= (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:51,648 INFO L290 TraceCheckUtils]: 50: Hoare triple {9456#(and (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l3_insert_~item~1#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 1 (div (select |#length| |ULTIMATE.start_l3_insert_~item~1#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|))) (= (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; {9460#(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_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)))))} is VALID [2022-02-20 23:46:51,649 INFO L272 TraceCheckUtils]: 51: Hoare triple {9460#(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_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)))))} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {9464#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:46:51,650 INFO L290 TraceCheckUtils]: 52: Hoare triple {9464#(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; {9468#(and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} is VALID [2022-02-20 23:46:51,651 INFO L290 TraceCheckUtils]: 53: Hoare triple {9468#(and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (exists ((v_ArrVal_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9472#(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_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:51,652 INFO L290 TraceCheckUtils]: 54: Hoare triple {9472#(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_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))) (= (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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {9472#(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_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:51,653 INFO L290 TraceCheckUtils]: 55: Hoare triple {9472#(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_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9472#(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_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:51,653 INFO L290 TraceCheckUtils]: 56: Hoare triple {9472#(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_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))) (= (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; {9472#(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_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:51,654 INFO L290 TraceCheckUtils]: 57: Hoare triple {9472#(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_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))) (= (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; {9472#(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_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:51,655 INFO L290 TraceCheckUtils]: 58: Hoare triple {9472#(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_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))) (= (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; {9472#(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_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:51,655 INFO L290 TraceCheckUtils]: 59: Hoare triple {9472#(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_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {9472#(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_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:51,658 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9472#(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_189 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_189) |#valid|)) (exists ((v_ArrVal_190 Int)) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_190))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {9460#(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_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)))))} #426#return; {9494#(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_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)))))} is VALID [2022-02-20 23:46:51,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {9494#(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_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)))))} 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; {9494#(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_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)))))} is VALID [2022-02-20 23:46:51,661 INFO L272 TraceCheckUtils]: 62: Hoare triple {9494#(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_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)))))} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {9464#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:46:51,662 INFO L290 TraceCheckUtils]: 63: Hoare triple {9464#(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; {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} is VALID [2022-02-20 23:46:51,662 INFO L290 TraceCheckUtils]: 64: Hoare triple {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} is VALID [2022-02-20 23:46:51,663 INFO L290 TraceCheckUtils]: 65: Hoare triple {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} 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~loopctr41#1;#Ultimate.C_memset_#t~loopctr41#1 := 0; {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} is VALID [2022-02-20 23:46:51,666 INFO L290 TraceCheckUtils]: 66: Hoare triple {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} assume !(#Ultimate.C_memset_#t~loopctr41#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} is VALID [2022-02-20 23:46:51,667 INFO L290 TraceCheckUtils]: 67: Hoare triple {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} 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; {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} is VALID [2022-02-20 23:46:51,668 INFO L290 TraceCheckUtils]: 68: Hoare triple {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} #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; {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} is VALID [2022-02-20 23:46:51,668 INFO L290 TraceCheckUtils]: 69: Hoare triple {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} 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; {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} is VALID [2022-02-20 23:46:51,669 INFO L290 TraceCheckUtils]: 70: Hoare triple {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} assume true; {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} is VALID [2022-02-20 23:46:51,673 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9504#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_191 Int)) (and (= (select |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0) (= |#length| (store |old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_191))))} {9494#(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_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)))))} #428#return; {9529#(and (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)))))} is VALID [2022-02-20 23:46:51,676 INFO L290 TraceCheckUtils]: 72: Hoare triple {9529#(and (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)))))} 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 {9529#(and (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)))))} is VALID [2022-02-20 23:46:51,678 INFO L290 TraceCheckUtils]: 73: Hoare triple {9529#(and (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)))))} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {9529#(and (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)))))} is VALID [2022-02-20 23:46:51,680 INFO L290 TraceCheckUtils]: 74: Hoare triple {9529#(and (= 0 |ULTIMATE.start_l4_insert_~list#1.offset|) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_47| Int)) (and (= (mod (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|) (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~list#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_47|)))))} assume !(4 + l4_insert_~list#1.offset <= #length[l4_insert_~list#1.base] && 0 <= l4_insert_~list#1.offset); {9299#false} is VALID [2022-02-20 23:46:51,680 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:51,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:51,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:51,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566840824] [2022-02-20 23:46:51,924 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:51,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973099582] [2022-02-20 23:46:51,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973099582] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:46:51,925 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:46:51,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-02-20 23:46:51,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234611675] [2022-02-20 23:46:51,925 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:51,925 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:51,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:51,926 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:51,993 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:51,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:46:51,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:51,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:46:51,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:46:51,995 INFO L87 Difference]: Start difference. First operand 269 states and 305 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:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:56,685 INFO L93 Difference]: Finished difference Result 375 states and 433 transitions. [2022-02-20 23:46:56,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:46:56,686 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:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:56,686 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:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 399 transitions. [2022-02-20 23:46:56,691 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:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 399 transitions. [2022-02-20 23:46:56,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 399 transitions. [2022-02-20 23:46:57,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 399 edges. 399 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:57,162 INFO L225 Difference]: With dead ends: 375 [2022-02-20 23:46:57,163 INFO L226 Difference]: Without dead ends: 375 [2022-02-20 23:46:57,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:46:57,164 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 114 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 983 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:57,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 834 Invalid, 2197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1200 Invalid, 0 Unknown, 983 Unchecked, 1.6s Time] [2022-02-20 23:46:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-02-20 23:46:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 274. [2022-02-20 23:46:57,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:57,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 274 states, 170 states have (on average 1.6294117647058823) internal successors, (277), 251 states have internal predecessors, (277), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) [2022-02-20 23:46:57,171 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 274 states, 170 states have (on average 1.6294117647058823) internal successors, (277), 251 states have internal predecessors, (277), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) [2022-02-20 23:46:57,171 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 274 states, 170 states have (on average 1.6294117647058823) internal successors, (277), 251 states have internal predecessors, (277), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) [2022-02-20 23:46:57,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:57,183 INFO L93 Difference]: Finished difference Result 375 states and 433 transitions. [2022-02-20 23:46:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 433 transitions. [2022-02-20 23:46:57,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:57,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:57,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 274 states, 170 states have (on average 1.6294117647058823) internal successors, (277), 251 states have internal predecessors, (277), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) Second operand 375 states. [2022-02-20 23:46:57,187 INFO L87 Difference]: Start difference. First operand has 274 states, 170 states have (on average 1.6294117647058823) internal successors, (277), 251 states have internal predecessors, (277), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) Second operand 375 states. [2022-02-20 23:46:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:57,199 INFO L93 Difference]: Finished difference Result 375 states and 433 transitions. [2022-02-20 23:46:57,199 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 433 transitions. [2022-02-20 23:46:57,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:57,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:57,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:57,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 170 states have (on average 1.6294117647058823) internal successors, (277), 251 states have internal predecessors, (277), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) [2022-02-20 23:46:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 311 transitions. [2022-02-20 23:46:57,209 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 311 transitions. Word has length 75 [2022-02-20 23:46:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:57,209 INFO L470 AbstractCegarLoop]: Abstraction has 274 states and 311 transitions. [2022-02-20 23:46:57,210 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:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 311 transitions. [2022-02-20 23:46:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 23:46:57,210 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:57,211 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:57,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:57,423 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:57,423 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 85 more)] === [2022-02-20 23:46:57,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:57,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1287213158, now seen corresponding path program 1 times [2022-02-20 23:46:57,424 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:57,424 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149106041] [2022-02-20 23:46:57,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:57,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:57,450 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:57,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265612468] [2022-02-20 23:46:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:57,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:57,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:57,453 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:57,478 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:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:57,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:46:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:57,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:58,066 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:58,067 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