./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0235-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0235-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e8dd9d71aae7a8c83467a9093ad4bffb4ddd59cddc2d90362f34ff651f24f9a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:45:35,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:45:35,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:45:35,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:45:35,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:45:35,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:45:35,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:45:35,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:45:35,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:45:35,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:45:35,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:45:35,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:45:35,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:45:35,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:45:35,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:45:35,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:45:35,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:45:35,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:45:35,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:45:35,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:45:35,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:45:35,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:45:35,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:45:35,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:45:35,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:45:35,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:45:35,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:45:35,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:45:35,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:45:35,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:45:35,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:45:35,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:45:35,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:45:35,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:45:35,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:45:35,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:45:35,905 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:45:35,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:45:35,906 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:45:35,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:45:35,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:45:35,909 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:35,926 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:45:35,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:45:35,927 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:45:35,927 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:45:35,928 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:45:35,928 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:45:35,929 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:45:35,929 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:45:35,929 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:45:35,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:45:35,930 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:45:35,930 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:45:35,930 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:45:35,930 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:45:35,930 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:45:35,931 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:45:35,931 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:45:35,931 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:45:35,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:45:35,932 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:45:35,932 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:45:35,932 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:45:35,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:45:35,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:45:35,933 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:45:35,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:35,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:45:35,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:45:35,934 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:45:35,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:45:35,934 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 -> 6e8dd9d71aae7a8c83467a9093ad4bffb4ddd59cddc2d90362f34ff651f24f9a [2022-02-20 23:45:36,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:45:36,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:45:36,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:45:36,177 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:45:36,178 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:45:36,179 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0235-1.i [2022-02-20 23:45:36,240 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebe1ab81/838b9f78d4c84407ac067fd61013c843/FLAG88e3e67b6 [2022-02-20 23:45:36,711 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:45:36,712 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0235-1.i [2022-02-20 23:45:36,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebe1ab81/838b9f78d4c84407ac067fd61013c843/FLAG88e3e67b6 [2022-02-20 23:45:37,050 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bebe1ab81/838b9f78d4c84407ac067fd61013c843 [2022-02-20 23:45:37,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:45:37,060 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:45:37,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:37,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:45:37,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:45:37,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:37" (1/1) ... [2022-02-20 23:45:37,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c78ac42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:37, skipping insertion in model container [2022-02-20 23:45:37,067 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:37" (1/1) ... [2022-02-20 23:45:37,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:45:37,115 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:45:37,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:37,453 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:45:37,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:37,567 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:45:37,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:37 WrapperNode [2022-02-20 23:45:37,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:37,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:37,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:45:37,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:45:37,576 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:37" (1/1) ... [2022-02-20 23:45:37,609 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:37" (1/1) ... [2022-02-20 23:45:37,650 INFO L137 Inliner]: procedures = 188, calls = 69, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 234 [2022-02-20 23:45:37,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:37,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:45:37,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:45:37,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:45:37,658 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:37" (1/1) ... [2022-02-20 23:45:37,659 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:37" (1/1) ... [2022-02-20 23:45:37,662 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:37" (1/1) ... [2022-02-20 23:45:37,662 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:37" (1/1) ... [2022-02-20 23:45:37,675 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:37" (1/1) ... [2022-02-20 23:45:37,680 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:37" (1/1) ... [2022-02-20 23:45:37,683 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:37" (1/1) ... [2022-02-20 23:45:37,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:45:37,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:45:37,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:45:37,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:45:37,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:37" (1/1) ... [2022-02-20 23:45:37,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:37,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:37,713 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:37,729 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:37,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:45:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:45:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:45:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:45:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2022-02-20 23:45:37,750 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2022-02-20 23:45:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:45:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:45:37,750 INFO L130 BoogieDeclarations]: Found specification of procedure l0_destroy [2022-02-20 23:45:37,750 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_destroy [2022-02-20 23:45:37,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:45:37,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:45:37,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:45:37,859 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:45:37,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:45:38,462 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:45:38,474 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:45:38,474 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 23:45:38,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:38 BoogieIcfgContainer [2022-02-20 23:45:38,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:45:38,479 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:45:38,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:45:38,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:45:38,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:45:37" (1/3) ... [2022-02-20 23:45:38,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ffba62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:38, skipping insertion in model container [2022-02-20 23:45:38,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:37" (2/3) ... [2022-02-20 23:45:38,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ffba62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:38, skipping insertion in model container [2022-02-20 23:45:38,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:38" (3/3) ... [2022-02-20 23:45:38,485 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0235-1.i [2022-02-20 23:45:38,491 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:45:38,492 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 85 error locations. [2022-02-20 23:45:38,537 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:45:38,544 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:38,544 INFO L340 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-02-20 23:45:38,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 233 states, 134 states have (on average 1.873134328358209) internal successors, (251), 219 states have internal predecessors, (251), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:45:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:45:38,591 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:38,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:45:38,592 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2022-02-20 23:45:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:38,596 INFO L85 PathProgramCache]: Analyzing trace with hash 930118, now seen corresponding path program 1 times [2022-02-20 23:45:38,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:38,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123123963] [2022-02-20 23:45:38,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:38,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:38,718 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#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); {236#true} is VALID [2022-02-20 23:45:38,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#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; {236#true} is VALID [2022-02-20 23:45:38,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume !true; {237#false} is VALID [2022-02-20 23:45:38,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {237#false} assume !(1 == #valid[~#list~0.base]); {237#false} is VALID [2022-02-20 23:45:38,721 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:38,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:38,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123123963] [2022-02-20 23:45:38,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123123963] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:38,723 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:38,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:38,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598725637] [2022-02-20 23:45:38,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:38,730 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:38,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:38,736 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:38,743 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:38,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:45:38,744 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:38,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:45:38,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:45:38,771 INFO L87 Difference]: Start difference. First operand has 233 states, 134 states have (on average 1.873134328358209) internal successors, (251), 219 states have internal predecessors, (251), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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:38,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:38,985 INFO L93 Difference]: Finished difference Result 233 states and 262 transitions. [2022-02-20 23:45:38,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:45:38,985 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:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:38,988 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:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 273 transitions. [2022-02-20 23:45:39,008 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:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 273 transitions. [2022-02-20 23:45:39,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 273 transitions. [2022-02-20 23:45:39,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:39,292 INFO L225 Difference]: With dead ends: 233 [2022-02-20 23:45:39,293 INFO L226 Difference]: Without dead ends: 231 [2022-02-20 23:45:39,295 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:39,302 INFO L933 BasicCegarLoop]: 262 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, 262 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:39,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 262 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:39,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-02-20 23:45:39,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-02-20 23:45:39,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:39,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 231 states, 133 states have (on average 1.7894736842105263) internal successors, (238), 217 states have internal predecessors, (238), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:45:39,353 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 231 states, 133 states have (on average 1.7894736842105263) internal successors, (238), 217 states have internal predecessors, (238), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:45:39,354 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 231 states, 133 states have (on average 1.7894736842105263) internal successors, (238), 217 states have internal predecessors, (238), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:45:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:39,370 INFO L93 Difference]: Finished difference Result 231 states and 260 transitions. [2022-02-20 23:45:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 260 transitions. [2022-02-20 23:45:39,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:39,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:39,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 133 states have (on average 1.7894736842105263) internal successors, (238), 217 states have internal predecessors, (238), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 231 states. [2022-02-20 23:45:39,377 INFO L87 Difference]: Start difference. First operand has 231 states, 133 states have (on average 1.7894736842105263) internal successors, (238), 217 states have internal predecessors, (238), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 231 states. [2022-02-20 23:45:39,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:39,391 INFO L93 Difference]: Finished difference Result 231 states and 260 transitions. [2022-02-20 23:45:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 260 transitions. [2022-02-20 23:45:39,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:39,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:39,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:39,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 133 states have (on average 1.7894736842105263) internal successors, (238), 217 states have internal predecessors, (238), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:45:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 260 transitions. [2022-02-20 23:45:39,409 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 260 transitions. Word has length 4 [2022-02-20 23:45:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:39,410 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 260 transitions. [2022-02-20 23:45:39,410 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:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 260 transitions. [2022-02-20 23:45:39,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:45:39,411 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:39,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:45:39,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:45:39,412 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2022-02-20 23:45:39,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash 889932981, now seen corresponding path program 1 times [2022-02-20 23:45:39,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:39,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552203055] [2022-02-20 23:45:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:39,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:39,442 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:39,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966137122] [2022-02-20 23:45:39,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:39,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:39,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:39,451 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:39,480 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:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:39,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:45:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:39,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:39,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:45:39,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {1166#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); {1166#true} is VALID [2022-02-20 23:45:39,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {1166#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; {1166#true} is VALID [2022-02-20 23:45:39,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {1166#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; {1166#true} is VALID [2022-02-20 23:45:39,685 INFO L272 TraceCheckUtils]: 3: Hoare triple {1166#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {1166#true} is VALID [2022-02-20 23:45:39,687 INFO L290 TraceCheckUtils]: 4: Hoare triple {1166#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; {1183#(= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)} is VALID [2022-02-20 23:45:39,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#(= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)} assume !(1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {1167#false} is VALID [2022-02-20 23:45:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:39,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:39,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:39,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552203055] [2022-02-20 23:45:39,688 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:39,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966137122] [2022-02-20 23:45:39,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966137122] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:39,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:39,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:39,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279130660] [2022-02-20 23:45:39,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:39,690 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:39,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:39,691 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:39,697 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:39,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:39,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:39,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:39,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:39,698 INFO L87 Difference]: Start difference. First operand 231 states and 260 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:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,099 INFO L93 Difference]: Finished difference Result 230 states and 259 transitions. [2022-02-20 23:45:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:40,099 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:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:40,100 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:40,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2022-02-20 23:45:40,107 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:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2022-02-20 23:45:40,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 260 transitions. [2022-02-20 23:45:40,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:40,348 INFO L225 Difference]: With dead ends: 230 [2022-02-20 23:45:40,348 INFO L226 Difference]: Without dead ends: 230 [2022-02-20 23:45:40,348 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:40,350 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 9 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:40,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 418 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-02-20 23:45:40,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-02-20 23:45:40,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:40,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 230 states, 133 states have (on average 1.781954887218045) internal successors, (237), 216 states have internal predecessors, (237), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:45:40,361 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 230 states, 133 states have (on average 1.781954887218045) internal successors, (237), 216 states have internal predecessors, (237), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:45:40,362 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 230 states, 133 states have (on average 1.781954887218045) internal successors, (237), 216 states have internal predecessors, (237), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:45:40,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,372 INFO L93 Difference]: Finished difference Result 230 states and 259 transitions. [2022-02-20 23:45:40,372 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 259 transitions. [2022-02-20 23:45:40,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:40,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:40,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 133 states have (on average 1.781954887218045) internal successors, (237), 216 states have internal predecessors, (237), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 230 states. [2022-02-20 23:45:40,375 INFO L87 Difference]: Start difference. First operand has 230 states, 133 states have (on average 1.781954887218045) internal successors, (237), 216 states have internal predecessors, (237), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 230 states. [2022-02-20 23:45:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,385 INFO L93 Difference]: Finished difference Result 230 states and 259 transitions. [2022-02-20 23:45:40,385 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 259 transitions. [2022-02-20 23:45:40,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:40,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:40,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:40,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 133 states have (on average 1.781954887218045) internal successors, (237), 216 states have internal predecessors, (237), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:45:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 259 transitions. [2022-02-20 23:45:40,397 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 259 transitions. Word has length 6 [2022-02-20 23:45:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:40,398 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 259 transitions. [2022-02-20 23:45:40,398 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:40,398 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 259 transitions. [2022-02-20 23:45:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:45:40,398 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:40,399 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:40,428 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:40,625 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:40,625 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2022-02-20 23:45:40,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:40,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1818119056, now seen corresponding path program 1 times [2022-02-20 23:45:40,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:40,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836421020] [2022-02-20 23:45:40,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:40,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:40,640 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:40,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [984312751] [2022-02-20 23:45:40,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:40,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:40,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:40,642 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:40,666 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:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:40,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:45:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:40,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:41,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:45:41,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {2106#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); {2106#true} is VALID [2022-02-20 23:45:41,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {2106#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; {2106#true} is VALID [2022-02-20 23:45:41,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {2106#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; {2106#true} is VALID [2022-02-20 23:45:41,922 INFO L272 TraceCheckUtils]: 3: Hoare triple {2106#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {2106#true} is VALID [2022-02-20 23:45:41,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {2106#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; {2123#(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:41,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {2123#(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]; {2123#(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:41,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {2123#(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); {2107#false} is VALID [2022-02-20 23:45:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:41,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:41,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:41,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836421020] [2022-02-20 23:45:41,928 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:41,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984312751] [2022-02-20 23:45:41,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984312751] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:41,929 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:41,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:41,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323214793] [2022-02-20 23:45:41,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:41,930 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:41,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:41,930 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:41,970 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:41,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:41,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:41,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:41,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:41,971 INFO L87 Difference]: Start difference. First operand 230 states and 259 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:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,228 INFO L93 Difference]: Finished difference Result 229 states and 258 transitions. [2022-02-20 23:45:42,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:42,229 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:42,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:42,229 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:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2022-02-20 23:45:42,233 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:42,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2022-02-20 23:45:42,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 259 transitions. [2022-02-20 23:45:42,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:42,449 INFO L225 Difference]: With dead ends: 229 [2022-02-20 23:45:42,449 INFO L226 Difference]: Without dead ends: 229 [2022-02-20 23:45:42,449 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:42,450 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:42,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 443 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 70 Unchecked, 0.0s Time] [2022-02-20 23:45:42,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-02-20 23:45:42,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2022-02-20 23:45:42,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:42,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 229 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 215 states have internal predecessors, (236), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:45:42,460 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 229 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 215 states have internal predecessors, (236), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:45:42,460 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 229 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 215 states have internal predecessors, (236), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:45:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,468 INFO L93 Difference]: Finished difference Result 229 states and 258 transitions. [2022-02-20 23:45:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2022-02-20 23:45:42,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:42,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:42,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 215 states have internal predecessors, (236), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 229 states. [2022-02-20 23:45:42,471 INFO L87 Difference]: Start difference. First operand has 229 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 215 states have internal predecessors, (236), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 229 states. [2022-02-20 23:45:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,478 INFO L93 Difference]: Finished difference Result 229 states and 258 transitions. [2022-02-20 23:45:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2022-02-20 23:45:42,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:42,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:42,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:42,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 215 states have internal predecessors, (236), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 23:45:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 258 transitions. [2022-02-20 23:45:42,488 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 258 transitions. Word has length 7 [2022-02-20 23:45:42,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:42,488 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 258 transitions. [2022-02-20 23:45:42,489 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:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 258 transitions. [2022-02-20 23:45:42,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 23:45:42,490 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:42,490 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:42,515 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:42,711 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:42,712 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2022-02-20 23:45:42,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:42,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1115615018, now seen corresponding path program 1 times [2022-02-20 23:45:42,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:42,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664603570] [2022-02-20 23:45:42,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:42,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:42,754 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:42,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775736629] [2022-02-20 23:45:42,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:42,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:42,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:42,766 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:42,767 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:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:42,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:45:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:42,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:43,468 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:45:43,469 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:43,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {3045#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); {3045#true} is VALID [2022-02-20 23:45:43,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,493 INFO L272 TraceCheckUtils]: 3: Hoare triple {3045#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {3045#true} is VALID [2022-02-20 23:45:43,493 INFO L290 TraceCheckUtils]: 4: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {3045#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3045#true} is VALID [2022-02-20 23:45:43,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {3045#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {3045#true} is VALID [2022-02-20 23:45:43,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {3045#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3045#true} is VALID [2022-02-20 23:45:43,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {3045#true} assume true; {3045#true} is VALID [2022-02-20 23:45:43,495 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3045#true} {3045#true} #408#return; {3045#true} is VALID [2022-02-20 23:45:43,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,496 INFO L272 TraceCheckUtils]: 15: Hoare triple {3045#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {3045#true} is VALID [2022-02-20 23:45:43,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {3045#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3045#true} is VALID [2022-02-20 23:45:43,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {3045#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {3045#true} is VALID [2022-02-20 23:45:43,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {3045#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3045#true} is VALID [2022-02-20 23:45:43,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {3045#true} assume true; {3045#true} is VALID [2022-02-20 23:45:43,498 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3045#true} {3045#true} #410#return; {3045#true} is VALID [2022-02-20 23:45:43,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,498 INFO L272 TraceCheckUtils]: 27: Hoare triple {3045#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {3045#true} is VALID [2022-02-20 23:45:43,498 INFO L290 TraceCheckUtils]: 28: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {3045#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3045#true} is VALID [2022-02-20 23:45:43,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {3045#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {3045#true} is VALID [2022-02-20 23:45:43,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {3045#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3045#true} is VALID [2022-02-20 23:45:43,499 INFO L290 TraceCheckUtils]: 32: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {3045#true} assume true; {3045#true} is VALID [2022-02-20 23:45:43,500 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3045#true} {3045#true} #412#return; {3045#true} is VALID [2022-02-20 23:45:43,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,501 INFO L290 TraceCheckUtils]: 38: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,501 INFO L272 TraceCheckUtils]: 39: Hoare triple {3045#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {3045#true} is VALID [2022-02-20 23:45:43,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,501 INFO L290 TraceCheckUtils]: 41: Hoare triple {3045#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3045#true} is VALID [2022-02-20 23:45:43,501 INFO L290 TraceCheckUtils]: 42: Hoare triple {3045#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {3045#true} is VALID [2022-02-20 23:45:43,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {3045#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3045#true} is VALID [2022-02-20 23:45:43,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,502 INFO L290 TraceCheckUtils]: 45: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,502 INFO L290 TraceCheckUtils]: 46: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,503 INFO L290 TraceCheckUtils]: 47: Hoare triple {3045#true} assume true; {3045#true} is VALID [2022-02-20 23:45:43,503 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3045#true} {3045#true} #414#return; {3045#true} is VALID [2022-02-20 23:45:43,503 INFO L290 TraceCheckUtils]: 49: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,503 INFO L290 TraceCheckUtils]: 50: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:43,503 INFO L272 TraceCheckUtils]: 51: Hoare triple {3045#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {3045#true} is VALID [2022-02-20 23:45:43,504 INFO L290 TraceCheckUtils]: 52: Hoare triple {3045#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; {3206#(= |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:43,505 INFO L290 TraceCheckUtils]: 53: Hoare triple {3206#(= |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]; {3210#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:43,505 INFO L290 TraceCheckUtils]: 54: Hoare triple {3210#(= (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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {3210#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:43,506 INFO L290 TraceCheckUtils]: 55: Hoare triple {3210#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3210#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:43,506 INFO L290 TraceCheckUtils]: 56: Hoare triple {3210#(= (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; {3220#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:43,507 INFO L290 TraceCheckUtils]: 57: Hoare triple {3220#(= (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; {3224#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:45:43,507 INFO L290 TraceCheckUtils]: 58: Hoare triple {3224#(= (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; {3228#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:43,507 INFO L290 TraceCheckUtils]: 59: Hoare triple {3228#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {3228#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:43,508 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3228#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {3045#true} #416#return; {3235#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:45:43,509 INFO L290 TraceCheckUtils]: 61: Hoare triple {3235#(= (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; {3239#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:43,510 INFO L272 TraceCheckUtils]: 62: Hoare triple {3239#(= (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); {3243#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:45:43,511 INFO L290 TraceCheckUtils]: 63: Hoare triple {3243#(= |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; {3247#(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:43,512 INFO L290 TraceCheckUtils]: 64: Hoare triple {3247#(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]; {3251#(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:43,512 INFO L290 TraceCheckUtils]: 65: Hoare triple {3251#(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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {3251#(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:43,513 INFO L290 TraceCheckUtils]: 66: Hoare triple {3251#(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~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3251#(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:43,513 INFO L290 TraceCheckUtils]: 67: Hoare triple {3251#(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; {3251#(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:43,514 INFO L290 TraceCheckUtils]: 68: Hoare triple {3251#(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; {3251#(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:43,514 INFO L290 TraceCheckUtils]: 69: Hoare triple {3251#(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; {3251#(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:43,515 INFO L290 TraceCheckUtils]: 70: Hoare triple {3251#(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; {3251#(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:43,516 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3251#(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)))} {3239#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #418#return; {3239#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:43,517 INFO L290 TraceCheckUtils]: 72: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {3046#false} is VALID [2022-02-20 23:45:43,517 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:43,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:45:44,049 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:45:44,049 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:44,167 INFO L290 TraceCheckUtils]: 72: Hoare triple {3239#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {3046#false} is VALID [2022-02-20 23:45:44,169 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {3282#(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)))} {3239#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #418#return; {3239#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:44,170 INFO L290 TraceCheckUtils]: 70: Hoare triple {3282#(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; {3282#(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:44,171 INFO L290 TraceCheckUtils]: 69: Hoare triple {3282#(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; {3282#(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:44,172 INFO L290 TraceCheckUtils]: 68: Hoare triple {3282#(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; {3282#(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:44,172 INFO L290 TraceCheckUtils]: 67: Hoare triple {3282#(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; {3282#(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:44,173 INFO L290 TraceCheckUtils]: 66: Hoare triple {3282#(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~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3282#(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:44,174 INFO L290 TraceCheckUtils]: 65: Hoare triple {3282#(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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {3282#(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:44,175 INFO L290 TraceCheckUtils]: 64: Hoare triple {3304#(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]; {3282#(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:44,177 INFO L290 TraceCheckUtils]: 63: Hoare triple {3282#(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; {3304#(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:44,177 INFO L272 TraceCheckUtils]: 62: Hoare triple {3239#(= (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); {3282#(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:44,178 INFO L290 TraceCheckUtils]: 61: Hoare triple {3235#(= (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; {3239#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:44,179 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {3228#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {3045#true} #416#return; {3235#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:45:44,182 INFO L290 TraceCheckUtils]: 59: Hoare triple {3228#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {3228#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:44,182 INFO L290 TraceCheckUtils]: 58: Hoare triple {3224#(= (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; {3228#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:45:44,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {3220#(= (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; {3224#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:45:44,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {3210#(= (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; {3220#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:45:44,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {3210#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3210#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:44,184 INFO L290 TraceCheckUtils]: 54: Hoare triple {3210#(= (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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {3210#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:44,185 INFO L290 TraceCheckUtils]: 53: Hoare triple {3206#(= |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]; {3210#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:45:44,185 INFO L290 TraceCheckUtils]: 52: Hoare triple {3045#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; {3206#(= |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:44,185 INFO L272 TraceCheckUtils]: 51: Hoare triple {3045#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {3045#true} is VALID [2022-02-20 23:45:44,185 INFO L290 TraceCheckUtils]: 50: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,186 INFO L290 TraceCheckUtils]: 49: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,186 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3045#true} {3045#true} #414#return; {3045#true} is VALID [2022-02-20 23:45:44,187 INFO L290 TraceCheckUtils]: 47: Hoare triple {3045#true} assume true; {3045#true} is VALID [2022-02-20 23:45:44,187 INFO L290 TraceCheckUtils]: 46: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,188 INFO L290 TraceCheckUtils]: 45: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,189 INFO L290 TraceCheckUtils]: 44: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {3045#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3045#true} is VALID [2022-02-20 23:45:44,201 INFO L290 TraceCheckUtils]: 42: Hoare triple {3045#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {3045#true} is VALID [2022-02-20 23:45:44,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {3045#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3045#true} is VALID [2022-02-20 23:45:44,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,202 INFO L272 TraceCheckUtils]: 39: Hoare triple {3045#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {3045#true} is VALID [2022-02-20 23:45:44,203 INFO L290 TraceCheckUtils]: 38: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,204 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3045#true} {3045#true} #412#return; {3045#true} is VALID [2022-02-20 23:45:44,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {3045#true} assume true; {3045#true} is VALID [2022-02-20 23:45:44,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {3045#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3045#true} is VALID [2022-02-20 23:45:44,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {3045#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {3045#true} is VALID [2022-02-20 23:45:44,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {3045#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3045#true} is VALID [2022-02-20 23:45:44,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,206 INFO L272 TraceCheckUtils]: 27: Hoare triple {3045#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {3045#true} is VALID [2022-02-20 23:45:44,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,206 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3045#true} {3045#true} #410#return; {3045#true} is VALID [2022-02-20 23:45:44,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {3045#true} assume true; {3045#true} is VALID [2022-02-20 23:45:44,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {3045#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3045#true} is VALID [2022-02-20 23:45:44,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {3045#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {3045#true} is VALID [2022-02-20 23:45:44,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {3045#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3045#true} is VALID [2022-02-20 23:45:44,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,208 INFO L272 TraceCheckUtils]: 15: Hoare triple {3045#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {3045#true} is VALID [2022-02-20 23:45:44,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,209 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3045#true} {3045#true} #408#return; {3045#true} is VALID [2022-02-20 23:45:44,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {3045#true} assume true; {3045#true} is VALID [2022-02-20 23:45:44,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {3045#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3045#true} is VALID [2022-02-20 23:45:44,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {3045#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {3045#true} is VALID [2022-02-20 23:45:44,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {3045#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3045#true} is VALID [2022-02-20 23:45:44,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,211 INFO L272 TraceCheckUtils]: 3: Hoare triple {3045#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {3045#true} is VALID [2022-02-20 23:45:44,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {3045#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; {3045#true} is VALID [2022-02-20 23:45:44,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {3045#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); {3045#true} is VALID [2022-02-20 23:45:44,213 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:44,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:44,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664603570] [2022-02-20 23:45:44,213 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:45:44,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775736629] [2022-02-20 23:45:44,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775736629] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:45:44,214 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:45:44,214 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2022-02-20 23:45:44,215 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582012767] [2022-02-20 23:45:44,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:45:44,216 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:44,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:44,216 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:44,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:44,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:45:44,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:44,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:45:44,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:45:44,274 INFO L87 Difference]: Start difference. First operand 229 states and 258 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:45:54,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:54,337 INFO L93 Difference]: Finished difference Result 248 states and 282 transitions. [2022-02-20 23:45:54,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:45:54,337 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:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:54,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:45:54,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 284 transitions. [2022-02-20 23:45:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:45:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 284 transitions. [2022-02-20 23:45:54,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 284 transitions. [2022-02-20 23:45:54,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 284 edges. 284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:54,560 INFO L225 Difference]: With dead ends: 248 [2022-02-20 23:45:54,560 INFO L226 Difference]: Without dead ends: 248 [2022-02-20 23:45:54,561 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:45:54,561 INFO L933 BasicCegarLoop]: 230 mSDtfsCounter, 99 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:54,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 1876 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 657 Invalid, 0 Unknown, 248 Unchecked, 0.5s Time] [2022-02-20 23:45:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-02-20 23:45:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 238. [2022-02-20 23:45:54,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:54,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 248 states. Second operand has 238 states, 142 states have (on average 1.732394366197183) internal successors, (246), 222 states have internal predecessors, (246), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-02-20 23:45:54,570 INFO L74 IsIncluded]: Start isIncluded. First operand 248 states. Second operand has 238 states, 142 states have (on average 1.732394366197183) internal successors, (246), 222 states have internal predecessors, (246), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-02-20 23:45:54,571 INFO L87 Difference]: Start difference. First operand 248 states. Second operand has 238 states, 142 states have (on average 1.732394366197183) internal successors, (246), 222 states have internal predecessors, (246), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-02-20 23:45:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:54,579 INFO L93 Difference]: Finished difference Result 248 states and 282 transitions. [2022-02-20 23:45:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 282 transitions. [2022-02-20 23:45:54,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:54,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:54,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 142 states have (on average 1.732394366197183) internal successors, (246), 222 states have internal predecessors, (246), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) Second operand 248 states. [2022-02-20 23:45:54,582 INFO L87 Difference]: Start difference. First operand has 238 states, 142 states have (on average 1.732394366197183) internal successors, (246), 222 states have internal predecessors, (246), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) Second operand 248 states. [2022-02-20 23:45:54,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:54,590 INFO L93 Difference]: Finished difference Result 248 states and 282 transitions. [2022-02-20 23:45:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 282 transitions. [2022-02-20 23:45:54,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:54,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:54,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:54,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 142 states have (on average 1.732394366197183) internal successors, (246), 222 states have internal predecessors, (246), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2022-02-20 23:45:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 269 transitions. [2022-02-20 23:45:54,599 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 269 transitions. Word has length 73 [2022-02-20 23:45:54,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:54,600 INFO L470 AbstractCegarLoop]: Abstraction has 238 states and 269 transitions. [2022-02-20 23:45:54,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 23:45:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 269 transitions. [2022-02-20 23:45:54,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 23:45:54,602 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:54,602 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:54,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:54,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:54,815 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2022-02-20 23:45:54,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:54,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1115615019, now seen corresponding path program 1 times [2022-02-20 23:45:54,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:54,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437543731] [2022-02-20 23:45:54,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:54,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:54,846 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:45:54,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1498568221] [2022-02-20 23:45:54,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:54,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:54,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:54,849 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:54,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:45:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:54,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 50 conjunts are in the unsatisfiable core [2022-02-20 23:45:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:55,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:00,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:00,400 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 19 treesize of output 21 [2022-02-20 23:46:00,648 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:46:00,649 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:01,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {4496#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); {4496#true} is VALID [2022-02-20 23:46:01,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,400 INFO L272 TraceCheckUtils]: 3: Hoare triple {4496#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {4496#true} is VALID [2022-02-20 23:46:01,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {4496#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4496#true} is VALID [2022-02-20 23:46:01,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {4496#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {4496#true} is VALID [2022-02-20 23:46:01,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {4496#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4496#true} is VALID [2022-02-20 23:46:01,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-02-20 23:46:01,401 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4496#true} {4496#true} #408#return; {4496#true} is VALID [2022-02-20 23:46:01,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,401 INFO L272 TraceCheckUtils]: 15: Hoare triple {4496#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {4496#true} is VALID [2022-02-20 23:46:01,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {4496#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4496#true} is VALID [2022-02-20 23:46:01,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {4496#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {4496#true} is VALID [2022-02-20 23:46:01,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {4496#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4496#true} is VALID [2022-02-20 23:46:01,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-02-20 23:46:01,402 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4496#true} {4496#true} #410#return; {4496#true} is VALID [2022-02-20 23:46:01,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,403 INFO L272 TraceCheckUtils]: 27: Hoare triple {4496#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {4496#true} is VALID [2022-02-20 23:46:01,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {4496#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4496#true} is VALID [2022-02-20 23:46:01,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {4496#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {4496#true} is VALID [2022-02-20 23:46:01,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {4496#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4496#true} is VALID [2022-02-20 23:46:01,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-02-20 23:46:01,404 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4496#true} {4496#true} #412#return; {4496#true} is VALID [2022-02-20 23:46:01,404 INFO L290 TraceCheckUtils]: 37: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,405 INFO L272 TraceCheckUtils]: 39: Hoare triple {4496#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {4496#true} is VALID [2022-02-20 23:46:01,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {4496#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4496#true} is VALID [2022-02-20 23:46:01,405 INFO L290 TraceCheckUtils]: 42: Hoare triple {4496#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {4496#true} is VALID [2022-02-20 23:46:01,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {4496#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4496#true} is VALID [2022-02-20 23:46:01,406 INFO L290 TraceCheckUtils]: 44: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,406 INFO L290 TraceCheckUtils]: 45: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,406 INFO L290 TraceCheckUtils]: 46: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,406 INFO L290 TraceCheckUtils]: 47: Hoare triple {4496#true} assume true; {4496#true} is VALID [2022-02-20 23:46:01,406 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4496#true} {4496#true} #414#return; {4496#true} is VALID [2022-02-20 23:46:01,407 INFO L290 TraceCheckUtils]: 49: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,407 INFO L290 TraceCheckUtils]: 50: Hoare triple {4496#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; {4496#true} is VALID [2022-02-20 23:46:01,407 INFO L272 TraceCheckUtils]: 51: Hoare triple {4496#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {4496#true} is VALID [2022-02-20 23:46:01,412 INFO L290 TraceCheckUtils]: 52: Hoare triple {4496#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; {4657#(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) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) |zalloc_or_die_#Ultimate.C_memset_#amount#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))))} is VALID [2022-02-20 23:46:01,413 INFO L290 TraceCheckUtils]: 53: Hoare triple {4657#(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) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) |zalloc_or_die_#Ultimate.C_memset_#amount#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4661#(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) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) |zalloc_or_die_#Ultimate.C_memset_#amount#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1))} is VALID [2022-02-20 23:46:01,704 INFO L290 TraceCheckUtils]: 54: Hoare triple {4661#(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) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) |zalloc_or_die_#Ultimate.C_memset_#amount#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {4665#(and (= |zalloc_or_die_#Ultimate.C_memset_#t~loopctr39#1| 0) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (<= |zalloc_or_die_#Ultimate.C_memset_#amount#1| (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|)) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) |zalloc_or_die_#Ultimate.C_memset_#amount#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1))} is VALID [2022-02-20 23:46:01,768 INFO L290 TraceCheckUtils]: 55: Hoare triple {4665#(and (= |zalloc_or_die_#Ultimate.C_memset_#t~loopctr39#1| 0) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (<= |zalloc_or_die_#Ultimate.C_memset_#amount#1| (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|)) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) |zalloc_or_die_#Ultimate.C_memset_#amount#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1))} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4669#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int) (|aux_div_zalloc_or_die_#Ultimate.C_memset_#amount#1_61| Int)) (and (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (* |aux_div_zalloc_or_die_#Ultimate.C_memset_#amount#1_61| 4294967296)) (<= (* |aux_div_zalloc_or_die_#Ultimate.C_memset_#amount#1_61| 4294967296) (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|)) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1))} is VALID [2022-02-20 23:46:01,770 INFO L290 TraceCheckUtils]: 56: Hoare triple {4669#(and (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int) (|aux_div_zalloc_or_die_#Ultimate.C_memset_#amount#1_61| Int)) (and (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (* |aux_div_zalloc_or_die_#Ultimate.C_memset_#amount#1_61| 4294967296)) (<= (* |aux_div_zalloc_or_die_#Ultimate.C_memset_#amount#1_61| 4294967296) (select |#length| |zalloc_or_die_calloc_model_~ptr~0#1.base|)) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= |zalloc_or_die_calloc_model_~ptr~0#1.offset| 0) (= (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; {4673#(and (= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1) (= |zalloc_or_die_calloc_model_#res#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (div (- (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|)) (- 4294967296)) (div (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) 4294967296)) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))))} is VALID [2022-02-20 23:46:03,774 WARN L290 TraceCheckUtils]: 57: Hoare triple {4673#(and (= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1) (= |zalloc_or_die_calloc_model_#res#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (div (- (* |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|)) (- 4294967296)) (div (select |#length| |zalloc_or_die_calloc_model_#res#1.base|) 4294967296)) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~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; {4677#(and (= |zalloc_or_die_~ptr~1#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |zalloc_or_die_~ptr~1#1.base|) 4294967296)) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1))} is UNKNOWN [2022-02-20 23:46:03,775 INFO L290 TraceCheckUtils]: 58: Hoare triple {4677#(and (= |zalloc_or_die_~ptr~1#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |zalloc_or_die_~ptr~1#1.base|) 4294967296)) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (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; {4681#(and (= |zalloc_or_die_#res#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |zalloc_or_die_#res#1.base|) 4294967296)) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} is VALID [2022-02-20 23:46:03,777 INFO L290 TraceCheckUtils]: 59: Hoare triple {4681#(and (= |zalloc_or_die_#res#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |zalloc_or_die_#res#1.base|) 4294967296)) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} assume true; {4681#(and (= |zalloc_or_die_#res#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |zalloc_or_die_#res#1.base|) 4294967296)) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} is VALID [2022-02-20 23:46:03,778 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {4681#(and (= |zalloc_or_die_#res#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |zalloc_or_die_#res#1.base|) 4294967296)) (<= |zalloc_or_die_#in~size#1| |zalloc_or_die_calloc_model_~size#1|))) (= (select |#valid| |zalloc_or_die_#res#1.base|) 1))} {4496#true} #416#return; {4688#(and (= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 4294967296)))) (= |ULTIMATE.start_l4_insert_#t~ret6#1.offset| 0))} is VALID [2022-02-20 23:46:03,779 INFO L290 TraceCheckUtils]: 61: Hoare triple {4688#(and (= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 4294967296)))) (= |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; {4692#(and (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) 4294967296)) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|))))} is VALID [2022-02-20 23:46:03,780 INFO L272 TraceCheckUtils]: 62: Hoare triple {4692#(and (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) 4294967296)) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|))))} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {4696#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:46:03,781 INFO L290 TraceCheckUtils]: 63: Hoare triple {4696#(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; {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#length|)))} is VALID [2022-02-20 23:46:03,781 INFO L290 TraceCheckUtils]: 64: Hoare triple {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#length|)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#length|)))} is VALID [2022-02-20 23:46:03,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#length|)))} is VALID [2022-02-20 23:46:03,783 INFO L290 TraceCheckUtils]: 66: Hoare triple {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#length|)))} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#length|)))} is VALID [2022-02-20 23:46:03,783 INFO L290 TraceCheckUtils]: 67: Hoare triple {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#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; {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#length|)))} is VALID [2022-02-20 23:46:03,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#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; {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#length|)))} is VALID [2022-02-20 23:46:03,785 INFO L290 TraceCheckUtils]: 69: Hoare triple {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#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; {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#length|)))} is VALID [2022-02-20 23:46:03,785 INFO L290 TraceCheckUtils]: 70: Hoare triple {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#length|)))} assume true; {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#length|)))} is VALID [2022-02-20 23:46:03,787 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {4700#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int) (v_ArrVal_63 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_63) |#length|)))} {4692#(and (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) 4294967296)) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|))))} #418#return; {4725#(and (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) 4294967296)) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|))))} is VALID [2022-02-20 23:46:03,789 INFO L290 TraceCheckUtils]: 72: Hoare triple {4725#(and (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (exists ((|zalloc_or_die_calloc_model_~size#1| Int) (|zalloc_or_die_calloc_model_~nmemb#1| Int)) (and (<= 8 |zalloc_or_die_calloc_model_~size#1|) (<= (div (* (- 1) |zalloc_or_die_calloc_model_~nmemb#1| |zalloc_or_die_calloc_model_~size#1|) (- 4294967296)) (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) 4294967296)) (<= 1 |zalloc_or_die_calloc_model_~nmemb#1|))))} assume !(4 + (4 + l4_insert_~item~0#1.offset) <= #length[l4_insert_~item~0#1.base] && 0 <= 4 + l4_insert_~item~0#1.offset); {4497#false} is VALID [2022-02-20 23:46:03,790 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:03,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:04,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:04,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437543731] [2022-02-20 23:46:04,045 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:04,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498568221] [2022-02-20 23:46:04,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498568221] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:46:04,046 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:46:04,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-02-20 23:46:04,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583401588] [2022-02-20 23:46:04,046 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:04,046 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-02-20 23:46:04,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:04,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 23:46:08,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 47 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:08,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:46:08,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:08,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:46:08,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:46:08,142 INFO L87 Difference]: Start difference. First operand 238 states and 269 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:10,060 INFO L93 Difference]: Finished difference Result 348 states and 405 transitions. [2022-02-20 23:46:10,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:46:10,061 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 395 transitions. [2022-02-20 23:46:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 395 transitions. [2022-02-20 23:46:10,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 395 transitions. [2022-02-20 23:46:14,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 393 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:14,459 INFO L225 Difference]: With dead ends: 348 [2022-02-20 23:46:14,459 INFO L226 Difference]: Without dead ends: 348 [2022-02-20 23:46:14,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:46:14,463 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 110 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 2729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2487 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:14,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 1761 Invalid, 2729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 231 Invalid, 0 Unknown, 2487 Unchecked, 0.2s Time] [2022-02-20 23:46:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-02-20 23:46:14,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 247. [2022-02-20 23:46:14,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:14,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 247 states, 149 states have (on average 1.7046979865771812) internal successors, (254), 229 states have internal predecessors, (254), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (19), 14 states have call predecessors, (19), 12 states have call successors, (19) [2022-02-20 23:46:14,478 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 247 states, 149 states have (on average 1.7046979865771812) internal successors, (254), 229 states have internal predecessors, (254), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (19), 14 states have call predecessors, (19), 12 states have call successors, (19) [2022-02-20 23:46:14,479 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 247 states, 149 states have (on average 1.7046979865771812) internal successors, (254), 229 states have internal predecessors, (254), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (19), 14 states have call predecessors, (19), 12 states have call successors, (19) [2022-02-20 23:46:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:14,496 INFO L93 Difference]: Finished difference Result 348 states and 405 transitions. [2022-02-20 23:46:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 405 transitions. [2022-02-20 23:46:14,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:14,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:14,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 149 states have (on average 1.7046979865771812) internal successors, (254), 229 states have internal predecessors, (254), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (19), 14 states have call predecessors, (19), 12 states have call successors, (19) Second operand 348 states. [2022-02-20 23:46:14,508 INFO L87 Difference]: Start difference. First operand has 247 states, 149 states have (on average 1.7046979865771812) internal successors, (254), 229 states have internal predecessors, (254), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (19), 14 states have call predecessors, (19), 12 states have call successors, (19) Second operand 348 states. [2022-02-20 23:46:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:14,527 INFO L93 Difference]: Finished difference Result 348 states and 405 transitions. [2022-02-20 23:46:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 405 transitions. [2022-02-20 23:46:14,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:14,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:14,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:14,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 149 states have (on average 1.7046979865771812) internal successors, (254), 229 states have internal predecessors, (254), 12 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (19), 14 states have call predecessors, (19), 12 states have call successors, (19) [2022-02-20 23:46:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 285 transitions. [2022-02-20 23:46:14,539 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 285 transitions. Word has length 73 [2022-02-20 23:46:14,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:14,540 INFO L470 AbstractCegarLoop]: Abstraction has 247 states and 285 transitions. [2022-02-20 23:46:14,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 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:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 285 transitions. [2022-02-20 23:46:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 23:46:14,541 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:14,542 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:14,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 23:46:14,755 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:14,755 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2022-02-20 23:46:14,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:14,756 INFO L85 PathProgramCache]: Analyzing trace with hash -739950276, now seen corresponding path program 1 times [2022-02-20 23:46:14,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:14,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957068240] [2022-02-20 23:46:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:14,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:14,788 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:14,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [240186320] [2022-02-20 23:46:14,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:14,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:14,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:14,795 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:14,796 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:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:14,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-20 23:46:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:14,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:15,143 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:19,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:46:19,347 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:19,378 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:46:19,379 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:19,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {6041#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); {6041#true} is VALID [2022-02-20 23:46:19,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,445 INFO L272 TraceCheckUtils]: 3: Hoare triple {6041#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {6041#true} is VALID [2022-02-20 23:46:19,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {6041#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6041#true} is VALID [2022-02-20 23:46:19,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {6041#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {6041#true} is VALID [2022-02-20 23:46:19,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {6041#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6041#true} is VALID [2022-02-20 23:46:19,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {6041#true} assume true; {6041#true} is VALID [2022-02-20 23:46:19,454 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6041#true} {6041#true} #408#return; {6041#true} is VALID [2022-02-20 23:46:19,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,455 INFO L272 TraceCheckUtils]: 15: Hoare triple {6041#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {6041#true} is VALID [2022-02-20 23:46:19,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {6041#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6041#true} is VALID [2022-02-20 23:46:19,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {6041#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {6041#true} is VALID [2022-02-20 23:46:19,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {6041#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6041#true} is VALID [2022-02-20 23:46:19,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {6041#true} assume true; {6041#true} is VALID [2022-02-20 23:46:19,461 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6041#true} {6041#true} #410#return; {6041#true} is VALID [2022-02-20 23:46:19,461 INFO L290 TraceCheckUtils]: 25: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,462 INFO L272 TraceCheckUtils]: 27: Hoare triple {6041#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {6041#true} is VALID [2022-02-20 23:46:19,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {6041#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6041#true} is VALID [2022-02-20 23:46:19,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {6041#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {6041#true} is VALID [2022-02-20 23:46:19,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {6041#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6041#true} is VALID [2022-02-20 23:46:19,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,467 INFO L290 TraceCheckUtils]: 35: Hoare triple {6041#true} assume true; {6041#true} is VALID [2022-02-20 23:46:19,467 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6041#true} {6041#true} #412#return; {6041#true} is VALID [2022-02-20 23:46:19,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,468 INFO L290 TraceCheckUtils]: 38: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,468 INFO L272 TraceCheckUtils]: 39: Hoare triple {6041#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {6041#true} is VALID [2022-02-20 23:46:19,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {6041#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6041#true} is VALID [2022-02-20 23:46:19,468 INFO L290 TraceCheckUtils]: 42: Hoare triple {6041#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {6041#true} is VALID [2022-02-20 23:46:19,469 INFO L290 TraceCheckUtils]: 43: Hoare triple {6041#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6041#true} is VALID [2022-02-20 23:46:19,469 INFO L290 TraceCheckUtils]: 44: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {6041#true} assume true; {6041#true} is VALID [2022-02-20 23:46:19,469 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6041#true} {6041#true} #414#return; {6041#true} is VALID [2022-02-20 23:46:19,470 INFO L290 TraceCheckUtils]: 49: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,470 INFO L290 TraceCheckUtils]: 50: Hoare triple {6041#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; {6041#true} is VALID [2022-02-20 23:46:19,470 INFO L272 TraceCheckUtils]: 51: Hoare triple {6041#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {6041#true} is VALID [2022-02-20 23:46:19,476 INFO L290 TraceCheckUtils]: 52: Hoare triple {6041#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; {6202#(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:19,477 INFO L290 TraceCheckUtils]: 53: Hoare triple {6202#(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]; {6206#(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:19,478 INFO L290 TraceCheckUtils]: 54: Hoare triple {6206#(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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {6206#(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:19,480 INFO L290 TraceCheckUtils]: 55: Hoare triple {6206#(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~loopctr39#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~loopctr39#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~loopctr39#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr39#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr39#1 := 1 + #Ultimate.C_memset_#t~loopctr39#1; {6206#(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:19,482 INFO L290 TraceCheckUtils]: 56: Hoare triple {6206#(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~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6206#(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:19,484 INFO L290 TraceCheckUtils]: 57: Hoare triple {6206#(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; {6219#(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:19,485 INFO L290 TraceCheckUtils]: 58: Hoare triple {6219#(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; {6223#(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:19,486 INFO L290 TraceCheckUtils]: 59: Hoare triple {6223#(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; {6227#(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:19,487 INFO L290 TraceCheckUtils]: 60: Hoare triple {6227#(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; {6227#(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:19,489 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {6227#(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))} {6041#true} #416#return; {6234#(and (= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_24| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|))) (= |ULTIMATE.start_l4_insert_#t~ret6#1.offset| 0))} is VALID [2022-02-20 23:46:19,490 INFO L290 TraceCheckUtils]: 62: Hoare triple {6234#(and (= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_24| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|)) (= (mod (select |#length| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|) 0) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|))) (= |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; {6238#(and (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_24| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|)) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|) 0))))} is VALID [2022-02-20 23:46:19,491 INFO L272 TraceCheckUtils]: 63: Hoare triple {6238#(and (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_24| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|)) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|) 0))))} call l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset := zalloc_or_die(119); {6242#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 23:46:19,493 INFO L290 TraceCheckUtils]: 64: Hoare triple {6242#(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; {6246#(exists ((v_ArrVal_104 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_104) |#length|)))} is VALID [2022-02-20 23:46:19,494 INFO L290 TraceCheckUtils]: 65: Hoare triple {6246#(exists ((v_ArrVal_104 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_104) |#length|)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6246#(exists ((v_ArrVal_104 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_104) |#length|)))} is VALID [2022-02-20 23:46:19,495 INFO L290 TraceCheckUtils]: 66: Hoare triple {6246#(exists ((v_ArrVal_104 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_104) |#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {6246#(exists ((v_ArrVal_104 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_104) |#length|)))} is VALID [2022-02-20 23:46:19,496 INFO L290 TraceCheckUtils]: 67: Hoare triple {6246#(exists ((v_ArrVal_104 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_104) |#length|)))} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6246#(exists ((v_ArrVal_104 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_104) |#length|)))} is VALID [2022-02-20 23:46:19,497 INFO L290 TraceCheckUtils]: 68: Hoare triple {6246#(exists ((v_ArrVal_104 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_104) |#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; {6246#(exists ((v_ArrVal_104 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_104) |#length|)))} is VALID [2022-02-20 23:46:19,498 INFO L290 TraceCheckUtils]: 69: Hoare triple {6246#(exists ((v_ArrVal_104 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_104) |#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; {6246#(exists ((v_ArrVal_104 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_104) |#length|)))} is VALID [2022-02-20 23:46:19,499 INFO L290 TraceCheckUtils]: 70: Hoare triple {6246#(exists ((v_ArrVal_104 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_104) |#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; {6246#(exists ((v_ArrVal_104 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_104) |#length|)))} is VALID [2022-02-20 23:46:19,500 INFO L290 TraceCheckUtils]: 71: Hoare triple {6246#(exists ((v_ArrVal_104 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_104) |#length|)))} assume true; {6246#(exists ((v_ArrVal_104 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_104) |#length|)))} is VALID [2022-02-20 23:46:19,505 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {6246#(exists ((v_ArrVal_104 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_104) |#length|)))} {6238#(and (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_24| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|)) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|) 0))))} #418#return; {6271#(and (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_24| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|)) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|) 0))))} is VALID [2022-02-20 23:46:19,507 INFO L290 TraceCheckUtils]: 73: Hoare triple {6271#(and (= |ULTIMATE.start_l4_insert_~item~0#1.offset| 0) (exists ((|v_zalloc_or_die_#in~size#1_AFTER_CALL_24| Int)) (and (<= 1 (div (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|)) (<= 8 |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|) (= (mod (select |#length| |ULTIMATE.start_l4_insert_~item~0#1.base|) |v_zalloc_or_die_#in~size#1_AFTER_CALL_24|) 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); {6042#false} is VALID [2022-02-20 23:46:19,510 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:19,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:19,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:19,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957068240] [2022-02-20 23:46:19,722 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:19,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240186320] [2022-02-20 23:46:19,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240186320] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:46:19,722 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:46:19,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-02-20 23:46:19,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770211341] [2022-02-20 23:46:19,723 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:19,723 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 74 [2022-02-20 23:46:19,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:19,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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:19,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:19,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:46:19,783 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:19,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:46:19,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:46:19,784 INFO L87 Difference]: Start difference. First operand 247 states and 285 transitions. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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:23,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:23,332 INFO L93 Difference]: Finished difference Result 347 states and 403 transitions. [2022-02-20 23:46:23,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:46:23,332 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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 74 [2022-02-20 23:46:23,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 377 transitions. [2022-02-20 23:46:23,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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:23,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 377 transitions. [2022-02-20 23:46:23,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 377 transitions. [2022-02-20 23:46:23,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 377 edges. 377 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:23,666 INFO L225 Difference]: With dead ends: 347 [2022-02-20 23:46:23,666 INFO L226 Difference]: Without dead ends: 347 [2022-02-20 23:46:23,666 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:46:23,667 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 111 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 728 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:23,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 880 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1165 Invalid, 0 Unknown, 728 Unchecked, 1.2s Time] [2022-02-20 23:46:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-02-20 23:46:23,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 243. [2022-02-20 23:46:23,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:23,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 347 states. Second operand has 243 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 227 states have internal predecessors, (250), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (17), 12 states have call predecessors, (17), 11 states have call successors, (17) [2022-02-20 23:46:23,674 INFO L74 IsIncluded]: Start isIncluded. First operand 347 states. Second operand has 243 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 227 states have internal predecessors, (250), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (17), 12 states have call predecessors, (17), 11 states have call successors, (17) [2022-02-20 23:46:23,675 INFO L87 Difference]: Start difference. First operand 347 states. Second operand has 243 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 227 states have internal predecessors, (250), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (17), 12 states have call predecessors, (17), 11 states have call successors, (17) [2022-02-20 23:46:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:23,686 INFO L93 Difference]: Finished difference Result 347 states and 403 transitions. [2022-02-20 23:46:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 403 transitions. [2022-02-20 23:46:23,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:23,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:23,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 227 states have internal predecessors, (250), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (17), 12 states have call predecessors, (17), 11 states have call successors, (17) Second operand 347 states. [2022-02-20 23:46:23,689 INFO L87 Difference]: Start difference. First operand has 243 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 227 states have internal predecessors, (250), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (17), 12 states have call predecessors, (17), 11 states have call successors, (17) Second operand 347 states. [2022-02-20 23:46:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:23,700 INFO L93 Difference]: Finished difference Result 347 states and 403 transitions. [2022-02-20 23:46:23,700 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 403 transitions. [2022-02-20 23:46:23,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:23,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:23,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:23,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 227 states have internal predecessors, (250), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (17), 12 states have call predecessors, (17), 11 states have call successors, (17) [2022-02-20 23:46:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 278 transitions. [2022-02-20 23:46:23,710 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 278 transitions. Word has length 74 [2022-02-20 23:46:23,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:23,710 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 278 transitions. [2022-02-20 23:46:23,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 9 states have internal predecessors, (38), 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:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 278 transitions. [2022-02-20 23:46:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 23:46:23,711 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:23,712 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:23,737 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:23,927 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:23,927 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2022-02-20 23:46:23,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash -801421617, now seen corresponding path program 1 times [2022-02-20 23:46:23,928 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:23,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432992475] [2022-02-20 23:46:23,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:23,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:23,959 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:23,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1961983901] [2022-02-20 23:46:23,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:23,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:23,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:23,965 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:23,972 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:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:24,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:46:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:24,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:24,580 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:24,580 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:24,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {7577#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); {7577#true} is VALID [2022-02-20 23:46:24,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,600 INFO L272 TraceCheckUtils]: 3: Hoare triple {7577#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {7577#true} is VALID [2022-02-20 23:46:24,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {7577#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7577#true} is VALID [2022-02-20 23:46:24,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {7577#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {7577#true} is VALID [2022-02-20 23:46:24,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {7577#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7577#true} is VALID [2022-02-20 23:46:24,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-02-20 23:46:24,602 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7577#true} {7577#true} #408#return; {7577#true} is VALID [2022-02-20 23:46:24,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,602 INFO L272 TraceCheckUtils]: 15: Hoare triple {7577#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {7577#true} is VALID [2022-02-20 23:46:24,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {7577#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7577#true} is VALID [2022-02-20 23:46:24,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {7577#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {7577#true} is VALID [2022-02-20 23:46:24,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {7577#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7577#true} is VALID [2022-02-20 23:46:24,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-02-20 23:46:24,604 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7577#true} {7577#true} #410#return; {7577#true} is VALID [2022-02-20 23:46:24,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,604 INFO L272 TraceCheckUtils]: 27: Hoare triple {7577#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {7577#true} is VALID [2022-02-20 23:46:24,604 INFO L290 TraceCheckUtils]: 28: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {7577#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7577#true} is VALID [2022-02-20 23:46:24,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {7577#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {7577#true} is VALID [2022-02-20 23:46:24,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {7577#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7577#true} is VALID [2022-02-20 23:46:24,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-02-20 23:46:24,606 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7577#true} {7577#true} #412#return; {7577#true} is VALID [2022-02-20 23:46:24,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,606 INFO L272 TraceCheckUtils]: 39: Hoare triple {7577#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {7577#true} is VALID [2022-02-20 23:46:24,606 INFO L290 TraceCheckUtils]: 40: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,607 INFO L290 TraceCheckUtils]: 41: Hoare triple {7577#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7577#true} is VALID [2022-02-20 23:46:24,607 INFO L290 TraceCheckUtils]: 42: Hoare triple {7577#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {7577#true} is VALID [2022-02-20 23:46:24,607 INFO L290 TraceCheckUtils]: 43: Hoare triple {7577#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7577#true} is VALID [2022-02-20 23:46:24,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,607 INFO L290 TraceCheckUtils]: 45: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,607 INFO L290 TraceCheckUtils]: 46: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-02-20 23:46:24,608 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7577#true} {7577#true} #414#return; {7577#true} is VALID [2022-02-20 23:46:24,608 INFO L290 TraceCheckUtils]: 49: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,608 INFO L290 TraceCheckUtils]: 50: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:24,608 INFO L272 TraceCheckUtils]: 51: Hoare triple {7577#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {7577#true} is VALID [2022-02-20 23:46:24,609 INFO L290 TraceCheckUtils]: 52: Hoare triple {7577#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; {7738#(= |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:24,609 INFO L290 TraceCheckUtils]: 53: Hoare triple {7738#(= |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]; {7742#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:24,610 INFO L290 TraceCheckUtils]: 54: Hoare triple {7742#(= (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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {7742#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:24,610 INFO L290 TraceCheckUtils]: 55: Hoare triple {7742#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7742#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:24,611 INFO L290 TraceCheckUtils]: 56: Hoare triple {7742#(= (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; {7752#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:24,611 INFO L290 TraceCheckUtils]: 57: Hoare triple {7752#(= (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; {7756#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:24,612 INFO L290 TraceCheckUtils]: 58: Hoare triple {7756#(= (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; {7760#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:24,612 INFO L290 TraceCheckUtils]: 59: Hoare triple {7760#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {7760#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:24,613 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7760#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {7577#true} #416#return; {7767#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:46:24,613 INFO L290 TraceCheckUtils]: 61: Hoare triple {7767#(= (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; {7771#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:24,614 INFO L272 TraceCheckUtils]: 62: Hoare triple {7771#(= (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); {7775#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:24,616 INFO L290 TraceCheckUtils]: 63: Hoare triple {7775#(= |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; {7779#(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:24,617 INFO L290 TraceCheckUtils]: 64: Hoare triple {7779#(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]; {7783#(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:24,618 INFO L290 TraceCheckUtils]: 65: Hoare triple {7783#(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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {7783#(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:24,620 INFO L290 TraceCheckUtils]: 66: Hoare triple {7783#(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~loopctr39#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~loopctr39#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~loopctr39#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr39#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr39#1 := 1 + #Ultimate.C_memset_#t~loopctr39#1; {7783#(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:24,621 INFO L290 TraceCheckUtils]: 67: Hoare triple {7783#(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~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7783#(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:24,622 INFO L290 TraceCheckUtils]: 68: Hoare triple {7783#(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; {7783#(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:24,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {7783#(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; {7783#(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:24,623 INFO L290 TraceCheckUtils]: 70: Hoare triple {7783#(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; {7783#(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:24,624 INFO L290 TraceCheckUtils]: 71: Hoare triple {7783#(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; {7783#(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:24,625 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {7783#(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)))} {7771#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #418#return; {7771#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:24,626 INFO L290 TraceCheckUtils]: 73: Hoare triple {7771#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {7578#false} is VALID [2022-02-20 23:46:24,626 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:24,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:25,095 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:46:25,096 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:25,230 INFO L290 TraceCheckUtils]: 73: Hoare triple {7771#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} assume !(1 == #valid[l4_insert_~item~0#1.base]); {7578#false} is VALID [2022-02-20 23:46:25,231 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)))} {7771#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} #418#return; {7771#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:25,232 INFO L290 TraceCheckUtils]: 71: Hoare triple {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)))} assume true; {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)))} is VALID [2022-02-20 23:46:25,233 INFO L290 TraceCheckUtils]: 70: Hoare triple {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 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; {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)))} is VALID [2022-02-20 23:46:25,234 INFO L290 TraceCheckUtils]: 69: Hoare triple {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 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; {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)))} is VALID [2022-02-20 23:46:25,234 INFO L290 TraceCheckUtils]: 68: Hoare triple {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 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; {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)))} is VALID [2022-02-20 23:46:25,235 INFO L290 TraceCheckUtils]: 67: Hoare triple {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)))} is VALID [2022-02-20 23:46:25,237 INFO L290 TraceCheckUtils]: 66: Hoare triple {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)))} assume #Ultimate.C_memset_#t~loopctr39#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~loopctr39#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~loopctr39#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr39#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr39#1 := 1 + #Ultimate.C_memset_#t~loopctr39#1; {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)))} is VALID [2022-02-20 23:46:25,238 INFO L290 TraceCheckUtils]: 65: Hoare triple {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)))} is VALID [2022-02-20 23:46:25,238 INFO L290 TraceCheckUtils]: 64: Hoare triple {7842#(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_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1))))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)))} is VALID [2022-02-20 23:46:25,241 INFO L290 TraceCheckUtils]: 63: Hoare triple {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 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; {7842#(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_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1))))} is VALID [2022-02-20 23:46:25,242 INFO L272 TraceCheckUtils]: 62: Hoare triple {7771#(= (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); {7817#(forall ((|v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6| Int)) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)) (= (select |#valid| |v_ULTIMATE.start_l4_insert_~item~0#1.base_BEFORE_CALL_6|) 1)))} is VALID [2022-02-20 23:46:25,242 INFO L290 TraceCheckUtils]: 61: Hoare triple {7767#(= (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; {7771#(= (select |#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:25,243 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {7760#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {7577#true} #416#return; {7767#(= (select |#valid| |ULTIMATE.start_l4_insert_#t~ret6#1.base|) 1)} is VALID [2022-02-20 23:46:25,244 INFO L290 TraceCheckUtils]: 59: Hoare triple {7760#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {7760#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:25,244 INFO L290 TraceCheckUtils]: 58: Hoare triple {7756#(= (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; {7760#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:25,245 INFO L290 TraceCheckUtils]: 57: Hoare triple {7752#(= (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; {7756#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:25,245 INFO L290 TraceCheckUtils]: 56: Hoare triple {7742#(= (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; {7752#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:25,246 INFO L290 TraceCheckUtils]: 55: Hoare triple {7742#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7742#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:25,246 INFO L290 TraceCheckUtils]: 54: Hoare triple {7742#(= (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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {7742#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:25,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {7738#(= |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]; {7742#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:25,247 INFO L290 TraceCheckUtils]: 52: Hoare triple {7577#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; {7738#(= |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:25,247 INFO L272 TraceCheckUtils]: 51: Hoare triple {7577#true} call l4_insert_#t~ret6#1.base, l4_insert_#t~ret6#1.offset := zalloc_or_die(8); {7577#true} is VALID [2022-02-20 23:46:25,247 INFO L290 TraceCheckUtils]: 50: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,248 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7577#true} {7577#true} #414#return; {7577#true} is VALID [2022-02-20 23:46:25,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-02-20 23:46:25,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,248 INFO L290 TraceCheckUtils]: 44: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {7577#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7577#true} is VALID [2022-02-20 23:46:25,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {7577#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {7577#true} is VALID [2022-02-20 23:46:25,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {7577#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7577#true} is VALID [2022-02-20 23:46:25,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,249 INFO L272 TraceCheckUtils]: 39: Hoare triple {7577#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {7577#true} is VALID [2022-02-20 23:46:25,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,250 INFO L290 TraceCheckUtils]: 37: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,250 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7577#true} {7577#true} #412#return; {7577#true} is VALID [2022-02-20 23:46:25,250 INFO L290 TraceCheckUtils]: 35: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-02-20 23:46:25,250 INFO L290 TraceCheckUtils]: 34: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,250 INFO L290 TraceCheckUtils]: 33: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {7577#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7577#true} is VALID [2022-02-20 23:46:25,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {7577#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {7577#true} is VALID [2022-02-20 23:46:25,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {7577#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7577#true} is VALID [2022-02-20 23:46:25,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,251 INFO L272 TraceCheckUtils]: 27: Hoare triple {7577#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {7577#true} is VALID [2022-02-20 23:46:25,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,252 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7577#true} {7577#true} #410#return; {7577#true} is VALID [2022-02-20 23:46:25,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-02-20 23:46:25,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {7577#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7577#true} is VALID [2022-02-20 23:46:25,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {7577#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {7577#true} is VALID [2022-02-20 23:46:25,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {7577#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7577#true} is VALID [2022-02-20 23:46:25,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,253 INFO L272 TraceCheckUtils]: 15: Hoare triple {7577#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {7577#true} is VALID [2022-02-20 23:46:25,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,253 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {7577#true} {7577#true} #408#return; {7577#true} is VALID [2022-02-20 23:46:25,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {7577#true} assume true; {7577#true} is VALID [2022-02-20 23:46:25,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {7577#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7577#true} is VALID [2022-02-20 23:46:25,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {7577#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {7577#true} is VALID [2022-02-20 23:46:25,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {7577#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7577#true} is VALID [2022-02-20 23:46:25,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,255 INFO L272 TraceCheckUtils]: 3: Hoare triple {7577#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {7577#true} is VALID [2022-02-20 23:46:25,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {7577#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; {7577#true} is VALID [2022-02-20 23:46:25,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {7577#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); {7577#true} is VALID [2022-02-20 23:46:25,256 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:25,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:25,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432992475] [2022-02-20 23:46:25,256 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:25,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961983901] [2022-02-20 23:46:25,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961983901] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:46:25,257 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:46:25,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 13 [2022-02-20 23:46:25,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254361755] [2022-02-20 23:46:25,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:25,258 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:25,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:25,259 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:25,324 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:25,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:46:25,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:25,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:46:25,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:46:25,326 INFO L87 Difference]: Start difference. First operand 243 states and 278 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:27,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:27,546 INFO L93 Difference]: Finished difference Result 379 states and 448 transitions. [2022-02-20 23:46:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:46:27,546 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:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:27,547 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:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 423 transitions. [2022-02-20 23:46:27,551 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:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 423 transitions. [2022-02-20 23:46:27,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 423 transitions. [2022-02-20 23:46:27,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:27,905 INFO L225 Difference]: With dead ends: 379 [2022-02-20 23:46:27,905 INFO L226 Difference]: Without dead ends: 379 [2022-02-20 23:46:27,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:46:27,907 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 214 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:27,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 1679 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 829 Invalid, 0 Unknown, 202 Unchecked, 0.6s Time] [2022-02-20 23:46:27,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-02-20 23:46:27,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 241. [2022-02-20 23:46:27,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:27,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 241 states, 146 states have (on average 1.6986301369863013) internal successors, (248), 226 states have internal predecessors, (248), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2022-02-20 23:46:27,916 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 241 states, 146 states have (on average 1.6986301369863013) internal successors, (248), 226 states have internal predecessors, (248), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2022-02-20 23:46:27,916 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 241 states, 146 states have (on average 1.6986301369863013) internal successors, (248), 226 states have internal predecessors, (248), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2022-02-20 23:46:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:27,929 INFO L93 Difference]: Finished difference Result 379 states and 448 transitions. [2022-02-20 23:46:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 448 transitions. [2022-02-20 23:46:27,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:27,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:27,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 146 states have (on average 1.6986301369863013) internal successors, (248), 226 states have internal predecessors, (248), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) Second operand 379 states. [2022-02-20 23:46:27,934 INFO L87 Difference]: Start difference. First operand has 241 states, 146 states have (on average 1.6986301369863013) internal successors, (248), 226 states have internal predecessors, (248), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) Second operand 379 states. [2022-02-20 23:46:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:27,947 INFO L93 Difference]: Finished difference Result 379 states and 448 transitions. [2022-02-20 23:46:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 448 transitions. [2022-02-20 23:46:27,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:27,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:27,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:27,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 146 states have (on average 1.6986301369863013) internal successors, (248), 226 states have internal predecessors, (248), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2022-02-20 23:46:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 276 transitions. [2022-02-20 23:46:27,958 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 276 transitions. Word has length 74 [2022-02-20 23:46:27,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:27,958 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 276 transitions. [2022-02-20 23:46:27,959 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:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 276 transitions. [2022-02-20 23:46:27,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 23:46:27,960 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:27,960 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:27,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:28,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:28,179 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2022-02-20 23:46:28,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:28,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1635791477, now seen corresponding path program 1 times [2022-02-20 23:46:28,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:28,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811403254] [2022-02-20 23:46:28,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:28,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:28,199 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:28,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789808730] [2022-02-20 23:46:28,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:28,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:28,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:28,201 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:46:28,202 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:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:28,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:46:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:28,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:28,758 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:28,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:46:29,022 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:46:29,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:46:29,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {9422#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); {9422#true} is VALID [2022-02-20 23:46:29,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,052 INFO L272 TraceCheckUtils]: 3: Hoare triple {9422#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {9422#true} is VALID [2022-02-20 23:46:29,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {9422#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9422#true} is VALID [2022-02-20 23:46:29,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {9422#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {9422#true} is VALID [2022-02-20 23:46:29,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {9422#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9422#true} is VALID [2022-02-20 23:46:29,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {9422#true} assume true; {9422#true} is VALID [2022-02-20 23:46:29,053 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9422#true} {9422#true} #408#return; {9422#true} is VALID [2022-02-20 23:46:29,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,054 INFO L272 TraceCheckUtils]: 15: Hoare triple {9422#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {9422#true} is VALID [2022-02-20 23:46:29,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {9422#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9422#true} is VALID [2022-02-20 23:46:29,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {9422#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {9422#true} is VALID [2022-02-20 23:46:29,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {9422#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9422#true} is VALID [2022-02-20 23:46:29,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,055 INFO L290 TraceCheckUtils]: 21: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {9422#true} assume true; {9422#true} is VALID [2022-02-20 23:46:29,055 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9422#true} {9422#true} #410#return; {9422#true} is VALID [2022-02-20 23:46:29,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,056 INFO L272 TraceCheckUtils]: 27: Hoare triple {9422#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {9422#true} is VALID [2022-02-20 23:46:29,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {9422#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9422#true} is VALID [2022-02-20 23:46:29,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {9422#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {9422#true} is VALID [2022-02-20 23:46:29,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {9422#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9422#true} is VALID [2022-02-20 23:46:29,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,057 INFO L290 TraceCheckUtils]: 35: Hoare triple {9422#true} assume true; {9422#true} is VALID [2022-02-20 23:46:29,057 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9422#true} {9422#true} #412#return; {9422#true} is VALID [2022-02-20 23:46:29,057 INFO L290 TraceCheckUtils]: 37: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,057 INFO L290 TraceCheckUtils]: 38: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,057 INFO L272 TraceCheckUtils]: 39: Hoare triple {9422#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {9422#true} is VALID [2022-02-20 23:46:29,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {9422#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; {9547#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:46:29,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {9547#(= |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]; {9551#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:29,059 INFO L290 TraceCheckUtils]: 42: Hoare triple {9551#(= (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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {9551#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:29,059 INFO L290 TraceCheckUtils]: 43: Hoare triple {9551#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9551#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:29,060 INFO L290 TraceCheckUtils]: 44: Hoare triple {9551#(= (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; {9561#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:29,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {9561#(= (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; {9565#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:29,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {9565#(= (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; {9569#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:29,061 INFO L290 TraceCheckUtils]: 47: Hoare triple {9569#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {9569#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:29,062 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9569#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {9422#true} #414#return; {9576#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} is VALID [2022-02-20 23:46:29,062 INFO L290 TraceCheckUtils]: 49: Hoare triple {9576#(= (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; {9580#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:46:29,063 INFO L290 TraceCheckUtils]: 50: Hoare triple {9580#(= (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; {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,063 INFO L272 TraceCheckUtils]: 51: Hoare triple {9584#(= (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); {9588#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:29,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {9588#(= |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; {9592#(exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|))} is VALID [2022-02-20 23:46:29,067 INFO L290 TraceCheckUtils]: 53: Hoare triple {9592#(exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,069 INFO L290 TraceCheckUtils]: 55: Hoare triple {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,070 INFO L290 TraceCheckUtils]: 56: Hoare triple {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#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; {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,071 INFO L290 TraceCheckUtils]: 57: Hoare triple {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#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; {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#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; {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,073 INFO L290 TraceCheckUtils]: 59: Hoare triple {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,074 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #416#return; {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,075 INFO L290 TraceCheckUtils]: 61: Hoare triple {9584#(= (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; {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,075 INFO L272 TraceCheckUtils]: 62: Hoare triple {9584#(= (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); {9588#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:46:29,078 INFO L290 TraceCheckUtils]: 63: Hoare triple {9588#(= |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; {9592#(exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|))} is VALID [2022-02-20 23:46:29,079 INFO L290 TraceCheckUtils]: 64: Hoare triple {9592#(exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,080 INFO L290 TraceCheckUtils]: 65: Hoare triple {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,081 INFO L290 TraceCheckUtils]: 66: Hoare triple {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,082 INFO L290 TraceCheckUtils]: 67: Hoare triple {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#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; {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,083 INFO L290 TraceCheckUtils]: 68: Hoare triple {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#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; {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,084 INFO L290 TraceCheckUtils]: 69: Hoare triple {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#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; {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,084 INFO L290 TraceCheckUtils]: 70: Hoare triple {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} assume true; {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} is VALID [2022-02-20 23:46:29,086 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9596#(exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((v_ArrVal_184 Int)) (= (store |old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| v_ArrVal_184) |#valid|)) (= (select |#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)))} {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #418#return; {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,086 INFO L290 TraceCheckUtils]: 72: Hoare triple {9584#(= (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 {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,087 INFO L290 TraceCheckUtils]: 73: Hoare triple {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,087 INFO L290 TraceCheckUtils]: 74: Hoare triple {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} assume !(1 == #valid[l4_insert_~list#1.base]); {9423#false} is VALID [2022-02-20 23:46:29,088 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:29,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:29,876 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:46:29,877 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:29,972 INFO L290 TraceCheckUtils]: 74: Hoare triple {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} assume !(1 == #valid[l4_insert_~list#1.base]); {9423#false} is VALID [2022-02-20 23:46:29,972 INFO L290 TraceCheckUtils]: 73: Hoare triple {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} havoc l4_insert_#t~ret7#1.base, l4_insert_#t~ret7#1.offset; {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,973 INFO L290 TraceCheckUtils]: 72: Hoare triple {9584#(= (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 {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,974 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9672#(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))))} {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #418#return; {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,974 INFO L290 TraceCheckUtils]: 70: Hoare triple {9672#(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; {9672#(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:29,975 INFO L290 TraceCheckUtils]: 69: Hoare triple {9672#(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; {9672#(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:29,975 INFO L290 TraceCheckUtils]: 68: Hoare triple {9672#(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; {9672#(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:29,976 INFO L290 TraceCheckUtils]: 67: Hoare triple {9672#(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; {9672#(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:29,976 INFO L290 TraceCheckUtils]: 66: Hoare triple {9672#(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~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9672#(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:29,976 INFO L290 TraceCheckUtils]: 65: Hoare triple {9672#(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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {9672#(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:29,977 INFO L290 TraceCheckUtils]: 64: Hoare triple {9694#(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]; {9672#(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:29,980 INFO L290 TraceCheckUtils]: 63: Hoare triple {9672#(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; {9694#(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:29,981 INFO L272 TraceCheckUtils]: 62: Hoare triple {9584#(= (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); {9672#(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:29,981 INFO L290 TraceCheckUtils]: 61: Hoare triple {9584#(= (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; {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,983 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {9672#(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))))} {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} #416#return; {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,983 INFO L290 TraceCheckUtils]: 59: Hoare triple {9672#(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; {9672#(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:29,984 INFO L290 TraceCheckUtils]: 58: Hoare triple {9672#(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; {9672#(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:29,984 INFO L290 TraceCheckUtils]: 57: Hoare triple {9672#(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; {9672#(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:29,985 INFO L290 TraceCheckUtils]: 56: Hoare triple {9672#(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; {9672#(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:29,985 INFO L290 TraceCheckUtils]: 55: Hoare triple {9672#(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~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9672#(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:29,985 INFO L290 TraceCheckUtils]: 54: Hoare triple {9672#(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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {9672#(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:29,986 INFO L290 TraceCheckUtils]: 53: Hoare triple {9694#(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]; {9672#(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:29,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {9672#(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; {9694#(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:29,990 INFO L272 TraceCheckUtils]: 51: Hoare triple {9584#(= (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); {9672#(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:29,991 INFO L290 TraceCheckUtils]: 50: Hoare triple {9580#(= (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; {9584#(= (select |#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)} is VALID [2022-02-20 23:46:29,991 INFO L290 TraceCheckUtils]: 49: Hoare triple {9576#(= (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; {9580#(= (select |#valid| |ULTIMATE.start_l3_insert_~item~1#1.base|) 1)} is VALID [2022-02-20 23:46:29,992 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9569#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} {9422#true} #414#return; {9576#(= (select |#valid| |ULTIMATE.start_l3_insert_#t~ret9#1.base|) 1)} is VALID [2022-02-20 23:46:29,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {9569#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} assume true; {9569#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:29,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {9565#(= (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; {9569#(= (select |#valid| |zalloc_or_die_#res#1.base|) 1)} is VALID [2022-02-20 23:46:29,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {9561#(= (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; {9565#(= (select |#valid| |zalloc_or_die_~ptr~1#1.base|) 1)} is VALID [2022-02-20 23:46:29,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {9551#(= (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; {9561#(= (select |#valid| |zalloc_or_die_calloc_model_#res#1.base|) 1)} is VALID [2022-02-20 23:46:29,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {9551#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9551#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:29,995 INFO L290 TraceCheckUtils]: 42: Hoare triple {9551#(= (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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {9551#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:29,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {9547#(= |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]; {9551#(= (select |#valid| |zalloc_or_die_calloc_model_~ptr~0#1.base|) 1)} is VALID [2022-02-20 23:46:29,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {9422#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; {9547#(= |zalloc_or_die_calloc_model_~ptr~0#1.base| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)} is VALID [2022-02-20 23:46:29,996 INFO L272 TraceCheckUtils]: 39: Hoare triple {9422#true} call l3_insert_#t~ret9#1.base, l3_insert_#t~ret9#1.offset := zalloc_or_die(8); {9422#true} is VALID [2022-02-20 23:46:29,996 INFO L290 TraceCheckUtils]: 38: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,996 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9422#true} {9422#true} #412#return; {9422#true} is VALID [2022-02-20 23:46:29,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {9422#true} assume true; {9422#true} is VALID [2022-02-20 23:46:29,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {9422#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9422#true} is VALID [2022-02-20 23:46:29,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {9422#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {9422#true} is VALID [2022-02-20 23:46:29,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {9422#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9422#true} is VALID [2022-02-20 23:46:29,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,997 INFO L272 TraceCheckUtils]: 27: Hoare triple {9422#true} call l2_insert_#t~ret12#1.base, l2_insert_#t~ret12#1.offset := zalloc_or_die(8); {9422#true} is VALID [2022-02-20 23:46:29,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,998 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9422#true} {9422#true} #410#return; {9422#true} is VALID [2022-02-20 23:46:29,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {9422#true} assume true; {9422#true} is VALID [2022-02-20 23:46:29,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {9422#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9422#true} is VALID [2022-02-20 23:46:29,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {9422#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {9422#true} is VALID [2022-02-20 23:46:29,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {9422#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9422#true} is VALID [2022-02-20 23:46:29,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,999 INFO L272 TraceCheckUtils]: 15: Hoare triple {9422#true} call l1_insert_#t~ret15#1.base, l1_insert_#t~ret15#1.offset := zalloc_or_die(8); {9422#true} is VALID [2022-02-20 23:46:29,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,999 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9422#true} {9422#true} #408#return; {9422#true} is VALID [2022-02-20 23:46:29,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {9422#true} assume true; {9422#true} is VALID [2022-02-20 23:46:29,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:29,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:30,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {9422#true} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9422#true} is VALID [2022-02-20 23:46:30,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {9422#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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {9422#true} is VALID [2022-02-20 23:46:30,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {9422#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9422#true} is VALID [2022-02-20 23:46:30,000 INFO L290 TraceCheckUtils]: 4: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:30,000 INFO L272 TraceCheckUtils]: 3: Hoare triple {9422#true} call l0_insert_#t~ret18#1.base, l0_insert_#t~ret18#1.offset := zalloc_or_die(8); {9422#true} is VALID [2022-02-20 23:46:30,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:30,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {9422#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; {9422#true} is VALID [2022-02-20 23:46:30,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {9422#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); {9422#true} is VALID [2022-02-20 23:46:30,001 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:30,001 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:30,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811403254] [2022-02-20 23:46:30,001 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:46:30,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789808730] [2022-02-20 23:46:30,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789808730] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:46:30,002 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:46:30,002 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 14 [2022-02-20 23:46:30,002 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436891635] [2022-02-20 23:46:30,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:30,003 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:30,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:30,003 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:30,077 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:30,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:46:30,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:30,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:46:30,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:46:30,078 INFO L87 Difference]: Start difference. First operand 241 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:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:33,117 INFO L93 Difference]: Finished difference Result 408 states and 481 transitions. [2022-02-20 23:46:33,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:46:33,117 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:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:33,118 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:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 441 transitions. [2022-02-20 23:46:33,122 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:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 441 transitions. [2022-02-20 23:46:33,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 441 transitions. [2022-02-20 23:46:33,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 441 edges. 441 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:33,557 INFO L225 Difference]: With dead ends: 408 [2022-02-20 23:46:33,557 INFO L226 Difference]: Without dead ends: 408 [2022-02-20 23:46:33,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 131 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:46:33,558 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 290 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 2215 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:33,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 2215 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 965 Invalid, 0 Unknown, 401 Unchecked, 0.8s Time] [2022-02-20 23:46:33,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-02-20 23:46:33,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 271. [2022-02-20 23:46:33,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:33,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 408 states. Second operand has 271 states, 172 states have (on average 1.6104651162790697) internal successors, (277), 252 states have internal predecessors, (277), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (21), 13 states have call predecessors, (21), 13 states have call successors, (21) [2022-02-20 23:46:33,584 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand has 271 states, 172 states have (on average 1.6104651162790697) internal successors, (277), 252 states have internal predecessors, (277), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (21), 13 states have call predecessors, (21), 13 states have call successors, (21) [2022-02-20 23:46:33,585 INFO L87 Difference]: Start difference. First operand 408 states. Second operand has 271 states, 172 states have (on average 1.6104651162790697) internal successors, (277), 252 states have internal predecessors, (277), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (21), 13 states have call predecessors, (21), 13 states have call successors, (21) [2022-02-20 23:46:33,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:33,598 INFO L93 Difference]: Finished difference Result 408 states and 481 transitions. [2022-02-20 23:46:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 481 transitions. [2022-02-20 23:46:33,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:33,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:33,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 271 states, 172 states have (on average 1.6104651162790697) internal successors, (277), 252 states have internal predecessors, (277), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (21), 13 states have call predecessors, (21), 13 states have call successors, (21) Second operand 408 states. [2022-02-20 23:46:33,602 INFO L87 Difference]: Start difference. First operand has 271 states, 172 states have (on average 1.6104651162790697) internal successors, (277), 252 states have internal predecessors, (277), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (21), 13 states have call predecessors, (21), 13 states have call successors, (21) Second operand 408 states. [2022-02-20 23:46:33,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:33,618 INFO L93 Difference]: Finished difference Result 408 states and 481 transitions. [2022-02-20 23:46:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 481 transitions. [2022-02-20 23:46:33,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:33,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:33,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:33,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 172 states have (on average 1.6104651162790697) internal successors, (277), 252 states have internal predecessors, (277), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (21), 13 states have call predecessors, (21), 13 states have call successors, (21) [2022-02-20 23:46:33,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 311 transitions. [2022-02-20 23:46:33,629 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 311 transitions. Word has length 75 [2022-02-20 23:46:33,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:33,629 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 311 transitions. [2022-02-20 23:46:33,629 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:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 311 transitions. [2022-02-20 23:46:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 23:46:33,630 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:33,630 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:33,652 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:33,843 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:33,844 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2022-02-20 23:46:33,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:33,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1635791476, now seen corresponding path program 1 times [2022-02-20 23:46:33,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:33,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482405151] [2022-02-20 23:46:33,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:33,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:33,865 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:46:33,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [823047194] [2022-02-20 23:46:33,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:33,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:33,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:33,867 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:33,867 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:33,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:34,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 77 conjunts are in the unsatisfiable core [2022-02-20 23:46:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:34,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:34,153 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