./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:32:44,982 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:32:44,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:32:45,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:32:45,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:32:45,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:32:45,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:32:45,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:32:45,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:32:45,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:32:45,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:32:45,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:32:45,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:32:45,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:32:45,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:32:45,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:32:45,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:32:45,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:32:45,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:32:45,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:32:45,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:32:45,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:32:45,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:32:45,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:32:45,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:32:45,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:32:45,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:32:45,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:32:45,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:32:45,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:32:45,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:32:45,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:32:45,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:32:45,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:32:45,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:32:45,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:32:45,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:32:45,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:32:45,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:32:45,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:32:45,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:32:45,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 23:32:45,082 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:32:45,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:32:45,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:32:45,087 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:32:45,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:32:45,088 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:32:45,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:32:45,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:32:45,089 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:32:45,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:32:45,090 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:32:45,090 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:32:45,090 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:32:45,090 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:32:45,091 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 23:32:45,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:32:45,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 23:32:45,091 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:32:45,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 23:32:45,091 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:32:45,091 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 23:32:45,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:32:45,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:32:45,092 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:32:45,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:32:45,092 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:32:45,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:32:45,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 23:32:45,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:32:45,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:32:45,093 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 23:32:45,093 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 23:32:45,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 23:32:45,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 [2022-02-20 23:32:45,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:32:45,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:32:45,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:32:45,254 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:32:45,255 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:32:45,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2022-02-20 23:32:45,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde6e6ce0/8d12a38122454009a525869f6b2826b0/FLAGe3532d5e7 [2022-02-20 23:32:45,787 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:32:45,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2022-02-20 23:32:45,801 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde6e6ce0/8d12a38122454009a525869f6b2826b0/FLAGe3532d5e7 [2022-02-20 23:32:45,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dde6e6ce0/8d12a38122454009a525869f6b2826b0 [2022-02-20 23:32:45,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:32:45,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:32:45,818 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:32:45,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:32:45,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:32:45,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:32:45" (1/1) ... [2022-02-20 23:32:45,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c234775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:45, skipping insertion in model container [2022-02-20 23:32:45,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:32:45" (1/1) ... [2022-02-20 23:32:45,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:32:45,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:32:46,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[44118,44131] [2022-02-20 23:32:46,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[44660,44673] [2022-02-20 23:32:46,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[56247,56260] [2022-02-20 23:32:46,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[56368,56381] [2022-02-20 23:32:46,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:32:46,373 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:32:46,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[44118,44131] [2022-02-20 23:32:46,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[44660,44673] [2022-02-20 23:32:46,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[56247,56260] [2022-02-20 23:32:46,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i[56368,56381] [2022-02-20 23:32:46,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:32:46,567 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:32:46,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:46 WrapperNode [2022-02-20 23:32:46,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:32:46,568 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:32:46,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:32:46,568 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:32:46,573 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:32:46" (1/1) ... [2022-02-20 23:32:46,596 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:32:46" (1/1) ... [2022-02-20 23:32:46,644 INFO L137 Inliner]: procedures = 282, calls = 294, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1040 [2022-02-20 23:32:46,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:32:46,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:32:46,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:32:46,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:32:46,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:46" (1/1) ... [2022-02-20 23:32:46,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:46" (1/1) ... [2022-02-20 23:32:46,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:46" (1/1) ... [2022-02-20 23:32:46,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:46" (1/1) ... [2022-02-20 23:32:46,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:46" (1/1) ... [2022-02-20 23:32:46,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:46" (1/1) ... [2022-02-20 23:32:46,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:46" (1/1) ... [2022-02-20 23:32:46,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:32:46,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:32:46,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:32:46,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:32:46,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:46" (1/1) ... [2022-02-20 23:32:46,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:32:46,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:32:46,749 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:32:46,755 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:32:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:32:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-20 23:32:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:32:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:32:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2022-02-20 23:32:46,779 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2022-02-20 23:32:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:32:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 23:32:46,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 23:32:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:32:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:32:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:32:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2022-02-20 23:32:46,780 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2022-02-20 23:32:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:32:46,780 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2022-02-20 23:32:46,780 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2022-02-20 23:32:46,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:32:46,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:32:46,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:32:46,918 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:32:46,929 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:32:48,595 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:32:48,605 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:32:48,606 INFO L299 CfgBuilder]: Removed 63 assume(true) statements. [2022-02-20 23:32:48,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:32:48 BoogieIcfgContainer [2022-02-20 23:32:48,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:32:48,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:32:48,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:32:48,611 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:32:48,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:32:45" (1/3) ... [2022-02-20 23:32:48,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6907366e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:32:48, skipping insertion in model container [2022-02-20 23:32:48,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:32:46" (2/3) ... [2022-02-20 23:32:48,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6907366e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:32:48, skipping insertion in model container [2022-02-20 23:32:48,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:32:48" (3/3) ... [2022-02-20 23:32:48,613 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-1.i [2022-02-20 23:32:48,616 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:32:48,617 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 23:32:48,652 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:32:48,662 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:32:48,662 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 23:32:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 203 states have (on average 1.6354679802955665) internal successors, (332), 207 states have internal predecessors, (332), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:32:48,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:32:48,691 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:32:48,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:32:48,692 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 23:32:48,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:32:48,700 INFO L85 PathProgramCache]: Analyzing trace with hash -720802776, now seen corresponding path program 1 times [2022-02-20 23:32:48,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:32:48,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118236083] [2022-02-20 23:32:48,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:32:48,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:32:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:32:48,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {228#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {228#true} is VALID [2022-02-20 23:32:48,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {228#true} is VALID [2022-02-20 23:32:48,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {228#true} assume !true; {229#false} is VALID [2022-02-20 23:32:48,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {229#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {229#false} is VALID [2022-02-20 23:32:48,878 INFO L290 TraceCheckUtils]: 4: Hoare triple {229#false} assume !true; {229#false} is VALID [2022-02-20 23:32:48,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {229#false} is VALID [2022-02-20 23:32:48,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {229#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0); {229#false} is VALID [2022-02-20 23:32:48,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#false} assume !false; {229#false} is VALID [2022-02-20 23:32:48,879 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:32:48,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:32:48,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118236083] [2022-02-20 23:32:48,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118236083] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:32:48,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:32:48,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:32:48,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664208823] [2022-02-20 23:32:48,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:32:48,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-02-20 23:32:48,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:32:48,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:32:48,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:48,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:32:48,902 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:32:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:32:48,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:32:48,929 INFO L87 Difference]: Start difference. First operand has 225 states, 203 states have (on average 1.6354679802955665) internal successors, (332), 207 states have internal predecessors, (332), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:32:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:49,261 INFO L93 Difference]: Finished difference Result 445 states and 724 transitions. [2022-02-20 23:32:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:32:49,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-02-20 23:32:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:32:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:32:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 724 transitions. [2022-02-20 23:32:49,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:32:49,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 724 transitions. [2022-02-20 23:32:49,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 724 transitions. [2022-02-20 23:32:49,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 724 edges. 724 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:49,913 INFO L225 Difference]: With dead ends: 445 [2022-02-20 23:32:49,914 INFO L226 Difference]: Without dead ends: 218 [2022-02-20 23:32:49,919 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:32:49,922 INFO L933 BasicCegarLoop]: 285 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, 285 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:32:49,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:32:49,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-02-20 23:32:49,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-02-20 23:32:49,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:32:49,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 218 states, 197 states have (on average 1.299492385786802) internal successors, (256), 202 states have internal predecessors, (256), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:49,970 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 218 states, 197 states have (on average 1.299492385786802) internal successors, (256), 202 states have internal predecessors, (256), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:49,989 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 218 states, 197 states have (on average 1.299492385786802) internal successors, (256), 202 states have internal predecessors, (256), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:50,001 INFO L93 Difference]: Finished difference Result 218 states and 281 transitions. [2022-02-20 23:32:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 281 transitions. [2022-02-20 23:32:50,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:32:50,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:32:50,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 197 states have (on average 1.299492385786802) internal successors, (256), 202 states have internal predecessors, (256), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 218 states. [2022-02-20 23:32:50,010 INFO L87 Difference]: Start difference. First operand has 218 states, 197 states have (on average 1.299492385786802) internal successors, (256), 202 states have internal predecessors, (256), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 218 states. [2022-02-20 23:32:50,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:50,020 INFO L93 Difference]: Finished difference Result 218 states and 281 transitions. [2022-02-20 23:32:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 281 transitions. [2022-02-20 23:32:50,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:32:50,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:32:50,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:32:50,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:32:50,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 197 states have (on average 1.299492385786802) internal successors, (256), 202 states have internal predecessors, (256), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 281 transitions. [2022-02-20 23:32:50,032 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 281 transitions. Word has length 8 [2022-02-20 23:32:50,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:32:50,033 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 281 transitions. [2022-02-20 23:32:50,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:32:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 281 transitions. [2022-02-20 23:32:50,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:32:50,037 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:32:50,037 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:32:50,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:32:50,037 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 23:32:50,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:32:50,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1810590275, now seen corresponding path program 1 times [2022-02-20 23:32:50,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:32:50,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353361642] [2022-02-20 23:32:50,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:32:50,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:32:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:32:50,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {1475#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {1475#true} is VALID [2022-02-20 23:32:50,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {1475#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1477#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} is VALID [2022-02-20 23:32:50,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {1477#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1478#(= |ULTIMATE.start_main_#t~mem42#1| 0)} is VALID [2022-02-20 23:32:50,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {1478#(= |ULTIMATE.start_main_#t~mem42#1| 0)} assume !(main_#t~mem42#1 < 10);havoc main_#t~mem42#1; {1476#false} is VALID [2022-02-20 23:32:50,104 INFO L290 TraceCheckUtils]: 4: Hoare triple {1476#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1476#false} is VALID [2022-02-20 23:32:50,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {1476#false} call main_#t~mem180#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1476#false} is VALID [2022-02-20 23:32:50,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {1476#false} assume !(main_#t~mem180#1 < 10);havoc main_#t~mem180#1; {1476#false} is VALID [2022-02-20 23:32:50,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {1476#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {1476#false} is VALID [2022-02-20 23:32:50,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {1476#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0); {1476#false} is VALID [2022-02-20 23:32:50,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {1476#false} assume !false; {1476#false} is VALID [2022-02-20 23:32:50,104 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:32:50,105 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:32:50,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353361642] [2022-02-20 23:32:50,105 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353361642] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:32:50,105 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:32:50,105 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:32:50,105 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913392810] [2022-02-20 23:32:50,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:32:50,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-02-20 23:32:50,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:32:50,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:32:50,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:50,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:32:50,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:32:50,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:32:50,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:32:50,115 INFO L87 Difference]: Start difference. First operand 218 states and 281 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:32:51,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:51,104 INFO L93 Difference]: Finished difference Result 455 states and 590 transitions. [2022-02-20 23:32:51,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:32:51,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-02-20 23:32:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:32:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:32:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions. [2022-02-20 23:32:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:32:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions. [2022-02-20 23:32:51,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 590 transitions. [2022-02-20 23:32:51,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 590 edges. 590 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:51,554 INFO L225 Difference]: With dead ends: 455 [2022-02-20 23:32:51,554 INFO L226 Difference]: Without dead ends: 346 [2022-02-20 23:32:51,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:32:51,556 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 152 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:32:51,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 705 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:32:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-02-20 23:32:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 220. [2022-02-20 23:32:51,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:32:51,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 346 states. Second operand has 220 states, 199 states have (on average 1.2964824120603016) internal successors, (258), 204 states have internal predecessors, (258), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:51,565 INFO L74 IsIncluded]: Start isIncluded. First operand 346 states. Second operand has 220 states, 199 states have (on average 1.2964824120603016) internal successors, (258), 204 states have internal predecessors, (258), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:51,565 INFO L87 Difference]: Start difference. First operand 346 states. Second operand has 220 states, 199 states have (on average 1.2964824120603016) internal successors, (258), 204 states have internal predecessors, (258), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:51,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:51,573 INFO L93 Difference]: Finished difference Result 346 states and 450 transitions. [2022-02-20 23:32:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 450 transitions. [2022-02-20 23:32:51,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:32:51,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:32:51,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 220 states, 199 states have (on average 1.2964824120603016) internal successors, (258), 204 states have internal predecessors, (258), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 346 states. [2022-02-20 23:32:51,575 INFO L87 Difference]: Start difference. First operand has 220 states, 199 states have (on average 1.2964824120603016) internal successors, (258), 204 states have internal predecessors, (258), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 346 states. [2022-02-20 23:32:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:51,584 INFO L93 Difference]: Finished difference Result 346 states and 450 transitions. [2022-02-20 23:32:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 450 transitions. [2022-02-20 23:32:51,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:32:51,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:32:51,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:32:51,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:32:51,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 199 states have (on average 1.2964824120603016) internal successors, (258), 204 states have internal predecessors, (258), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 283 transitions. [2022-02-20 23:32:51,591 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 283 transitions. Word has length 10 [2022-02-20 23:32:51,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:32:51,591 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 283 transitions. [2022-02-20 23:32:51,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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:32:51,591 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 283 transitions. [2022-02-20 23:32:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 23:32:51,592 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:32:51,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:32:51,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:32:51,593 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 23:32:51,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:32:51,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1082818915, now seen corresponding path program 1 times [2022-02-20 23:32:51,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:32:51,593 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959700062] [2022-02-20 23:32:51,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:32:51,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:32:51,619 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:32:51,619 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828816405] [2022-02-20 23:32:51,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:32:51,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:32:51,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:32:51,621 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:32:51,643 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:32:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:32:51,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:32:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:32:51,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:32:51,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {2995#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {2995#true} is VALID [2022-02-20 23:32:51,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {2995#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2995#true} is VALID [2022-02-20 23:32:51,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {2995#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2995#true} is VALID [2022-02-20 23:32:51,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {2995#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {2995#true} is VALID [2022-02-20 23:32:51,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {2995#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {2995#true} is VALID [2022-02-20 23:32:51,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {2995#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {2995#true} is VALID [2022-02-20 23:32:51,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {2995#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {2995#true} is VALID [2022-02-20 23:32:51,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {2995#true} havoc main_~_ha_hashv~0#1; {2995#true} is VALID [2022-02-20 23:32:51,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {2995#true} goto; {2995#true} is VALID [2022-02-20 23:32:51,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {2995#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {2995#true} is VALID [2022-02-20 23:32:51,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {2995#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {2995#true} is VALID [2022-02-20 23:32:51,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {2995#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {2995#true} is VALID [2022-02-20 23:32:51,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {2995#true} assume main_#t~switch59#1;call main_#t~mem60#1 := read~int(main_~_hj_key~0#1.base, 10 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 16777216 * (main_#t~mem60#1 % 256);havoc main_#t~mem60#1; {2995#true} is VALID [2022-02-20 23:32:51,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {2995#true} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {2995#true} is VALID [2022-02-20 23:32:51,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {2995#true} assume main_#t~switch59#1;call main_#t~mem61#1 := read~int(main_~_hj_key~0#1.base, 9 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 65536 * (main_#t~mem61#1 % 256);havoc main_#t~mem61#1; {2995#true} is VALID [2022-02-20 23:32:51,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {2995#true} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {2995#true} is VALID [2022-02-20 23:32:51,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {2995#true} assume main_#t~switch59#1;call main_#t~mem62#1 := read~int(main_~_hj_key~0#1.base, 8 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 256 * (main_#t~mem62#1 % 256);havoc main_#t~mem62#1; {2995#true} is VALID [2022-02-20 23:32:51,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {2995#true} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {2995#true} is VALID [2022-02-20 23:32:51,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {2995#true} assume main_#t~switch59#1;call main_#t~mem63#1 := read~int(main_~_hj_key~0#1.base, 7 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 16777216 * (main_#t~mem63#1 % 256);havoc main_#t~mem63#1; {2995#true} is VALID [2022-02-20 23:32:51,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {2995#true} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {2995#true} is VALID [2022-02-20 23:32:51,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {2995#true} assume main_#t~switch59#1;call main_#t~mem64#1 := read~int(main_~_hj_key~0#1.base, 6 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 65536 * (main_#t~mem64#1 % 256);havoc main_#t~mem64#1; {3060#|ULTIMATE.start_main_#t~switch59#1|} is VALID [2022-02-20 23:32:51,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {3060#|ULTIMATE.start_main_#t~switch59#1|} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {3060#|ULTIMATE.start_main_#t~switch59#1|} is VALID [2022-02-20 23:32:51,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {3060#|ULTIMATE.start_main_#t~switch59#1|} assume !main_#t~switch59#1; {2996#false} is VALID [2022-02-20 23:32:51,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {2996#false} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {2996#false} is VALID [2022-02-20 23:32:51,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {2996#false} assume main_#t~switch59#1;call main_#t~mem66#1 := read~int(main_~_hj_key~0#1.base, 4 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + main_#t~mem66#1 % 256;havoc main_#t~mem66#1; {2996#false} is VALID [2022-02-20 23:32:51,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {2996#false} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {2996#false} is VALID [2022-02-20 23:32:51,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {2996#false} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {2996#false} is VALID [2022-02-20 23:32:51,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {2996#false} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {2996#false} is VALID [2022-02-20 23:32:51,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {2996#false} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {2996#false} is VALID [2022-02-20 23:32:51,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {2996#false} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {2996#false} is VALID [2022-02-20 23:32:51,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {2996#false} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {2996#false} is VALID [2022-02-20 23:32:51,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {2996#false} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {2996#false} is VALID [2022-02-20 23:32:51,926 INFO L290 TraceCheckUtils]: 32: Hoare triple {2996#false} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {2996#false} is VALID [2022-02-20 23:32:51,926 INFO L290 TraceCheckUtils]: 33: Hoare triple {2996#false} havoc main_#t~switch59#1; {2996#false} is VALID [2022-02-20 23:32:51,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {2996#false} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {2996#false} is VALID [2022-02-20 23:32:51,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {2996#false} goto; {2996#false} is VALID [2022-02-20 23:32:51,927 INFO L290 TraceCheckUtils]: 36: Hoare triple {2996#false} goto; {2996#false} is VALID [2022-02-20 23:32:51,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {2996#false} goto; {2996#false} is VALID [2022-02-20 23:32:51,927 INFO L290 TraceCheckUtils]: 38: Hoare triple {2996#false} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {2996#false} is VALID [2022-02-20 23:32:51,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {2996#false} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {2996#false} is VALID [2022-02-20 23:32:51,928 INFO L272 TraceCheckUtils]: 40: Hoare triple {2996#false} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {2996#false} is VALID [2022-02-20 23:32:51,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {2996#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {2996#false} is VALID [2022-02-20 23:32:51,928 INFO L290 TraceCheckUtils]: 42: Hoare triple {2996#false} assume 1 == ~alt_malloc_balance~0; {2996#false} is VALID [2022-02-20 23:32:51,928 INFO L272 TraceCheckUtils]: 43: Hoare triple {2996#false} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {2996#false} is VALID [2022-02-20 23:32:51,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {2996#false} ~cond := #in~cond; {2996#false} is VALID [2022-02-20 23:32:51,929 INFO L290 TraceCheckUtils]: 45: Hoare triple {2996#false} assume 0 == ~cond; {2996#false} is VALID [2022-02-20 23:32:51,929 INFO L290 TraceCheckUtils]: 46: Hoare triple {2996#false} assume !false; {2996#false} is VALID [2022-02-20 23:32:51,929 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:32:51,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:32:51,929 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:32:51,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959700062] [2022-02-20 23:32:51,930 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:32:51,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828816405] [2022-02-20 23:32:51,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828816405] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:32:51,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:32:51,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:32:51,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65456692] [2022-02-20 23:32:51,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:32:51,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 23:32:51,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:32:51,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:51,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:51,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:32:51,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:32:51,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:32:51,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:32:51,961 INFO L87 Difference]: Start difference. First operand 220 states and 283 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:52,369 INFO L93 Difference]: Finished difference Result 457 states and 593 transitions. [2022-02-20 23:32:52,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:32:52,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 23:32:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:32:52,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2022-02-20 23:32:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:52,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions. [2022-02-20 23:32:52,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 591 transitions. [2022-02-20 23:32:52,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 591 edges. 591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:52,782 INFO L225 Difference]: With dead ends: 457 [2022-02-20 23:32:52,782 INFO L226 Difference]: Without dead ends: 241 [2022-02-20 23:32:52,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 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:32:52,784 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 9 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:32:52,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 507 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:32:52,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-02-20 23:32:52,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2022-02-20 23:32:52,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:32:52,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 240 states, 219 states have (on average 1.269406392694064) internal successors, (278), 224 states have internal predecessors, (278), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:52,790 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 240 states, 219 states have (on average 1.269406392694064) internal successors, (278), 224 states have internal predecessors, (278), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:52,791 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 240 states, 219 states have (on average 1.269406392694064) internal successors, (278), 224 states have internal predecessors, (278), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:52,804 INFO L93 Difference]: Finished difference Result 241 states and 304 transitions. [2022-02-20 23:32:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 304 transitions. [2022-02-20 23:32:52,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:32:52,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:32:52,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 219 states have (on average 1.269406392694064) internal successors, (278), 224 states have internal predecessors, (278), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 241 states. [2022-02-20 23:32:52,806 INFO L87 Difference]: Start difference. First operand has 240 states, 219 states have (on average 1.269406392694064) internal successors, (278), 224 states have internal predecessors, (278), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 241 states. [2022-02-20 23:32:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:52,811 INFO L93 Difference]: Finished difference Result 241 states and 304 transitions. [2022-02-20 23:32:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 304 transitions. [2022-02-20 23:32:52,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:32:52,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:32:52,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:32:52,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:32:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 219 states have (on average 1.269406392694064) internal successors, (278), 224 states have internal predecessors, (278), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:52,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 303 transitions. [2022-02-20 23:32:52,818 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 303 transitions. Word has length 47 [2022-02-20 23:32:52,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:32:52,818 INFO L470 AbstractCegarLoop]: Abstraction has 240 states and 303 transitions. [2022-02-20 23:32:52,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:52,818 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 303 transitions. [2022-02-20 23:32:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 23:32:52,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:32:52,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:32:52,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 23:32:53,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:32:53,039 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 23:32:53,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:32:53,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1223367525, now seen corresponding path program 1 times [2022-02-20 23:32:53,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:32:53,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854208397] [2022-02-20 23:32:53,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:32:53,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:32:53,061 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:32:53,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1231650768] [2022-02-20 23:32:53,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:32:53,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:32:53,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:32:53,069 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:32:53,072 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:32:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:32:53,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:32:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:32:53,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:32:53,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {4460#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {4460#true} is VALID [2022-02-20 23:32:53,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4460#true} is VALID [2022-02-20 23:32:53,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {4460#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4460#true} is VALID [2022-02-20 23:32:53,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {4460#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {4460#true} is VALID [2022-02-20 23:32:53,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {4460#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {4460#true} is VALID [2022-02-20 23:32:53,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {4460#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {4460#true} is VALID [2022-02-20 23:32:53,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {4460#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {4460#true} is VALID [2022-02-20 23:32:53,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {4460#true} havoc main_~_ha_hashv~0#1; {4460#true} is VALID [2022-02-20 23:32:53,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {4460#true} goto; {4460#true} is VALID [2022-02-20 23:32:53,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {4460#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {4492#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-20 23:32:53,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {4492#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {4492#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-20 23:32:53,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {4492#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {4499#(not |ULTIMATE.start_main_#t~switch59#1|)} is VALID [2022-02-20 23:32:53,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {4499#(not |ULTIMATE.start_main_#t~switch59#1|)} assume main_#t~switch59#1;call main_#t~mem60#1 := read~int(main_~_hj_key~0#1.base, 10 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 16777216 * (main_#t~mem60#1 % 256);havoc main_#t~mem60#1; {4461#false} is VALID [2022-02-20 23:32:53,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {4461#false} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {4461#false} is VALID [2022-02-20 23:32:53,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {4461#false} assume main_#t~switch59#1;call main_#t~mem61#1 := read~int(main_~_hj_key~0#1.base, 9 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 65536 * (main_#t~mem61#1 % 256);havoc main_#t~mem61#1; {4461#false} is VALID [2022-02-20 23:32:53,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {4461#false} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {4461#false} is VALID [2022-02-20 23:32:53,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {4461#false} assume main_#t~switch59#1;call main_#t~mem62#1 := read~int(main_~_hj_key~0#1.base, 8 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 256 * (main_#t~mem62#1 % 256);havoc main_#t~mem62#1; {4461#false} is VALID [2022-02-20 23:32:53,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {4461#false} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {4461#false} is VALID [2022-02-20 23:32:53,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {4461#false} assume main_#t~switch59#1;call main_#t~mem63#1 := read~int(main_~_hj_key~0#1.base, 7 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 16777216 * (main_#t~mem63#1 % 256);havoc main_#t~mem63#1; {4461#false} is VALID [2022-02-20 23:32:53,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {4461#false} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {4461#false} is VALID [2022-02-20 23:32:53,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {4461#false} assume main_#t~switch59#1;call main_#t~mem64#1 := read~int(main_~_hj_key~0#1.base, 6 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 65536 * (main_#t~mem64#1 % 256);havoc main_#t~mem64#1; {4461#false} is VALID [2022-02-20 23:32:53,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {4461#false} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {4461#false} is VALID [2022-02-20 23:32:53,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {4461#false} assume main_#t~switch59#1;call main_#t~mem65#1 := read~int(main_~_hj_key~0#1.base, 5 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 256 * (main_#t~mem65#1 % 256);havoc main_#t~mem65#1; {4461#false} is VALID [2022-02-20 23:32:53,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {4461#false} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {4461#false} is VALID [2022-02-20 23:32:53,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {4461#false} assume main_#t~switch59#1;call main_#t~mem66#1 := read~int(main_~_hj_key~0#1.base, 4 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + main_#t~mem66#1 % 256;havoc main_#t~mem66#1; {4461#false} is VALID [2022-02-20 23:32:53,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {4461#false} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {4461#false} is VALID [2022-02-20 23:32:53,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {4461#false} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {4461#false} is VALID [2022-02-20 23:32:53,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {4461#false} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {4461#false} is VALID [2022-02-20 23:32:53,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {4461#false} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {4461#false} is VALID [2022-02-20 23:32:53,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {4461#false} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {4461#false} is VALID [2022-02-20 23:32:53,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {4461#false} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {4461#false} is VALID [2022-02-20 23:32:53,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {4461#false} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {4461#false} is VALID [2022-02-20 23:32:53,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {4461#false} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {4461#false} is VALID [2022-02-20 23:32:53,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {4461#false} havoc main_#t~switch59#1; {4461#false} is VALID [2022-02-20 23:32:53,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {4461#false} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {4461#false} is VALID [2022-02-20 23:32:53,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {4461#false} goto; {4461#false} is VALID [2022-02-20 23:32:53,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {4461#false} goto; {4461#false} is VALID [2022-02-20 23:32:53,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {4461#false} goto; {4461#false} is VALID [2022-02-20 23:32:53,398 INFO L290 TraceCheckUtils]: 38: Hoare triple {4461#false} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {4461#false} is VALID [2022-02-20 23:32:53,398 INFO L290 TraceCheckUtils]: 39: Hoare triple {4461#false} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {4461#false} is VALID [2022-02-20 23:32:53,398 INFO L272 TraceCheckUtils]: 40: Hoare triple {4461#false} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {4461#false} is VALID [2022-02-20 23:32:53,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {4461#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {4461#false} is VALID [2022-02-20 23:32:53,398 INFO L290 TraceCheckUtils]: 42: Hoare triple {4461#false} assume 1 == ~alt_malloc_balance~0; {4461#false} is VALID [2022-02-20 23:32:53,399 INFO L272 TraceCheckUtils]: 43: Hoare triple {4461#false} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {4461#false} is VALID [2022-02-20 23:32:53,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {4461#false} ~cond := #in~cond; {4461#false} is VALID [2022-02-20 23:32:53,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {4461#false} assume 0 == ~cond; {4461#false} is VALID [2022-02-20 23:32:53,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {4461#false} assume !false; {4461#false} is VALID [2022-02-20 23:32:53,399 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:32:53,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:32:53,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:32:53,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854208397] [2022-02-20 23:32:53,400 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:32:53,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231650768] [2022-02-20 23:32:53,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231650768] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:32:53,400 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:32:53,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:32:53,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211367826] [2022-02-20 23:32:53,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:32:53,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 23:32:53,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:32:53,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:53,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:53,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:32:53,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:32:53,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:32:53,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:32:53,433 INFO L87 Difference]: Start difference. First operand 240 states and 303 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:53,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:53,995 INFO L93 Difference]: Finished difference Result 469 states and 595 transitions. [2022-02-20 23:32:53,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:32:53,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 23:32:53,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:32:53,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:53,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 572 transitions. [2022-02-20 23:32:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 572 transitions. [2022-02-20 23:32:54,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 572 transitions. [2022-02-20 23:32:54,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 572 edges. 572 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:54,410 INFO L225 Difference]: With dead ends: 469 [2022-02-20 23:32:54,410 INFO L226 Difference]: Without dead ends: 233 [2022-02-20 23:32:54,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:32:54,411 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 223 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:32:54,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 556 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:32:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-02-20 23:32:54,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 226. [2022-02-20 23:32:54,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:32:54,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 226 states, 205 states have (on average 1.2536585365853659) internal successors, (257), 210 states have internal predecessors, (257), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:54,442 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 226 states, 205 states have (on average 1.2536585365853659) internal successors, (257), 210 states have internal predecessors, (257), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:54,442 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 226 states, 205 states have (on average 1.2536585365853659) internal successors, (257), 210 states have internal predecessors, (257), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:54,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:54,447 INFO L93 Difference]: Finished difference Result 233 states and 289 transitions. [2022-02-20 23:32:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 289 transitions. [2022-02-20 23:32:54,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:32:54,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:32:54,448 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 205 states have (on average 1.2536585365853659) internal successors, (257), 210 states have internal predecessors, (257), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 233 states. [2022-02-20 23:32:54,448 INFO L87 Difference]: Start difference. First operand has 226 states, 205 states have (on average 1.2536585365853659) internal successors, (257), 210 states have internal predecessors, (257), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 233 states. [2022-02-20 23:32:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:54,452 INFO L93 Difference]: Finished difference Result 233 states and 289 transitions. [2022-02-20 23:32:54,452 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 289 transitions. [2022-02-20 23:32:54,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:32:54,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:32:54,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:32:54,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:32:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 205 states have (on average 1.2536585365853659) internal successors, (257), 210 states have internal predecessors, (257), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:32:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 282 transitions. [2022-02-20 23:32:54,458 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 282 transitions. Word has length 47 [2022-02-20 23:32:54,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:32:54,459 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 282 transitions. [2022-02-20 23:32:54,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 282 transitions. [2022-02-20 23:32:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 23:32:54,461 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:32:54,461 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:32:54,478 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:32:54,675 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,SelfDestructingSolverStorable3 [2022-02-20 23:32:54,675 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 23:32:54,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:32:54,676 INFO L85 PathProgramCache]: Analyzing trace with hash 206381993, now seen corresponding path program 1 times [2022-02-20 23:32:54,676 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:32:54,676 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440677159] [2022-02-20 23:32:54,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:32:54,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:32:54,702 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:32:54,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583382329] [2022-02-20 23:32:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:32:54,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:32:54,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:32:54,704 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:32:54,706 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:32:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:32:55,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:32:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:32:55,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:32:55,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {5914#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {5914#true} is VALID [2022-02-20 23:32:55,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {5914#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5914#true} is VALID [2022-02-20 23:32:55,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {5914#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5914#true} is VALID [2022-02-20 23:32:55,316 INFO L290 TraceCheckUtils]: 3: Hoare triple {5914#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {5914#true} is VALID [2022-02-20 23:32:55,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {5914#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {5914#true} is VALID [2022-02-20 23:32:55,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {5914#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {5914#true} is VALID [2022-02-20 23:32:55,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {5914#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {5914#true} is VALID [2022-02-20 23:32:55,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {5914#true} havoc main_~_ha_hashv~0#1; {5914#true} is VALID [2022-02-20 23:32:55,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {5914#true} goto; {5914#true} is VALID [2022-02-20 23:32:55,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {5914#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {5914#true} is VALID [2022-02-20 23:32:55,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {5914#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {5914#true} is VALID [2022-02-20 23:32:55,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {5914#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {5914#true} is VALID [2022-02-20 23:32:55,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {5914#true} assume !main_#t~switch59#1; {5914#true} is VALID [2022-02-20 23:32:55,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {5914#true} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {5914#true} is VALID [2022-02-20 23:32:55,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {5914#true} assume !main_#t~switch59#1; {5914#true} is VALID [2022-02-20 23:32:55,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {5914#true} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {5914#true} is VALID [2022-02-20 23:32:55,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {5914#true} assume !main_#t~switch59#1; {5914#true} is VALID [2022-02-20 23:32:55,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {5914#true} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {5914#true} is VALID [2022-02-20 23:32:55,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {5914#true} assume !main_#t~switch59#1; {5914#true} is VALID [2022-02-20 23:32:55,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {5914#true} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {5914#true} is VALID [2022-02-20 23:32:55,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {5914#true} assume !main_#t~switch59#1; {5914#true} is VALID [2022-02-20 23:32:55,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {5914#true} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {5914#true} is VALID [2022-02-20 23:32:55,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {5914#true} assume !main_#t~switch59#1; {5914#true} is VALID [2022-02-20 23:32:55,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {5914#true} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {5914#true} is VALID [2022-02-20 23:32:55,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {5914#true} assume !main_#t~switch59#1; {5914#true} is VALID [2022-02-20 23:32:55,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {5914#true} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {5914#true} is VALID [2022-02-20 23:32:55,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {5914#true} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {5914#true} is VALID [2022-02-20 23:32:55,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {5914#true} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {5914#true} is VALID [2022-02-20 23:32:55,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {5914#true} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {5914#true} is VALID [2022-02-20 23:32:55,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {5914#true} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {5914#true} is VALID [2022-02-20 23:32:55,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {5914#true} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {5914#true} is VALID [2022-02-20 23:32:55,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {5914#true} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {5914#true} is VALID [2022-02-20 23:32:55,320 INFO L290 TraceCheckUtils]: 32: Hoare triple {5914#true} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {5914#true} is VALID [2022-02-20 23:32:55,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {5914#true} havoc main_#t~switch59#1; {5914#true} is VALID [2022-02-20 23:32:55,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {5914#true} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {5914#true} is VALID [2022-02-20 23:32:55,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {5914#true} goto; {5914#true} is VALID [2022-02-20 23:32:55,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {5914#true} goto; {5914#true} is VALID [2022-02-20 23:32:55,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {5914#true} goto; {5914#true} is VALID [2022-02-20 23:32:55,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {5914#true} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {5914#true} is VALID [2022-02-20 23:32:55,322 INFO L290 TraceCheckUtils]: 39: Hoare triple {5914#true} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {5914#true} is VALID [2022-02-20 23:32:55,322 INFO L272 TraceCheckUtils]: 40: Hoare triple {5914#true} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {6039#(= 44 |alt_malloc_#in~sz|)} is VALID [2022-02-20 23:32:55,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {6039#(= 44 |alt_malloc_#in~sz|)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {6043#(= 44 alt_malloc_~sz)} is VALID [2022-02-20 23:32:55,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {6043#(= 44 alt_malloc_~sz)} assume 1 == ~alt_malloc_balance~0; {6043#(= 44 alt_malloc_~sz)} is VALID [2022-02-20 23:32:55,323 INFO L272 TraceCheckUtils]: 43: Hoare triple {6043#(= 44 alt_malloc_~sz)} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {6050#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 23:32:55,324 INFO L290 TraceCheckUtils]: 44: Hoare triple {6050#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6054#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 23:32:55,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {6054#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5915#false} is VALID [2022-02-20 23:32:55,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {5915#false} assume !false; {5915#false} is VALID [2022-02-20 23:32:55,325 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:32:55,325 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:32:55,325 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:32:55,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440677159] [2022-02-20 23:32:55,325 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:32:55,325 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583382329] [2022-02-20 23:32:55,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583382329] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:32:55,325 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:32:55,325 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:32:55,326 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859085600] [2022-02-20 23:32:55,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:32:55,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 23:32:55,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:32:55,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:55,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:55,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:32:55,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:32:55,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:32:55,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:32:55,355 INFO L87 Difference]: Start difference. First operand 226 states and 282 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:56,282 INFO L93 Difference]: Finished difference Result 238 states and 294 transitions. [2022-02-20 23:32:56,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:32:56,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-02-20 23:32:56,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:32:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 286 transitions. [2022-02-20 23:32:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:56,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 286 transitions. [2022-02-20 23:32:56,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 286 transitions. [2022-02-20 23:32:56,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:56,502 INFO L225 Difference]: With dead ends: 238 [2022-02-20 23:32:56,502 INFO L226 Difference]: Without dead ends: 236 [2022-02-20 23:32:56,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:32:56,504 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 13 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:32:56,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 1339 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:32:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-02-20 23:32:56,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2022-02-20 23:32:56,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:32:56,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 236 states, 212 states have (on average 1.25) internal successors, (265), 218 states have internal predecessors, (265), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:32:56,529 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 236 states, 212 states have (on average 1.25) internal successors, (265), 218 states have internal predecessors, (265), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:32:56,529 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 236 states, 212 states have (on average 1.25) internal successors, (265), 218 states have internal predecessors, (265), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:32:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:56,533 INFO L93 Difference]: Finished difference Result 236 states and 292 transitions. [2022-02-20 23:32:56,534 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 292 transitions. [2022-02-20 23:32:56,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:32:56,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:32:56,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 212 states have (on average 1.25) internal successors, (265), 218 states have internal predecessors, (265), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 236 states. [2022-02-20 23:32:56,535 INFO L87 Difference]: Start difference. First operand has 236 states, 212 states have (on average 1.25) internal successors, (265), 218 states have internal predecessors, (265), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 236 states. [2022-02-20 23:32:56,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:56,539 INFO L93 Difference]: Finished difference Result 236 states and 292 transitions. [2022-02-20 23:32:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 292 transitions. [2022-02-20 23:32:56,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:32:56,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:32:56,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:32:56,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:32:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 212 states have (on average 1.25) internal successors, (265), 218 states have internal predecessors, (265), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:32:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 292 transitions. [2022-02-20 23:32:56,545 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 292 transitions. Word has length 47 [2022-02-20 23:32:56,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:32:56,545 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 292 transitions. [2022-02-20 23:32:56,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 292 transitions. [2022-02-20 23:32:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 23:32:56,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:32:56,547 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:56,571 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:32:56,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:32:56,761 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 23:32:56,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:32:56,761 INFO L85 PathProgramCache]: Analyzing trace with hash -806940807, now seen corresponding path program 1 times [2022-02-20 23:32:56,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:32:56,762 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124365852] [2022-02-20 23:32:56,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:32:56,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:32:56,852 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:32:56,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648996778] [2022-02-20 23:32:56,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:32:56,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:32:56,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:32:56,864 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:32:56,896 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:32:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:32:57,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 1597 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:32:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:32:57,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:32:57,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {7112#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {7112#true} is VALID [2022-02-20 23:32:57,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {7112#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7112#true} is VALID [2022-02-20 23:32:57,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {7112#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7112#true} is VALID [2022-02-20 23:32:57,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {7112#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {7112#true} is VALID [2022-02-20 23:32:57,422 INFO L290 TraceCheckUtils]: 4: Hoare triple {7112#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {7112#true} is VALID [2022-02-20 23:32:57,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {7112#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {7112#true} is VALID [2022-02-20 23:32:57,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {7112#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {7112#true} is VALID [2022-02-20 23:32:57,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {7112#true} havoc main_~_ha_hashv~0#1; {7112#true} is VALID [2022-02-20 23:32:57,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {7112#true} goto; {7112#true} is VALID [2022-02-20 23:32:57,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {7112#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {7112#true} is VALID [2022-02-20 23:32:57,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {7112#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {7112#true} is VALID [2022-02-20 23:32:57,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {7112#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {7112#true} is VALID [2022-02-20 23:32:57,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {7112#true} assume !main_#t~switch59#1; {7112#true} is VALID [2022-02-20 23:32:57,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {7112#true} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {7112#true} is VALID [2022-02-20 23:32:57,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {7112#true} assume !main_#t~switch59#1; {7112#true} is VALID [2022-02-20 23:32:57,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {7112#true} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {7112#true} is VALID [2022-02-20 23:32:57,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {7112#true} assume !main_#t~switch59#1; {7112#true} is VALID [2022-02-20 23:32:57,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {7112#true} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {7112#true} is VALID [2022-02-20 23:32:57,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {7112#true} assume !main_#t~switch59#1; {7112#true} is VALID [2022-02-20 23:32:57,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {7112#true} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {7112#true} is VALID [2022-02-20 23:32:57,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {7112#true} assume !main_#t~switch59#1; {7112#true} is VALID [2022-02-20 23:32:57,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {7112#true} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {7112#true} is VALID [2022-02-20 23:32:57,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {7112#true} assume !main_#t~switch59#1; {7112#true} is VALID [2022-02-20 23:32:57,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {7112#true} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {7112#true} is VALID [2022-02-20 23:32:57,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {7112#true} assume !main_#t~switch59#1; {7112#true} is VALID [2022-02-20 23:32:57,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {7112#true} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {7112#true} is VALID [2022-02-20 23:32:57,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {7112#true} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {7112#true} is VALID [2022-02-20 23:32:57,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {7112#true} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {7112#true} is VALID [2022-02-20 23:32:57,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {7112#true} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {7112#true} is VALID [2022-02-20 23:32:57,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {7112#true} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {7112#true} is VALID [2022-02-20 23:32:57,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {7112#true} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {7112#true} is VALID [2022-02-20 23:32:57,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {7112#true} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {7112#true} is VALID [2022-02-20 23:32:57,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {7112#true} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {7112#true} is VALID [2022-02-20 23:32:57,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {7112#true} havoc main_#t~switch59#1; {7112#true} is VALID [2022-02-20 23:32:57,426 INFO L290 TraceCheckUtils]: 34: Hoare triple {7112#true} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {7112#true} is VALID [2022-02-20 23:32:57,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {7112#true} goto; {7112#true} is VALID [2022-02-20 23:32:57,426 INFO L290 TraceCheckUtils]: 36: Hoare triple {7112#true} goto; {7112#true} is VALID [2022-02-20 23:32:57,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {7112#true} goto; {7112#true} is VALID [2022-02-20 23:32:57,426 INFO L290 TraceCheckUtils]: 38: Hoare triple {7112#true} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {7112#true} is VALID [2022-02-20 23:32:57,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {7112#true} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem86#1.base, main_#t~mem86#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem86#1.base, main_#t~mem86#1.offset; {7112#true} is VALID [2022-02-20 23:32:57,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {7112#true} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_#t~mem87#1.base, 16 + main_#t~mem87#1.offset, 4);call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem90#1 := read~int(main_#t~mem89#1.base, 20 + main_#t~mem89#1.offset, 4);call write~$Pointer$(main_#t~mem88#1.base, main_#t~mem88#1.offset - main_#t~mem90#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1;call main_#t~mem91#1.base, main_#t~mem91#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem92#1.base, main_#t~mem92#1.offset := read~$Pointer$(main_#t~mem91#1.base, 16 + main_#t~mem91#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem92#1.base, 8 + main_#t~mem92#1.offset, 4);havoc main_#t~mem91#1.base, main_#t~mem91#1.offset;havoc main_#t~mem92#1.base, main_#t~mem92#1.offset;call main_#t~mem93#1.base, main_#t~mem93#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem93#1.base, 16 + main_#t~mem93#1.offset, 4);havoc main_#t~mem93#1.base, main_#t~mem93#1.offset; {7112#true} is VALID [2022-02-20 23:32:57,427 INFO L290 TraceCheckUtils]: 41: Hoare triple {7112#true} goto; {7112#true} is VALID [2022-02-20 23:32:57,427 INFO L290 TraceCheckUtils]: 42: Hoare triple {7112#true} havoc main_~_ha_bkt~0#1;call main_#t~mem94#1.base, main_#t~mem94#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem95#1 := read~int(main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);main_#t~post96#1 := main_#t~mem95#1;call write~int(1 + main_#t~post96#1, main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);havoc main_#t~mem94#1.base, main_#t~mem94#1.offset;havoc main_#t~mem95#1;havoc main_#t~post96#1; {7112#true} is VALID [2022-02-20 23:32:57,427 INFO L290 TraceCheckUtils]: 43: Hoare triple {7112#true} call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem98#1 := read~int(main_#t~mem97#1.base, 4 + main_#t~mem97#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem98#1 - 1 then 0 else (if 1 == main_#t~mem98#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem98#1 - 1 || 0 == main_#t~mem98#1 - 1 then main_#t~mem98#1 - 1 else (if main_#t~mem98#1 - 1 >= 0 then (main_#t~mem98#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1; {7112#true} is VALID [2022-02-20 23:32:57,427 INFO L290 TraceCheckUtils]: 44: Hoare triple {7112#true} goto; {7112#true} is VALID [2022-02-20 23:32:57,427 INFO L290 TraceCheckUtils]: 45: Hoare triple {7112#true} call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem100#1.base, main_#t~mem100#1.offset := read~$Pointer$(main_#t~mem99#1.base, main_#t~mem99#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem100#1.base, main_#t~mem100#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem99#1.base, main_#t~mem99#1.offset;havoc main_#t~mem100#1.base, main_#t~mem100#1.offset;call main_#t~mem101#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post102#1 := main_#t~mem101#1;call write~int(1 + main_#t~post102#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem101#1;havoc main_#t~post102#1;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem103#1.base, main_#t~mem103#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {7112#true} is VALID [2022-02-20 23:32:57,428 INFO L290 TraceCheckUtils]: 46: Hoare triple {7112#true} assume main_#t~mem104#1.base != 0 || main_#t~mem104#1.offset != 0;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem105#1.base, 12 + main_#t~mem105#1.offset, 4);havoc main_#t~mem105#1.base, main_#t~mem105#1.offset; {7112#true} is VALID [2022-02-20 23:32:57,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {7112#true} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem107#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem106#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short110#1 := main_#t~mem107#1 % 4294967296 >= 10 * (1 + main_#t~mem106#1) % 4294967296; {7112#true} is VALID [2022-02-20 23:32:57,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {7112#true} assume !main_#t~short110#1; {7261#(not |ULTIMATE.start_main_#t~short110#1|)} is VALID [2022-02-20 23:32:57,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {7261#(not |ULTIMATE.start_main_#t~short110#1|)} assume main_#t~short110#1;havoc main_#t~mem107#1;havoc main_#t~mem106#1;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;havoc main_#t~mem109#1;havoc main_#t~short110#1; {7113#false} is VALID [2022-02-20 23:32:57,431 INFO L290 TraceCheckUtils]: 50: Hoare triple {7113#false} havoc main_~_he_bkt~0#1;havoc main_~_he_bkt_i~0#1;havoc main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset;havoc main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset;call main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset;call main_#t~mem111#1.base, main_#t~mem111#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem112#1 := read~int(main_#t~mem111#1.base, 4 + main_#t~mem111#1.offset, 4); {7113#false} is VALID [2022-02-20 23:32:57,431 INFO L272 TraceCheckUtils]: 51: Hoare triple {7113#false} call main_#t~ret113#1.base, main_#t~ret113#1.offset := alt_malloc(24 * main_#t~mem112#1); {7113#false} is VALID [2022-02-20 23:32:57,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {7113#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {7113#false} is VALID [2022-02-20 23:32:57,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {7113#false} assume 1 == ~alt_malloc_balance~0; {7113#false} is VALID [2022-02-20 23:32:57,432 INFO L272 TraceCheckUtils]: 54: Hoare triple {7113#false} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {7113#false} is VALID [2022-02-20 23:32:57,432 INFO L290 TraceCheckUtils]: 55: Hoare triple {7113#false} ~cond := #in~cond; {7113#false} is VALID [2022-02-20 23:32:57,432 INFO L290 TraceCheckUtils]: 56: Hoare triple {7113#false} assume 0 == ~cond; {7113#false} is VALID [2022-02-20 23:32:57,432 INFO L290 TraceCheckUtils]: 57: Hoare triple {7113#false} assume !false; {7113#false} is VALID [2022-02-20 23:32:57,432 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:32:57,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:32:57,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:32:57,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124365852] [2022-02-20 23:32:57,433 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:32:57,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648996778] [2022-02-20 23:32:57,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648996778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:32:57,433 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:32:57,433 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:32:57,434 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556950189] [2022-02-20 23:32:57,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:32:57,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 23:32:57,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:32:57,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:57,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:57,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:32:57,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:32:57,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:32:57,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:32:57,472 INFO L87 Difference]: Start difference. First operand 236 states and 292 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:57,872 INFO L93 Difference]: Finished difference Result 469 states and 582 transitions. [2022-02-20 23:32:57,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:32:57,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 23:32:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:32:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2022-02-20 23:32:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2022-02-20 23:32:57,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 548 transitions. [2022-02-20 23:32:58,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 548 edges. 548 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:58,269 INFO L225 Difference]: With dead ends: 469 [2022-02-20 23:32:58,269 INFO L226 Difference]: Without dead ends: 237 [2022-02-20 23:32:58,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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:32:58,270 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:32:58,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 541 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:32:58,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-02-20 23:32:58,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2022-02-20 23:32:58,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:32:58,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 237 states, 213 states have (on average 1.2488262910798122) internal successors, (266), 219 states have internal predecessors, (266), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:32:58,297 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 237 states, 213 states have (on average 1.2488262910798122) internal successors, (266), 219 states have internal predecessors, (266), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:32:58,297 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 237 states, 213 states have (on average 1.2488262910798122) internal successors, (266), 219 states have internal predecessors, (266), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:32:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:58,302 INFO L93 Difference]: Finished difference Result 237 states and 293 transitions. [2022-02-20 23:32:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 293 transitions. [2022-02-20 23:32:58,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:32:58,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:32:58,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 237 states, 213 states have (on average 1.2488262910798122) internal successors, (266), 219 states have internal predecessors, (266), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 237 states. [2022-02-20 23:32:58,304 INFO L87 Difference]: Start difference. First operand has 237 states, 213 states have (on average 1.2488262910798122) internal successors, (266), 219 states have internal predecessors, (266), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 237 states. [2022-02-20 23:32:58,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:32:58,308 INFO L93 Difference]: Finished difference Result 237 states and 293 transitions. [2022-02-20 23:32:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 293 transitions. [2022-02-20 23:32:58,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:32:58,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:32:58,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:32:58,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:32:58,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 213 states have (on average 1.2488262910798122) internal successors, (266), 219 states have internal predecessors, (266), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:32:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 293 transitions. [2022-02-20 23:32:58,314 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 293 transitions. Word has length 58 [2022-02-20 23:32:58,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:32:58,314 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 293 transitions. [2022-02-20 23:32:58,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:58,315 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 293 transitions. [2022-02-20 23:32:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 23:32:58,316 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:32:58,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:58,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:32:58,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:32:58,536 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 23:32:58,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:32:58,536 INFO L85 PathProgramCache]: Analyzing trace with hash -413913797, now seen corresponding path program 1 times [2022-02-20 23:32:58,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:32:58,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528765974] [2022-02-20 23:32:58,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:32:58,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:32:58,620 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:32:58,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1963763651] [2022-02-20 23:32:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:32:58,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:32:58,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:32:58,624 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:32:58,625 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:32:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:32:59,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:32:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:32:59,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:32:59,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {8620#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {8620#true} is VALID [2022-02-20 23:32:59,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {8620#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch59#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch59#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch59#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch59#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch59#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch59#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,467 INFO L290 TraceCheckUtils]: 24: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch59#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,467 INFO L290 TraceCheckUtils]: 25: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,481 INFO L290 TraceCheckUtils]: 33: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch59#1; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:32:59,484 INFO L290 TraceCheckUtils]: 39: Hoare triple {8628#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem86#1.base, main_#t~mem86#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem86#1.base, main_#t~mem86#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem86#1.base, main_#t~mem86#1.offset; {8621#false} is VALID [2022-02-20 23:32:59,485 INFO L290 TraceCheckUtils]: 40: Hoare triple {8621#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem87#1.base, main_#t~mem87#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem88#1.base, main_#t~mem88#1.offset := read~$Pointer$(main_#t~mem87#1.base, 16 + main_#t~mem87#1.offset, 4);call main_#t~mem89#1.base, main_#t~mem89#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem90#1 := read~int(main_#t~mem89#1.base, 20 + main_#t~mem89#1.offset, 4);call write~$Pointer$(main_#t~mem88#1.base, main_#t~mem88#1.offset - main_#t~mem90#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem87#1.base, main_#t~mem87#1.offset;havoc main_#t~mem88#1.base, main_#t~mem88#1.offset;havoc main_#t~mem89#1.base, main_#t~mem89#1.offset;havoc main_#t~mem90#1;call main_#t~mem91#1.base, main_#t~mem91#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem92#1.base, main_#t~mem92#1.offset := read~$Pointer$(main_#t~mem91#1.base, 16 + main_#t~mem91#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem92#1.base, 8 + main_#t~mem92#1.offset, 4);havoc main_#t~mem91#1.base, main_#t~mem91#1.offset;havoc main_#t~mem92#1.base, main_#t~mem92#1.offset;call main_#t~mem93#1.base, main_#t~mem93#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem93#1.base, 16 + main_#t~mem93#1.offset, 4);havoc main_#t~mem93#1.base, main_#t~mem93#1.offset; {8621#false} is VALID [2022-02-20 23:32:59,485 INFO L290 TraceCheckUtils]: 41: Hoare triple {8621#false} goto; {8621#false} is VALID [2022-02-20 23:32:59,485 INFO L290 TraceCheckUtils]: 42: Hoare triple {8621#false} havoc main_~_ha_bkt~0#1;call main_#t~mem94#1.base, main_#t~mem94#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem95#1 := read~int(main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);main_#t~post96#1 := main_#t~mem95#1;call write~int(1 + main_#t~post96#1, main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);havoc main_#t~mem94#1.base, main_#t~mem94#1.offset;havoc main_#t~mem95#1;havoc main_#t~post96#1; {8621#false} is VALID [2022-02-20 23:32:59,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {8621#false} call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem98#1 := read~int(main_#t~mem97#1.base, 4 + main_#t~mem97#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem98#1 - 1 then 0 else (if 1 == main_#t~mem98#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem98#1 - 1 || 0 == main_#t~mem98#1 - 1 then main_#t~mem98#1 - 1 else (if main_#t~mem98#1 - 1 >= 0 then (main_#t~mem98#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1; {8621#false} is VALID [2022-02-20 23:32:59,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {8621#false} goto; {8621#false} is VALID [2022-02-20 23:32:59,485 INFO L290 TraceCheckUtils]: 45: Hoare triple {8621#false} call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem100#1.base, main_#t~mem100#1.offset := read~$Pointer$(main_#t~mem99#1.base, main_#t~mem99#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem100#1.base, main_#t~mem100#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem99#1.base, main_#t~mem99#1.offset;havoc main_#t~mem100#1.base, main_#t~mem100#1.offset;call main_#t~mem101#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post102#1 := main_#t~mem101#1;call write~int(1 + main_#t~post102#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem101#1;havoc main_#t~post102#1;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem103#1.base, main_#t~mem103#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {8621#false} is VALID [2022-02-20 23:32:59,486 INFO L290 TraceCheckUtils]: 46: Hoare triple {8621#false} assume main_#t~mem104#1.base != 0 || main_#t~mem104#1.offset != 0;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem105#1.base, 12 + main_#t~mem105#1.offset, 4);havoc main_#t~mem105#1.base, main_#t~mem105#1.offset; {8621#false} is VALID [2022-02-20 23:32:59,486 INFO L290 TraceCheckUtils]: 47: Hoare triple {8621#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem107#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem106#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short110#1 := main_#t~mem107#1 % 4294967296 >= 10 * (1 + main_#t~mem106#1) % 4294967296; {8621#false} is VALID [2022-02-20 23:32:59,486 INFO L290 TraceCheckUtils]: 48: Hoare triple {8621#false} assume main_#t~short110#1;call main_#t~mem108#1.base, main_#t~mem108#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem109#1 := read~int(main_#t~mem108#1.base, 36 + main_#t~mem108#1.offset, 4);main_#t~short110#1 := 0 == main_#t~mem109#1 % 4294967296; {8621#false} is VALID [2022-02-20 23:32:59,486 INFO L290 TraceCheckUtils]: 49: Hoare triple {8621#false} assume main_#t~short110#1;havoc main_#t~mem107#1;havoc main_#t~mem106#1;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;havoc main_#t~mem109#1;havoc main_#t~short110#1; {8621#false} is VALID [2022-02-20 23:32:59,486 INFO L290 TraceCheckUtils]: 50: Hoare triple {8621#false} havoc main_~_he_bkt~0#1;havoc main_~_he_bkt_i~0#1;havoc main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset;havoc main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset;call main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset;call main_#t~mem111#1.base, main_#t~mem111#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem112#1 := read~int(main_#t~mem111#1.base, 4 + main_#t~mem111#1.offset, 4); {8621#false} is VALID [2022-02-20 23:32:59,486 INFO L272 TraceCheckUtils]: 51: Hoare triple {8621#false} call main_#t~ret113#1.base, main_#t~ret113#1.offset := alt_malloc(24 * main_#t~mem112#1); {8621#false} is VALID [2022-02-20 23:32:59,486 INFO L290 TraceCheckUtils]: 52: Hoare triple {8621#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {8621#false} is VALID [2022-02-20 23:32:59,486 INFO L290 TraceCheckUtils]: 53: Hoare triple {8621#false} assume 1 == ~alt_malloc_balance~0; {8621#false} is VALID [2022-02-20 23:32:59,487 INFO L272 TraceCheckUtils]: 54: Hoare triple {8621#false} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {8621#false} is VALID [2022-02-20 23:32:59,487 INFO L290 TraceCheckUtils]: 55: Hoare triple {8621#false} ~cond := #in~cond; {8621#false} is VALID [2022-02-20 23:32:59,487 INFO L290 TraceCheckUtils]: 56: Hoare triple {8621#false} assume 0 == ~cond; {8621#false} is VALID [2022-02-20 23:32:59,487 INFO L290 TraceCheckUtils]: 57: Hoare triple {8621#false} assume !false; {8621#false} is VALID [2022-02-20 23:32:59,487 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:32:59,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:32:59,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:32:59,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528765974] [2022-02-20 23:32:59,487 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:32:59,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963763651] [2022-02-20 23:32:59,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963763651] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:32:59,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:32:59,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:32:59,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801386855] [2022-02-20 23:32:59,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:32:59,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 23:32:59,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:32:59,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:32:59,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:32:59,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:32:59,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:32:59,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:32:59,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:32:59,543 INFO L87 Difference]: Start difference. First operand 237 states and 293 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:00,097 INFO L93 Difference]: Finished difference Result 592 states and 736 transitions. [2022-02-20 23:33:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:33:00,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 23:33:00,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2022-02-20 23:33:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2022-02-20 23:33:00,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 696 transitions. [2022-02-20 23:33:00,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 696 edges. 696 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:00,603 INFO L225 Difference]: With dead ends: 592 [2022-02-20 23:33:00,604 INFO L226 Difference]: Without dead ends: 359 [2022-02-20 23:33:00,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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:33:00,605 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 106 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:00,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 560 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:33:00,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-02-20 23:33:00,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 345. [2022-02-20 23:33:00,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:00,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 345 states, 321 states have (on average 1.249221183800623) internal successors, (401), 327 states have internal predecessors, (401), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:33:00,637 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 345 states, 321 states have (on average 1.249221183800623) internal successors, (401), 327 states have internal predecessors, (401), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:33:00,638 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 345 states, 321 states have (on average 1.249221183800623) internal successors, (401), 327 states have internal predecessors, (401), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:33:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:00,646 INFO L93 Difference]: Finished difference Result 359 states and 445 transitions. [2022-02-20 23:33:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 445 transitions. [2022-02-20 23:33:00,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:00,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:00,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 345 states, 321 states have (on average 1.249221183800623) internal successors, (401), 327 states have internal predecessors, (401), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 359 states. [2022-02-20 23:33:00,648 INFO L87 Difference]: Start difference. First operand has 345 states, 321 states have (on average 1.249221183800623) internal successors, (401), 327 states have internal predecessors, (401), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 359 states. [2022-02-20 23:33:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:00,655 INFO L93 Difference]: Finished difference Result 359 states and 445 transitions. [2022-02-20 23:33:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 445 transitions. [2022-02-20 23:33:00,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:00,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:00,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:00,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 321 states have (on average 1.249221183800623) internal successors, (401), 327 states have internal predecessors, (401), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:33:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 428 transitions. [2022-02-20 23:33:00,663 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 428 transitions. Word has length 58 [2022-02-20 23:33:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:00,663 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 428 transitions. [2022-02-20 23:33:00,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:33:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 428 transitions. [2022-02-20 23:33:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-20 23:33:00,664 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:00,664 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:00,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:33:00,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:00,879 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 23:33:00,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1298801861, now seen corresponding path program 1 times [2022-02-20 23:33:00,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:00,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534521754] [2022-02-20 23:33:00,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:00,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:00,903 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:00,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [47810132] [2022-02-20 23:33:00,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:00,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:00,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:00,905 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:33:00,917 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:33:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:01,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:33:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:01,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:01,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {10640#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,504 INFO L290 TraceCheckUtils]: 3: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,505 INFO L290 TraceCheckUtils]: 4: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} havoc main_~_ha_hashv~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} goto; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,510 INFO L290 TraceCheckUtils]: 17: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,511 INFO L290 TraceCheckUtils]: 20: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} havoc main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,518 INFO L290 TraceCheckUtils]: 35: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} goto; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} goto; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} goto; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,519 INFO L290 TraceCheckUtils]: 39: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,520 INFO L272 TraceCheckUtils]: 40: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {10766#(<= |old(~alt_malloc_balance~0)| ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {10766#(<= |old(~alt_malloc_balance~0)| ~alt_malloc_balance~0)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {10770#(<= (+ |old(~alt_malloc_balance~0)| 1) ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {10770#(<= (+ |old(~alt_malloc_balance~0)| 1) ~alt_malloc_balance~0)} assume !(1 == ~alt_malloc_balance~0); {10770#(<= (+ |old(~alt_malloc_balance~0)| 1) ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {10770#(<= (+ |old(~alt_malloc_balance~0)| 1) ~alt_malloc_balance~0)} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {10770#(<= (+ |old(~alt_malloc_balance~0)| 1) ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {10770#(<= (+ |old(~alt_malloc_balance~0)| 1) ~alt_malloc_balance~0)} assume true; {10770#(<= (+ |old(~alt_malloc_balance~0)| 1) ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,523 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10770#(<= (+ |old(~alt_malloc_balance~0)| 1) ~alt_malloc_balance~0)} {10645#(<= 0 ~alt_malloc_balance~0)} #835#return; {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,523 INFO L290 TraceCheckUtils]: 46: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,524 INFO L290 TraceCheckUtils]: 47: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,524 INFO L272 TraceCheckUtils]: 48: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,525 INFO L290 TraceCheckUtils]: 49: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,525 INFO L290 TraceCheckUtils]: 50: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,525 INFO L290 TraceCheckUtils]: 51: Hoare triple {10783#(<= 1 ~alt_malloc_balance~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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,525 INFO L290 TraceCheckUtils]: 52: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} assume true; {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,526 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10783#(<= 1 ~alt_malloc_balance~0)} {10783#(<= 1 ~alt_malloc_balance~0)} #837#return; {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,526 INFO L290 TraceCheckUtils]: 54: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,527 INFO L272 TraceCheckUtils]: 55: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,528 INFO L290 TraceCheckUtils]: 56: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {10817#(<= 2 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,528 INFO L290 TraceCheckUtils]: 57: Hoare triple {10817#(<= 2 ~alt_malloc_balance~0)} assume 1 == ~alt_malloc_balance~0; {10641#false} is VALID [2022-02-20 23:33:01,528 INFO L272 TraceCheckUtils]: 58: Hoare triple {10641#false} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {10641#false} is VALID [2022-02-20 23:33:01,528 INFO L290 TraceCheckUtils]: 59: Hoare triple {10641#false} ~cond := #in~cond; {10641#false} is VALID [2022-02-20 23:33:01,528 INFO L290 TraceCheckUtils]: 60: Hoare triple {10641#false} assume 0 == ~cond; {10641#false} is VALID [2022-02-20 23:33:01,528 INFO L290 TraceCheckUtils]: 61: Hoare triple {10641#false} assume !false; {10641#false} is VALID [2022-02-20 23:33:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:33:01,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:33:01,946 INFO L290 TraceCheckUtils]: 61: Hoare triple {10641#false} assume !false; {10641#false} is VALID [2022-02-20 23:33:01,946 INFO L290 TraceCheckUtils]: 60: Hoare triple {10641#false} assume 0 == ~cond; {10641#false} is VALID [2022-02-20 23:33:01,946 INFO L290 TraceCheckUtils]: 59: Hoare triple {10641#false} ~cond := #in~cond; {10641#false} is VALID [2022-02-20 23:33:01,946 INFO L272 TraceCheckUtils]: 58: Hoare triple {10641#false} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {10641#false} is VALID [2022-02-20 23:33:01,947 INFO L290 TraceCheckUtils]: 57: Hoare triple {10817#(<= 2 ~alt_malloc_balance~0)} assume 1 == ~alt_malloc_balance~0; {10641#false} is VALID [2022-02-20 23:33:01,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {10817#(<= 2 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,948 INFO L272 TraceCheckUtils]: 55: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,948 INFO L290 TraceCheckUtils]: 54: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,949 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10640#true} {10783#(<= 1 ~alt_malloc_balance~0)} #837#return; {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {10640#true} assume true; {10640#true} is VALID [2022-02-20 23:33:01,949 INFO L290 TraceCheckUtils]: 51: Hoare triple {10640#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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {10640#true} is VALID [2022-02-20 23:33:01,949 INFO L290 TraceCheckUtils]: 50: Hoare triple {10640#true} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {10640#true} is VALID [2022-02-20 23:33:01,949 INFO L290 TraceCheckUtils]: 49: Hoare triple {10640#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {10640#true} is VALID [2022-02-20 23:33:01,949 INFO L272 TraceCheckUtils]: 48: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {10640#true} is VALID [2022-02-20 23:33:01,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {10783#(<= 1 ~alt_malloc_balance~0)} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,950 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10884#(or (<= 1 ~alt_malloc_balance~0) (< |old(~alt_malloc_balance~0)| 0))} {10645#(<= 0 ~alt_malloc_balance~0)} #835#return; {10783#(<= 1 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {10884#(or (<= 1 ~alt_malloc_balance~0) (< |old(~alt_malloc_balance~0)| 0))} assume true; {10884#(or (<= 1 ~alt_malloc_balance~0) (< |old(~alt_malloc_balance~0)| 0))} is VALID [2022-02-20 23:33:01,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {10884#(or (<= 1 ~alt_malloc_balance~0) (< |old(~alt_malloc_balance~0)| 0))} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {10884#(or (<= 1 ~alt_malloc_balance~0) (< |old(~alt_malloc_balance~0)| 0))} is VALID [2022-02-20 23:33:01,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {10884#(or (<= 1 ~alt_malloc_balance~0) (< |old(~alt_malloc_balance~0)| 0))} assume !(1 == ~alt_malloc_balance~0); {10884#(or (<= 1 ~alt_malloc_balance~0) (< |old(~alt_malloc_balance~0)| 0))} is VALID [2022-02-20 23:33:01,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {10897#(or (< |old(~alt_malloc_balance~0)| 0) (<= 0 ~alt_malloc_balance~0))} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {10884#(or (<= 1 ~alt_malloc_balance~0) (< |old(~alt_malloc_balance~0)| 0))} is VALID [2022-02-20 23:33:01,952 INFO L272 TraceCheckUtils]: 40: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {10897#(or (< |old(~alt_malloc_balance~0)| 0) (<= 0 ~alt_malloc_balance~0))} is VALID [2022-02-20 23:33:01,953 INFO L290 TraceCheckUtils]: 39: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,953 INFO L290 TraceCheckUtils]: 38: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,953 INFO L290 TraceCheckUtils]: 37: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} goto; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,953 INFO L290 TraceCheckUtils]: 36: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} goto; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} goto; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} havoc main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,957 INFO L290 TraceCheckUtils]: 25: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !main_#t~switch59#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} goto; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} havoc main_~_ha_hashv~0#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,964 INFO L290 TraceCheckUtils]: 4: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,964 INFO L290 TraceCheckUtils]: 3: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {10645#(<= 0 ~alt_malloc_balance~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {10640#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {10645#(<= 0 ~alt_malloc_balance~0)} is VALID [2022-02-20 23:33:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:33:01,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:01,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534521754] [2022-02-20 23:33:01,966 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:01,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47810132] [2022-02-20 23:33:01,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47810132] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 23:33:01,966 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:33:01,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 9 [2022-02-20 23:33:01,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108453313] [2022-02-20 23:33:01,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:33:01,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2022-02-20 23:33:01,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:01,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:33:02,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:02,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:33:02,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:02,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:33:02,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:33:02,011 INFO L87 Difference]: Start difference. First operand 345 states and 428 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:33:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:03,493 INFO L93 Difference]: Finished difference Result 1228 states and 1566 transitions. [2022-02-20 23:33:03,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:33:03,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2022-02-20 23:33:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:33:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1095 transitions. [2022-02-20 23:33:03,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:33:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1095 transitions. [2022-02-20 23:33:03,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1095 transitions. [2022-02-20 23:33:04,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1095 edges. 1095 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:04,348 INFO L225 Difference]: With dead ends: 1228 [2022-02-20 23:33:04,348 INFO L226 Difference]: Without dead ends: 932 [2022-02-20 23:33:04,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:33:04,349 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 1327 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1327 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:04,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1327 Valid, 987 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:33:04,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2022-02-20 23:33:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 573. [2022-02-20 23:33:04,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:04,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 932 states. Second operand has 573 states, 544 states have (on average 1.2610294117647058) internal successors, (686), 550 states have internal predecessors, (686), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:04,464 INFO L74 IsIncluded]: Start isIncluded. First operand 932 states. Second operand has 573 states, 544 states have (on average 1.2610294117647058) internal successors, (686), 550 states have internal predecessors, (686), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:04,465 INFO L87 Difference]: Start difference. First operand 932 states. Second operand has 573 states, 544 states have (on average 1.2610294117647058) internal successors, (686), 550 states have internal predecessors, (686), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:04,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:04,492 INFO L93 Difference]: Finished difference Result 932 states and 1184 transitions. [2022-02-20 23:33:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1184 transitions. [2022-02-20 23:33:04,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:04,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:04,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 573 states, 544 states have (on average 1.2610294117647058) internal successors, (686), 550 states have internal predecessors, (686), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) Second operand 932 states. [2022-02-20 23:33:04,496 INFO L87 Difference]: Start difference. First operand has 573 states, 544 states have (on average 1.2610294117647058) internal successors, (686), 550 states have internal predecessors, (686), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) Second operand 932 states. [2022-02-20 23:33:04,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:04,524 INFO L93 Difference]: Finished difference Result 932 states and 1184 transitions. [2022-02-20 23:33:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1184 transitions. [2022-02-20 23:33:04,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:04,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:04,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:04,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 544 states have (on average 1.2610294117647058) internal successors, (686), 550 states have internal predecessors, (686), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:04,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 718 transitions. [2022-02-20 23:33:04,540 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 718 transitions. Word has length 62 [2022-02-20 23:33:04,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:04,540 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 718 transitions. [2022-02-20 23:33:04,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:33:04,540 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 718 transitions. [2022-02-20 23:33:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-20 23:33:04,542 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:04,542 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:04,562 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:33:04,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:04,761 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 23:33:04,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:04,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1545086991, now seen corresponding path program 1 times [2022-02-20 23:33:04,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:04,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145835648] [2022-02-20 23:33:04,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:04,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:04,802 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:04,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072184072] [2022-02-20 23:33:04,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:04,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:04,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:04,804 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:33:04,823 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:33:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:05,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:33:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:05,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:05,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {15019#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,429 INFO L290 TraceCheckUtils]: 4: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} havoc main_~_ha_hashv~0#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} goto; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume !main_#t~switch59#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} havoc main_#t~switch59#1; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} goto; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} goto; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} goto; {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {15024#(= ~alt_malloc_balance~0 0)} is VALID [2022-02-20 23:33:05,438 INFO L272 TraceCheckUtils]: 40: Hoare triple {15024#(= ~alt_malloc_balance~0 0)} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {15145#(= ~alt_malloc_balance~0 |old(~alt_malloc_balance~0)|)} is VALID [2022-02-20 23:33:05,439 INFO L290 TraceCheckUtils]: 41: Hoare triple {15145#(= ~alt_malloc_balance~0 |old(~alt_malloc_balance~0)|)} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {15149#(= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|)} is VALID [2022-02-20 23:33:05,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {15149#(= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|)} assume !(1 == ~alt_malloc_balance~0); {15153#(and (= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|) (not (= ~alt_malloc_balance~0 1)))} is VALID [2022-02-20 23:33:05,440 INFO L290 TraceCheckUtils]: 43: Hoare triple {15153#(and (= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|) (not (= ~alt_malloc_balance~0 1)))} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {15153#(and (= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|) (not (= ~alt_malloc_balance~0 1)))} is VALID [2022-02-20 23:33:05,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {15153#(and (= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|) (not (= ~alt_malloc_balance~0 1)))} assume true; {15153#(and (= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|) (not (= ~alt_malloc_balance~0 1)))} is VALID [2022-02-20 23:33:05,441 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {15153#(and (= (+ (- 1) ~alt_malloc_balance~0) |old(~alt_malloc_balance~0)|) (not (= ~alt_malloc_balance~0 1)))} {15024#(= ~alt_malloc_balance~0 0)} #835#return; {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {15020#false} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L290 TraceCheckUtils]: 47: Hoare triple {15020#false} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L272 TraceCheckUtils]: 48: Hoare triple {15020#false} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {15020#false} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L290 TraceCheckUtils]: 50: Hoare triple {15020#false} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {15020#false} 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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L290 TraceCheckUtils]: 52: Hoare triple {15020#false} assume true; {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15020#false} {15020#false} #837#return; {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {15020#false} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L272 TraceCheckUtils]: 55: Hoare triple {15020#false} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L290 TraceCheckUtils]: 56: Hoare triple {15020#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L290 TraceCheckUtils]: 57: Hoare triple {15020#false} assume !(1 == ~alt_malloc_balance~0); {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L290 TraceCheckUtils]: 58: Hoare triple {15020#false} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L290 TraceCheckUtils]: 59: Hoare triple {15020#false} assume true; {15020#false} is VALID [2022-02-20 23:33:05,442 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {15020#false} {15020#false} #839#return; {15020#false} is VALID [2022-02-20 23:33:05,443 INFO L290 TraceCheckUtils]: 61: Hoare triple {15020#false} call write~$Pointer$(main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, 4);havoc main_#t~mem78#1.base, main_#t~mem78#1.offset;havoc main_#t~ret79#1.base, main_#t~ret79#1.offset;call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem80#1.base, 40 + main_#t~mem80#1.offset, 4);havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$(main_#t~mem81#1.base, main_#t~mem81#1.offset, 4); {15020#false} is VALID [2022-02-20 23:33:05,443 INFO L290 TraceCheckUtils]: 62: Hoare triple {15020#false} assume !(main_#t~mem82#1.base == 0 && main_#t~mem82#1.offset == 0);havoc main_#t~mem81#1.base, main_#t~mem81#1.offset;havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(main_#t~mem84#1.base, main_#t~mem84#1.offset, 4); {15020#false} is VALID [2022-02-20 23:33:05,443 INFO L272 TraceCheckUtils]: 63: Hoare triple {15020#false} call alt_bzero(main_#t~mem85#1.base, main_#t~mem85#1.offset, 384); {15020#false} is VALID [2022-02-20 23:33:05,443 INFO L290 TraceCheckUtils]: 64: Hoare triple {15020#false} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {15020#false} is VALID [2022-02-20 23:33:05,443 INFO L290 TraceCheckUtils]: 65: Hoare triple {15020#false} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {15020#false} is VALID [2022-02-20 23:33:05,443 INFO L290 TraceCheckUtils]: 66: Hoare triple {15020#false} 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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {15020#false} is VALID [2022-02-20 23:33:05,443 INFO L290 TraceCheckUtils]: 67: Hoare triple {15020#false} assume true; {15020#false} is VALID [2022-02-20 23:33:05,443 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15020#false} {15020#false} #843#return; {15020#false} is VALID [2022-02-20 23:33:05,443 INFO L290 TraceCheckUtils]: 69: Hoare triple {15020#false} havoc main_#t~mem84#1.base, main_#t~mem84#1.offset;havoc main_#t~mem85#1.base, main_#t~mem85#1.offset; {15020#false} is VALID [2022-02-20 23:33:05,443 INFO L290 TraceCheckUtils]: 70: Hoare triple {15020#false} goto; {15020#false} is VALID [2022-02-20 23:33:05,443 INFO L290 TraceCheckUtils]: 71: Hoare triple {15020#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {15020#false} is VALID [2022-02-20 23:33:05,443 INFO L290 TraceCheckUtils]: 72: Hoare triple {15020#false} havoc main_~_ha_bkt~0#1;call main_#t~mem94#1.base, main_#t~mem94#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem95#1 := read~int(main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);main_#t~post96#1 := main_#t~mem95#1;call write~int(1 + main_#t~post96#1, main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);havoc main_#t~mem94#1.base, main_#t~mem94#1.offset;havoc main_#t~mem95#1;havoc main_#t~post96#1; {15020#false} is VALID [2022-02-20 23:33:05,443 INFO L290 TraceCheckUtils]: 73: Hoare triple {15020#false} call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem98#1 := read~int(main_#t~mem97#1.base, 4 + main_#t~mem97#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem98#1 - 1 then 0 else (if 1 == main_#t~mem98#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem98#1 - 1 || 0 == main_#t~mem98#1 - 1 then main_#t~mem98#1 - 1 else (if main_#t~mem98#1 - 1 >= 0 then (main_#t~mem98#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1; {15020#false} is VALID [2022-02-20 23:33:05,443 INFO L290 TraceCheckUtils]: 74: Hoare triple {15020#false} goto; {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 75: Hoare triple {15020#false} call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem100#1.base, main_#t~mem100#1.offset := read~$Pointer$(main_#t~mem99#1.base, main_#t~mem99#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem100#1.base, main_#t~mem100#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem99#1.base, main_#t~mem99#1.offset;havoc main_#t~mem100#1.base, main_#t~mem100#1.offset;call main_#t~mem101#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post102#1 := main_#t~mem101#1;call write~int(1 + main_#t~post102#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem101#1;havoc main_#t~post102#1;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem103#1.base, main_#t~mem103#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 76: Hoare triple {15020#false} assume main_#t~mem104#1.base != 0 || main_#t~mem104#1.offset != 0;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem105#1.base, 12 + main_#t~mem105#1.offset, 4);havoc main_#t~mem105#1.base, main_#t~mem105#1.offset; {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 77: Hoare triple {15020#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem107#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem106#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short110#1 := main_#t~mem107#1 % 4294967296 >= 10 * (1 + main_#t~mem106#1) % 4294967296; {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 78: Hoare triple {15020#false} assume !main_#t~short110#1; {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 79: Hoare triple {15020#false} assume !main_#t~short110#1;havoc main_#t~mem107#1;havoc main_#t~mem106#1;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;havoc main_#t~mem109#1;havoc main_#t~short110#1; {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 80: Hoare triple {15020#false} goto; {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 81: Hoare triple {15020#false} goto; {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 82: Hoare triple {15020#false} goto; {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 83: Hoare triple {15020#false} goto; {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 84: Hoare triple {15020#false} call main_#t~mem40#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post41#1 := main_#t~mem40#1;call write~int(1 + main_#t~post41#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem40#1;havoc main_#t~post41#1; {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 85: Hoare triple {15020#false} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 86: Hoare triple {15020#false} assume !(main_#t~mem42#1 < 10);havoc main_#t~mem42#1; {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 87: Hoare triple {15020#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 88: Hoare triple {15020#false} call main_#t~mem180#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 89: Hoare triple {15020#false} assume !(main_#t~mem180#1 < 10);havoc main_#t~mem180#1; {15020#false} is VALID [2022-02-20 23:33:05,444 INFO L290 TraceCheckUtils]: 90: Hoare triple {15020#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {15020#false} is VALID [2022-02-20 23:33:05,445 INFO L290 TraceCheckUtils]: 91: Hoare triple {15020#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0); {15020#false} is VALID [2022-02-20 23:33:05,445 INFO L290 TraceCheckUtils]: 92: Hoare triple {15020#false} assume !false; {15020#false} is VALID [2022-02-20 23:33:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 23:33:05,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:33:05,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:05,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145835648] [2022-02-20 23:33:05,446 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:05,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072184072] [2022-02-20 23:33:05,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072184072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:33:05,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:33:05,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:33:05,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61247832] [2022-02-20 23:33:05,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:33:05,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 93 [2022-02-20 23:33:05,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:05,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:33:05,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:05,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:33:05,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:05,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:33:05,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:33:05,531 INFO L87 Difference]: Start difference. First operand 573 states and 718 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:33:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:06,795 INFO L93 Difference]: Finished difference Result 1078 states and 1360 transitions. [2022-02-20 23:33:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:33:06,795 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 93 [2022-02-20 23:33:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:33:06,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 595 transitions. [2022-02-20 23:33:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:33:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 595 transitions. [2022-02-20 23:33:06,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 595 transitions. [2022-02-20 23:33:07,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:07,250 INFO L225 Difference]: With dead ends: 1078 [2022-02-20 23:33:07,250 INFO L226 Difference]: Without dead ends: 573 [2022-02-20 23:33:07,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:33:07,251 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 25 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:07,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 1226 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:33:07,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-02-20 23:33:07,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2022-02-20 23:33:07,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:07,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 573 states. Second operand has 573 states, 544 states have (on average 1.2610294117647058) internal successors, (686), 550 states have internal predecessors, (686), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 23:33:07,380 INFO L74 IsIncluded]: Start isIncluded. First operand 573 states. Second operand has 573 states, 544 states have (on average 1.2610294117647058) internal successors, (686), 550 states have internal predecessors, (686), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 23:33:07,381 INFO L87 Difference]: Start difference. First operand 573 states. Second operand has 573 states, 544 states have (on average 1.2610294117647058) internal successors, (686), 550 states have internal predecessors, (686), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 23:33:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:07,393 INFO L93 Difference]: Finished difference Result 573 states and 717 transitions. [2022-02-20 23:33:07,393 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 717 transitions. [2022-02-20 23:33:07,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:07,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:07,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 573 states, 544 states have (on average 1.2610294117647058) internal successors, (686), 550 states have internal predecessors, (686), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 573 states. [2022-02-20 23:33:07,396 INFO L87 Difference]: Start difference. First operand has 573 states, 544 states have (on average 1.2610294117647058) internal successors, (686), 550 states have internal predecessors, (686), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 573 states. [2022-02-20 23:33:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:07,408 INFO L93 Difference]: Finished difference Result 573 states and 717 transitions. [2022-02-20 23:33:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 717 transitions. [2022-02-20 23:33:07,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:07,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:07,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:07,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 544 states have (on average 1.2610294117647058) internal successors, (686), 550 states have internal predecessors, (686), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 23:33:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 717 transitions. [2022-02-20 23:33:07,424 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 717 transitions. Word has length 93 [2022-02-20 23:33:07,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:07,425 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 717 transitions. [2022-02-20 23:33:07,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:33:07,425 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 717 transitions. [2022-02-20 23:33:07,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 23:33:07,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:07,426 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:07,463 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:33:07,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:07,648 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 23:33:07,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:07,648 INFO L85 PathProgramCache]: Analyzing trace with hash -441690957, now seen corresponding path program 1 times [2022-02-20 23:33:07,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:07,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084545681] [2022-02-20 23:33:07,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:07,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:07,684 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:07,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1491607723] [2022-02-20 23:33:07,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:07,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:07,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:07,686 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:33:07,687 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:33:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:08,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:33:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:08,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:08,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:33:08,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:33:08,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {18399#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {18399#true} is VALID [2022-02-20 23:33:08,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {18399#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18399#true} is VALID [2022-02-20 23:33:08,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {18399#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18399#true} is VALID [2022-02-20 23:33:08,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {18399#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {18399#true} is VALID [2022-02-20 23:33:08,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {18399#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {18399#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {18399#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {18399#true} havoc main_~_ha_hashv~0#1; {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {18399#true} goto; {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {18399#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {18399#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {18399#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {18399#true} assume !main_#t~switch59#1; {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 13: Hoare triple {18399#true} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {18399#true} assume !main_#t~switch59#1; {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {18399#true} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {18399#true} assume !main_#t~switch59#1; {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {18399#true} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {18399#true} assume !main_#t~switch59#1; {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {18399#true} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {18399#true} is VALID [2022-02-20 23:33:08,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {18399#true} assume !main_#t~switch59#1; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {18399#true} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {18399#true} assume !main_#t~switch59#1; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {18399#true} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {18399#true} assume !main_#t~switch59#1; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {18399#true} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {18399#true} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {18399#true} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {18399#true} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {18399#true} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {18399#true} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 31: Hoare triple {18399#true} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {18399#true} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {18399#true} havoc main_#t~switch59#1; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 34: Hoare triple {18399#true} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 35: Hoare triple {18399#true} goto; {18399#true} is VALID [2022-02-20 23:33:08,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {18399#true} goto; {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L290 TraceCheckUtils]: 37: Hoare triple {18399#true} goto; {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L290 TraceCheckUtils]: 38: Hoare triple {18399#true} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L290 TraceCheckUtils]: 39: Hoare triple {18399#true} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L272 TraceCheckUtils]: 40: Hoare triple {18399#true} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L290 TraceCheckUtils]: 41: Hoare triple {18399#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L290 TraceCheckUtils]: 42: Hoare triple {18399#true} assume 1 == ~alt_malloc_balance~0; {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L272 TraceCheckUtils]: 43: Hoare triple {18399#true} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L290 TraceCheckUtils]: 44: Hoare triple {18399#true} ~cond := #in~cond; {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L290 TraceCheckUtils]: 45: Hoare triple {18399#true} assume !(0 == ~cond); {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L290 TraceCheckUtils]: 46: Hoare triple {18399#true} assume true; {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18399#true} {18399#true} #833#return; {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L290 TraceCheckUtils]: 48: Hoare triple {18399#true} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L290 TraceCheckUtils]: 49: Hoare triple {18399#true} assume true; {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {18399#true} {18399#true} #835#return; {18399#true} is VALID [2022-02-20 23:33:08,344 INFO L290 TraceCheckUtils]: 51: Hoare triple {18399#true} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L290 TraceCheckUtils]: 52: Hoare triple {18399#true} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L272 TraceCheckUtils]: 53: Hoare triple {18399#true} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L290 TraceCheckUtils]: 54: Hoare triple {18399#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L290 TraceCheckUtils]: 55: Hoare triple {18399#true} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L290 TraceCheckUtils]: 56: Hoare triple {18399#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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L290 TraceCheckUtils]: 57: Hoare triple {18399#true} assume true; {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18399#true} {18399#true} #837#return; {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L290 TraceCheckUtils]: 59: Hoare triple {18399#true} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L272 TraceCheckUtils]: 60: Hoare triple {18399#true} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L290 TraceCheckUtils]: 61: Hoare triple {18399#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L290 TraceCheckUtils]: 62: Hoare triple {18399#true} assume !(1 == ~alt_malloc_balance~0); {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L290 TraceCheckUtils]: 63: Hoare triple {18399#true} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L290 TraceCheckUtils]: 64: Hoare triple {18399#true} assume true; {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {18399#true} {18399#true} #839#return; {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L290 TraceCheckUtils]: 66: Hoare triple {18399#true} call write~$Pointer$(main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, 4);havoc main_#t~mem78#1.base, main_#t~mem78#1.offset;havoc main_#t~ret79#1.base, main_#t~ret79#1.offset;call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem80#1.base, 40 + main_#t~mem80#1.offset, 4);havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$(main_#t~mem81#1.base, main_#t~mem81#1.offset, 4); {18399#true} is VALID [2022-02-20 23:33:08,345 INFO L290 TraceCheckUtils]: 67: Hoare triple {18399#true} assume !(main_#t~mem82#1.base == 0 && main_#t~mem82#1.offset == 0);havoc main_#t~mem81#1.base, main_#t~mem81#1.offset;havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(main_#t~mem84#1.base, main_#t~mem84#1.offset, 4); {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L272 TraceCheckUtils]: 68: Hoare triple {18399#true} call alt_bzero(main_#t~mem85#1.base, main_#t~mem85#1.offset, 384); {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L290 TraceCheckUtils]: 69: Hoare triple {18399#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L290 TraceCheckUtils]: 70: Hoare triple {18399#true} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L290 TraceCheckUtils]: 71: Hoare triple {18399#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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L290 TraceCheckUtils]: 72: Hoare triple {18399#true} assume true; {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {18399#true} {18399#true} #843#return; {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L290 TraceCheckUtils]: 74: Hoare triple {18399#true} havoc main_#t~mem84#1.base, main_#t~mem84#1.offset;havoc main_#t~mem85#1.base, main_#t~mem85#1.offset; {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L290 TraceCheckUtils]: 75: Hoare triple {18399#true} goto; {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L290 TraceCheckUtils]: 76: Hoare triple {18399#true} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L290 TraceCheckUtils]: 77: Hoare triple {18399#true} havoc main_~_ha_bkt~0#1;call main_#t~mem94#1.base, main_#t~mem94#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem95#1 := read~int(main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);main_#t~post96#1 := main_#t~mem95#1;call write~int(1 + main_#t~post96#1, main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);havoc main_#t~mem94#1.base, main_#t~mem94#1.offset;havoc main_#t~mem95#1;havoc main_#t~post96#1; {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L290 TraceCheckUtils]: 78: Hoare triple {18399#true} call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem98#1 := read~int(main_#t~mem97#1.base, 4 + main_#t~mem97#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem98#1 - 1 then 0 else (if 1 == main_#t~mem98#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem98#1 - 1 || 0 == main_#t~mem98#1 - 1 then main_#t~mem98#1 - 1 else (if main_#t~mem98#1 - 1 >= 0 then (main_#t~mem98#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1; {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L290 TraceCheckUtils]: 79: Hoare triple {18399#true} goto; {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L290 TraceCheckUtils]: 80: Hoare triple {18399#true} call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem100#1.base, main_#t~mem100#1.offset := read~$Pointer$(main_#t~mem99#1.base, main_#t~mem99#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem100#1.base, main_#t~mem100#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem99#1.base, main_#t~mem99#1.offset;havoc main_#t~mem100#1.base, main_#t~mem100#1.offset;call main_#t~mem101#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post102#1 := main_#t~mem101#1;call write~int(1 + main_#t~post102#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem101#1;havoc main_#t~post102#1;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem103#1.base, main_#t~mem103#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L290 TraceCheckUtils]: 81: Hoare triple {18399#true} assume main_#t~mem104#1.base != 0 || main_#t~mem104#1.offset != 0;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem105#1.base, 12 + main_#t~mem105#1.offset, 4);havoc main_#t~mem105#1.base, main_#t~mem105#1.offset; {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L290 TraceCheckUtils]: 82: Hoare triple {18399#true} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem107#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem106#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short110#1 := main_#t~mem107#1 % 4294967296 >= 10 * (1 + main_#t~mem106#1) % 4294967296; {18399#true} is VALID [2022-02-20 23:33:08,346 INFO L290 TraceCheckUtils]: 83: Hoare triple {18399#true} assume !main_#t~short110#1; {18399#true} is VALID [2022-02-20 23:33:08,347 INFO L290 TraceCheckUtils]: 84: Hoare triple {18399#true} assume !main_#t~short110#1;havoc main_#t~mem107#1;havoc main_#t~mem106#1;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;havoc main_#t~mem109#1;havoc main_#t~short110#1; {18399#true} is VALID [2022-02-20 23:33:08,347 INFO L290 TraceCheckUtils]: 85: Hoare triple {18399#true} goto; {18399#true} is VALID [2022-02-20 23:33:08,347 INFO L290 TraceCheckUtils]: 86: Hoare triple {18399#true} goto; {18399#true} is VALID [2022-02-20 23:33:08,347 INFO L290 TraceCheckUtils]: 87: Hoare triple {18399#true} goto; {18399#true} is VALID [2022-02-20 23:33:08,347 INFO L290 TraceCheckUtils]: 88: Hoare triple {18399#true} goto; {18399#true} is VALID [2022-02-20 23:33:08,347 INFO L290 TraceCheckUtils]: 89: Hoare triple {18399#true} call main_#t~mem40#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post41#1 := main_#t~mem40#1;call write~int(1 + main_#t~post41#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem40#1;havoc main_#t~post41#1; {18399#true} is VALID [2022-02-20 23:33:08,347 INFO L290 TraceCheckUtils]: 90: Hoare triple {18399#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18399#true} is VALID [2022-02-20 23:33:08,347 INFO L290 TraceCheckUtils]: 91: Hoare triple {18399#true} assume !(main_#t~mem42#1 < 10);havoc main_#t~mem42#1; {18399#true} is VALID [2022-02-20 23:33:08,348 INFO L290 TraceCheckUtils]: 92: Hoare triple {18399#true} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18680#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} is VALID [2022-02-20 23:33:08,348 INFO L290 TraceCheckUtils]: 93: Hoare triple {18680#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} call main_#t~mem180#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18684#(<= |ULTIMATE.start_main_#t~mem180#1| 0)} is VALID [2022-02-20 23:33:08,348 INFO L290 TraceCheckUtils]: 94: Hoare triple {18684#(<= |ULTIMATE.start_main_#t~mem180#1| 0)} assume !(main_#t~mem180#1 < 10);havoc main_#t~mem180#1; {18400#false} is VALID [2022-02-20 23:33:08,348 INFO L290 TraceCheckUtils]: 95: Hoare triple {18400#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {18400#false} is VALID [2022-02-20 23:33:08,349 INFO L290 TraceCheckUtils]: 96: Hoare triple {18400#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0); {18400#false} is VALID [2022-02-20 23:33:08,349 INFO L290 TraceCheckUtils]: 97: Hoare triple {18400#false} assume !false; {18400#false} is VALID [2022-02-20 23:33:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 23:33:08,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:33:08,349 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:08,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084545681] [2022-02-20 23:33:08,349 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:08,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491607723] [2022-02-20 23:33:08,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491607723] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:33:08,349 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:33:08,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:33:08,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387757849] [2022-02-20 23:33:08,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:33:08,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 98 [2022-02-20 23:33:08,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:08,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 23:33:08,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:08,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:33:08,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:08,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:33:08,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:33:08,420 INFO L87 Difference]: Start difference. First operand 573 states and 717 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 23:33:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:09,440 INFO L93 Difference]: Finished difference Result 779 states and 994 transitions. [2022-02-20 23:33:09,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:33:09,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 98 [2022-02-20 23:33:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:09,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 23:33:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 411 transitions. [2022-02-20 23:33:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 23:33:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 411 transitions. [2022-02-20 23:33:09,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 411 transitions. [2022-02-20 23:33:09,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 411 edges. 411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:09,737 INFO L225 Difference]: With dead ends: 779 [2022-02-20 23:33:09,738 INFO L226 Difference]: Without dead ends: 766 [2022-02-20 23:33:09,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:33:09,739 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 107 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:09,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 720 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:33:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-02-20 23:33:09,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 577. [2022-02-20 23:33:09,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:09,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 766 states. Second operand has 577 states, 548 states have (on average 1.2591240875912408) internal successors, (690), 554 states have internal predecessors, (690), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 23:33:09,854 INFO L74 IsIncluded]: Start isIncluded. First operand 766 states. Second operand has 577 states, 548 states have (on average 1.2591240875912408) internal successors, (690), 554 states have internal predecessors, (690), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 23:33:09,854 INFO L87 Difference]: Start difference. First operand 766 states. Second operand has 577 states, 548 states have (on average 1.2591240875912408) internal successors, (690), 554 states have internal predecessors, (690), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 23:33:09,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:09,872 INFO L93 Difference]: Finished difference Result 766 states and 978 transitions. [2022-02-20 23:33:09,872 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 978 transitions. [2022-02-20 23:33:09,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:09,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:09,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 577 states, 548 states have (on average 1.2591240875912408) internal successors, (690), 554 states have internal predecessors, (690), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 766 states. [2022-02-20 23:33:09,875 INFO L87 Difference]: Start difference. First operand has 577 states, 548 states have (on average 1.2591240875912408) internal successors, (690), 554 states have internal predecessors, (690), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 766 states. [2022-02-20 23:33:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:09,893 INFO L93 Difference]: Finished difference Result 766 states and 978 transitions. [2022-02-20 23:33:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 978 transitions. [2022-02-20 23:33:09,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:09,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:09,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:09,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:09,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 548 states have (on average 1.2591240875912408) internal successors, (690), 554 states have internal predecessors, (690), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 23:33:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 721 transitions. [2022-02-20 23:33:09,907 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 721 transitions. Word has length 98 [2022-02-20 23:33:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:09,907 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 721 transitions. [2022-02-20 23:33:09,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 23:33:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 721 transitions. [2022-02-20 23:33:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-02-20 23:33:09,908 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:09,909 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:09,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:33:10,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 23:33:10,126 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 23:33:10,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:10,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1451857612, now seen corresponding path program 1 times [2022-02-20 23:33:10,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:10,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245072328] [2022-02-20 23:33:10,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:10,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:10,164 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:10,165 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919905343] [2022-02-20 23:33:10,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:10,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:10,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:10,166 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:33:10,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 23:33:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:10,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:33:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:10,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:11,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {21834#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {21834#true} is VALID [2022-02-20 23:33:11,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {21834#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {21834#true} is VALID [2022-02-20 23:33:11,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {21834#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {21834#true} is VALID [2022-02-20 23:33:11,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {21834#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {21834#true} is VALID [2022-02-20 23:33:11,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {21834#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {21834#true} is VALID [2022-02-20 23:33:11,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {21834#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {21834#true} is VALID [2022-02-20 23:33:11,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {21834#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {21834#true} is VALID [2022-02-20 23:33:11,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {21834#true} havoc main_~_ha_hashv~0#1; {21834#true} is VALID [2022-02-20 23:33:11,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {21834#true} goto; {21834#true} is VALID [2022-02-20 23:33:11,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {21834#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {21834#true} is VALID [2022-02-20 23:33:11,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {21834#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {21834#true} is VALID [2022-02-20 23:33:11,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {21834#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {21834#true} is VALID [2022-02-20 23:33:11,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {21834#true} assume !main_#t~switch59#1; {21834#true} is VALID [2022-02-20 23:33:11,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {21834#true} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {21834#true} is VALID [2022-02-20 23:33:11,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {21834#true} assume !main_#t~switch59#1; {21834#true} is VALID [2022-02-20 23:33:11,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {21834#true} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {21834#true} is VALID [2022-02-20 23:33:11,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {21834#true} assume !main_#t~switch59#1; {21834#true} is VALID [2022-02-20 23:33:11,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {21834#true} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {21834#true} is VALID [2022-02-20 23:33:11,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {21834#true} assume !main_#t~switch59#1; {21834#true} is VALID [2022-02-20 23:33:11,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {21834#true} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {21834#true} is VALID [2022-02-20 23:33:11,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {21834#true} assume !main_#t~switch59#1; {21834#true} is VALID [2022-02-20 23:33:11,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {21834#true} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {21834#true} is VALID [2022-02-20 23:33:11,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {21834#true} assume !main_#t~switch59#1; {21834#true} is VALID [2022-02-20 23:33:11,030 INFO L290 TraceCheckUtils]: 23: Hoare triple {21834#true} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {21834#true} is VALID [2022-02-20 23:33:11,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {21834#true} assume !main_#t~switch59#1; {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {21834#true} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {21834#true} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {21834#true} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {21834#true} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {21834#true} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {21834#true} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {21834#true} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {21834#true} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {21834#true} havoc main_#t~switch59#1; {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {21834#true} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {21834#true} goto; {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {21834#true} goto; {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {21834#true} goto; {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {21834#true} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {21834#true} is VALID [2022-02-20 23:33:11,031 INFO L290 TraceCheckUtils]: 39: Hoare triple {21834#true} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {21834#true} is VALID [2022-02-20 23:33:11,032 INFO L272 TraceCheckUtils]: 40: Hoare triple {21834#true} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {21834#true} is VALID [2022-02-20 23:33:11,032 INFO L290 TraceCheckUtils]: 41: Hoare triple {21834#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {21962#(= |alt_malloc_#in~sz| alt_malloc_~sz)} is VALID [2022-02-20 23:33:11,032 INFO L290 TraceCheckUtils]: 42: Hoare triple {21962#(= |alt_malloc_#in~sz| alt_malloc_~sz)} assume 1 == ~alt_malloc_balance~0; {21962#(= |alt_malloc_#in~sz| alt_malloc_~sz)} is VALID [2022-02-20 23:33:11,032 INFO L272 TraceCheckUtils]: 43: Hoare triple {21962#(= |alt_malloc_#in~sz| alt_malloc_~sz)} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {21834#true} is VALID [2022-02-20 23:33:11,033 INFO L290 TraceCheckUtils]: 44: Hoare triple {21834#true} ~cond := #in~cond; {21972#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 23:33:11,033 INFO L290 TraceCheckUtils]: 45: Hoare triple {21972#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {21976#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 23:33:11,033 INFO L290 TraceCheckUtils]: 46: Hoare triple {21976#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {21976#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 23:33:11,034 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21976#(not (= |__VERIFIER_assert_#in~cond| 0))} {21962#(= |alt_malloc_#in~sz| alt_malloc_~sz)} #833#return; {21983#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-20 23:33:11,034 INFO L290 TraceCheckUtils]: 48: Hoare triple {21983#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {21983#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-20 23:33:11,034 INFO L290 TraceCheckUtils]: 49: Hoare triple {21983#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} assume true; {21983#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-20 23:33:11,034 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21983#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} {21834#true} #835#return; {21834#true} is VALID [2022-02-20 23:33:11,035 INFO L290 TraceCheckUtils]: 51: Hoare triple {21834#true} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {21834#true} is VALID [2022-02-20 23:33:11,035 INFO L290 TraceCheckUtils]: 52: Hoare triple {21834#true} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {21834#true} is VALID [2022-02-20 23:33:11,035 INFO L272 TraceCheckUtils]: 53: Hoare triple {21834#true} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {21834#true} is VALID [2022-02-20 23:33:11,035 INFO L290 TraceCheckUtils]: 54: Hoare triple {21834#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {22005#(and (= |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 0) (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:33:11,036 INFO L290 TraceCheckUtils]: 55: Hoare triple {22005#(and (= |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 0) (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|))} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {22009#(not (< 0 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-20 23:33:11,036 INFO L290 TraceCheckUtils]: 56: Hoare triple {22009#(not (< 0 (mod |alt_bzero_#in~n#1| 4294967296)))} 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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {22009#(not (< 0 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-20 23:33:11,036 INFO L290 TraceCheckUtils]: 57: Hoare triple {22009#(not (< 0 (mod |alt_bzero_#in~n#1| 4294967296)))} assume true; {22009#(not (< 0 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-20 23:33:11,037 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {22009#(not (< 0 (mod |alt_bzero_#in~n#1| 4294967296)))} {21834#true} #837#return; {21835#false} is VALID [2022-02-20 23:33:11,037 INFO L290 TraceCheckUtils]: 59: Hoare triple {21835#false} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {21835#false} is VALID [2022-02-20 23:33:11,037 INFO L272 TraceCheckUtils]: 60: Hoare triple {21835#false} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {21835#false} is VALID [2022-02-20 23:33:11,037 INFO L290 TraceCheckUtils]: 61: Hoare triple {21835#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {21835#false} is VALID [2022-02-20 23:33:11,037 INFO L290 TraceCheckUtils]: 62: Hoare triple {21835#false} assume !(1 == ~alt_malloc_balance~0); {21835#false} is VALID [2022-02-20 23:33:11,038 INFO L290 TraceCheckUtils]: 63: Hoare triple {21835#false} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {21835#false} is VALID [2022-02-20 23:33:11,038 INFO L290 TraceCheckUtils]: 64: Hoare triple {21835#false} assume true; {21835#false} is VALID [2022-02-20 23:33:11,038 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {21835#false} {21835#false} #839#return; {21835#false} is VALID [2022-02-20 23:33:11,038 INFO L290 TraceCheckUtils]: 66: Hoare triple {21835#false} call write~$Pointer$(main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, 4);havoc main_#t~mem78#1.base, main_#t~mem78#1.offset;havoc main_#t~ret79#1.base, main_#t~ret79#1.offset;call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem80#1.base, 40 + main_#t~mem80#1.offset, 4);havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$(main_#t~mem81#1.base, main_#t~mem81#1.offset, 4); {21835#false} is VALID [2022-02-20 23:33:11,038 INFO L290 TraceCheckUtils]: 67: Hoare triple {21835#false} assume !(main_#t~mem82#1.base == 0 && main_#t~mem82#1.offset == 0);havoc main_#t~mem81#1.base, main_#t~mem81#1.offset;havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(main_#t~mem84#1.base, main_#t~mem84#1.offset, 4); {21835#false} is VALID [2022-02-20 23:33:11,038 INFO L272 TraceCheckUtils]: 68: Hoare triple {21835#false} call alt_bzero(main_#t~mem85#1.base, main_#t~mem85#1.offset, 384); {21835#false} is VALID [2022-02-20 23:33:11,038 INFO L290 TraceCheckUtils]: 69: Hoare triple {21835#false} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {21835#false} is VALID [2022-02-20 23:33:11,038 INFO L290 TraceCheckUtils]: 70: Hoare triple {21835#false} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {21835#false} is VALID [2022-02-20 23:33:11,039 INFO L290 TraceCheckUtils]: 71: Hoare triple {21835#false} 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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {21835#false} is VALID [2022-02-20 23:33:11,039 INFO L290 TraceCheckUtils]: 72: Hoare triple {21835#false} assume true; {21835#false} is VALID [2022-02-20 23:33:11,039 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {21835#false} {21835#false} #843#return; {21835#false} is VALID [2022-02-20 23:33:11,039 INFO L290 TraceCheckUtils]: 74: Hoare triple {21835#false} havoc main_#t~mem84#1.base, main_#t~mem84#1.offset;havoc main_#t~mem85#1.base, main_#t~mem85#1.offset; {21835#false} is VALID [2022-02-20 23:33:11,039 INFO L290 TraceCheckUtils]: 75: Hoare triple {21835#false} goto; {21835#false} is VALID [2022-02-20 23:33:11,039 INFO L290 TraceCheckUtils]: 76: Hoare triple {21835#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {21835#false} is VALID [2022-02-20 23:33:11,039 INFO L290 TraceCheckUtils]: 77: Hoare triple {21835#false} havoc main_~_ha_bkt~0#1;call main_#t~mem94#1.base, main_#t~mem94#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem95#1 := read~int(main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);main_#t~post96#1 := main_#t~mem95#1;call write~int(1 + main_#t~post96#1, main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);havoc main_#t~mem94#1.base, main_#t~mem94#1.offset;havoc main_#t~mem95#1;havoc main_#t~post96#1; {21835#false} is VALID [2022-02-20 23:33:11,039 INFO L290 TraceCheckUtils]: 78: Hoare triple {21835#false} call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem98#1 := read~int(main_#t~mem97#1.base, 4 + main_#t~mem97#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem98#1 - 1 then 0 else (if 1 == main_#t~mem98#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem98#1 - 1 || 0 == main_#t~mem98#1 - 1 then main_#t~mem98#1 - 1 else (if main_#t~mem98#1 - 1 >= 0 then (main_#t~mem98#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1; {21835#false} is VALID [2022-02-20 23:33:11,039 INFO L290 TraceCheckUtils]: 79: Hoare triple {21835#false} goto; {21835#false} is VALID [2022-02-20 23:33:11,040 INFO L290 TraceCheckUtils]: 80: Hoare triple {21835#false} call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem100#1.base, main_#t~mem100#1.offset := read~$Pointer$(main_#t~mem99#1.base, main_#t~mem99#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem100#1.base, main_#t~mem100#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem99#1.base, main_#t~mem99#1.offset;havoc main_#t~mem100#1.base, main_#t~mem100#1.offset;call main_#t~mem101#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post102#1 := main_#t~mem101#1;call write~int(1 + main_#t~post102#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem101#1;havoc main_#t~post102#1;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem103#1.base, main_#t~mem103#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {21835#false} is VALID [2022-02-20 23:33:11,040 INFO L290 TraceCheckUtils]: 81: Hoare triple {21835#false} assume main_#t~mem104#1.base != 0 || main_#t~mem104#1.offset != 0;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem105#1.base, 12 + main_#t~mem105#1.offset, 4);havoc main_#t~mem105#1.base, main_#t~mem105#1.offset; {21835#false} is VALID [2022-02-20 23:33:11,040 INFO L290 TraceCheckUtils]: 82: Hoare triple {21835#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem107#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem106#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short110#1 := main_#t~mem107#1 % 4294967296 >= 10 * (1 + main_#t~mem106#1) % 4294967296; {21835#false} is VALID [2022-02-20 23:33:11,040 INFO L290 TraceCheckUtils]: 83: Hoare triple {21835#false} assume main_#t~short110#1;call main_#t~mem108#1.base, main_#t~mem108#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem109#1 := read~int(main_#t~mem108#1.base, 36 + main_#t~mem108#1.offset, 4);main_#t~short110#1 := 0 == main_#t~mem109#1 % 4294967296; {21835#false} is VALID [2022-02-20 23:33:11,040 INFO L290 TraceCheckUtils]: 84: Hoare triple {21835#false} assume main_#t~short110#1;havoc main_#t~mem107#1;havoc main_#t~mem106#1;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;havoc main_#t~mem109#1;havoc main_#t~short110#1; {21835#false} is VALID [2022-02-20 23:33:11,040 INFO L290 TraceCheckUtils]: 85: Hoare triple {21835#false} havoc main_~_he_bkt~0#1;havoc main_~_he_bkt_i~0#1;havoc main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset;havoc main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset;call main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset;call main_#t~mem111#1.base, main_#t~mem111#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem112#1 := read~int(main_#t~mem111#1.base, 4 + main_#t~mem111#1.offset, 4); {21835#false} is VALID [2022-02-20 23:33:11,040 INFO L272 TraceCheckUtils]: 86: Hoare triple {21835#false} call main_#t~ret113#1.base, main_#t~ret113#1.offset := alt_malloc(24 * main_#t~mem112#1); {21835#false} is VALID [2022-02-20 23:33:11,040 INFO L290 TraceCheckUtils]: 87: Hoare triple {21835#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {21835#false} is VALID [2022-02-20 23:33:11,041 INFO L290 TraceCheckUtils]: 88: Hoare triple {21835#false} assume !(1 == ~alt_malloc_balance~0); {21835#false} is VALID [2022-02-20 23:33:11,041 INFO L290 TraceCheckUtils]: 89: Hoare triple {21835#false} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {21835#false} is VALID [2022-02-20 23:33:11,041 INFO L290 TraceCheckUtils]: 90: Hoare triple {21835#false} assume true; {21835#false} is VALID [2022-02-20 23:33:11,041 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {21835#false} {21835#false} #845#return; {21835#false} is VALID [2022-02-20 23:33:11,041 INFO L290 TraceCheckUtils]: 92: Hoare triple {21835#false} call write~$Pointer$(main_#t~ret113#1.base, main_#t~ret113#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4);havoc main_#t~mem111#1.base, main_#t~mem111#1.offset;havoc main_#t~mem112#1;havoc main_#t~ret113#1.base, main_#t~ret113#1.offset;call main_#t~mem114#1.base, main_#t~mem114#1.offset := read~$Pointer$(main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4); {21835#false} is VALID [2022-02-20 23:33:11,041 INFO L290 TraceCheckUtils]: 93: Hoare triple {21835#false} assume !(main_#t~mem114#1.base == 0 && main_#t~mem114#1.offset == 0);havoc main_#t~mem114#1.base, main_#t~mem114#1.offset;call main_#t~mem115#1.base, main_#t~mem115#1.offset := read~$Pointer$(main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4);call main_#t~mem116#1.base, main_#t~mem116#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem117#1 := read~int(main_#t~mem116#1.base, 4 + main_#t~mem116#1.offset, 4); {21835#false} is VALID [2022-02-20 23:33:11,041 INFO L272 TraceCheckUtils]: 94: Hoare triple {21835#false} call alt_bzero(main_#t~mem115#1.base, main_#t~mem115#1.offset, 24 * main_#t~mem117#1); {21835#false} is VALID [2022-02-20 23:33:11,042 INFO L290 TraceCheckUtils]: 95: Hoare triple {21835#false} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {21835#false} is VALID [2022-02-20 23:33:11,042 INFO L290 TraceCheckUtils]: 96: Hoare triple {21835#false} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {21835#false} is VALID [2022-02-20 23:33:11,042 INFO L290 TraceCheckUtils]: 97: Hoare triple {21835#false} 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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {21835#false} is VALID [2022-02-20 23:33:11,042 INFO L290 TraceCheckUtils]: 98: Hoare triple {21835#false} assume true; {21835#false} is VALID [2022-02-20 23:33:11,042 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {21835#false} {21835#false} #847#return; {21835#false} is VALID [2022-02-20 23:33:11,042 INFO L290 TraceCheckUtils]: 100: Hoare triple {21835#false} havoc main_#t~mem115#1.base, main_#t~mem115#1.offset;havoc main_#t~mem116#1.base, main_#t~mem116#1.offset;havoc main_#t~mem117#1;call main_#t~mem118#1.base, main_#t~mem118#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem119#1.base, main_#t~mem119#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem122#1 := read~int(main_#t~mem119#1.base, 12 + main_#t~mem119#1.offset, 4);call main_#t~mem120#1.base, main_#t~mem120#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem121#1 := read~int(main_#t~mem120#1.base, 8 + main_#t~mem120#1.offset, 4);call main_#t~mem123#1.base, main_#t~mem123#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem126#1 := read~int(main_#t~mem123#1.base, 12 + main_#t~mem123#1.offset, 4);call main_#t~mem124#1.base, main_#t~mem124#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem125#1 := read~int(main_#t~mem124#1.base, 4 + main_#t~mem124#1.offset, 4); {21835#false} is VALID [2022-02-20 23:33:11,042 INFO L290 TraceCheckUtils]: 101: Hoare triple {21835#false} assume 0 != (if 0 == main_#t~mem126#1 || 0 == 2 * main_#t~mem125#1 - 1 then 0 else (if 1 == 2 * main_#t~mem125#1 - 1 then (if 1 == main_#t~mem126#1 || 0 == main_#t~mem126#1 then main_#t~mem126#1 else (if main_#t~mem126#1 >= 0 then main_#t~mem126#1 % 2 else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1))) else (if 1 == main_#t~mem126#1 then (if 1 == 2 * main_#t~mem125#1 - 1 || 0 == 2 * main_#t~mem125#1 - 1 then 2 * main_#t~mem125#1 - 1 else (if 2 * main_#t~mem125#1 - 1 >= 0 then (2 * main_#t~mem125#1 - 1) % 2 else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1))) else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1)))) % 4294967296;main_#t~ite127#1 := 1; {21835#false} is VALID [2022-02-20 23:33:11,042 INFO L290 TraceCheckUtils]: 102: Hoare triple {21835#false} call write~int((if main_#t~mem122#1 < 0 && (31 == 1 + main_#t~mem121#1 || 63 == 1 + main_#t~mem121#1) then 1 else (if main_#t~mem122#1 >= 0 && (31 == 1 + main_#t~mem121#1 || 63 == 1 + main_#t~mem121#1) then 0 else ~shiftRight(main_#t~mem122#1, 1 + main_#t~mem121#1))) + main_#t~ite127#1, main_#t~mem118#1.base, 24 + main_#t~mem118#1.offset, 4);havoc main_#t~mem118#1.base, main_#t~mem118#1.offset;havoc main_#t~mem119#1.base, main_#t~mem119#1.offset;havoc main_#t~mem122#1;havoc main_#t~mem120#1.base, main_#t~mem120#1.offset;havoc main_#t~mem121#1;havoc main_#t~mem123#1.base, main_#t~mem123#1.offset;havoc main_#t~mem126#1;havoc main_#t~mem124#1.base, main_#t~mem124#1.offset;havoc main_#t~mem125#1;havoc main_#t~ite127#1;call main_#t~mem128#1.base, main_#t~mem128#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(0, main_#t~mem128#1.base, 28 + main_#t~mem128#1.offset, 4);havoc main_#t~mem128#1.base, main_#t~mem128#1.offset;main_~_he_bkt_i~0#1 := 0; {21835#false} is VALID [2022-02-20 23:33:11,043 INFO L290 TraceCheckUtils]: 103: Hoare triple {21835#false} call main_#t~mem130#1.base, main_#t~mem130#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem131#1 := read~int(main_#t~mem130#1.base, 4 + main_#t~mem130#1.offset, 4); {21835#false} is VALID [2022-02-20 23:33:11,043 INFO L290 TraceCheckUtils]: 104: Hoare triple {21835#false} assume !(main_~_he_bkt_i~0#1 % 4294967296 < main_#t~mem131#1 % 4294967296);havoc main_#t~mem130#1.base, main_#t~mem130#1.offset;havoc main_#t~mem131#1; {21835#false} is VALID [2022-02-20 23:33:11,043 INFO L290 TraceCheckUtils]: 105: Hoare triple {21835#false} call main_#t~mem156#1.base, main_#t~mem156#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem157#1.base, main_#t~mem157#1.offset := read~$Pointer$(main_#t~mem156#1.base, main_#t~mem156#1.offset, 4);call main_#t~mem158#1.base, main_#t~mem158#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem159#1 := read~int(main_#t~mem158#1.base, 4 + main_#t~mem158#1.offset, 4); {21835#false} is VALID [2022-02-20 23:33:11,043 INFO L272 TraceCheckUtils]: 106: Hoare triple {21835#false} call alt_free(main_#t~mem157#1.base, main_#t~mem157#1.offset, 12 * main_#t~mem159#1); {21835#false} is VALID [2022-02-20 23:33:11,043 INFO L290 TraceCheckUtils]: 107: Hoare triple {21835#false} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;~sz := #in~sz;#t~pre33 := ~alt_malloc_balance~0 - 1;~alt_malloc_balance~0 := ~alt_malloc_balance~0 - 1;call #t~mem34 := read~int(~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~pre33, 4);~expected~0 := #t~mem34;havoc #t~pre33;havoc #t~mem34; {21835#false} is VALID [2022-02-20 23:33:11,043 INFO L290 TraceCheckUtils]: 108: Hoare triple {21835#false} assume ~sz % 4294967296 != ~expected~0 % 4294967296; {21835#false} is VALID [2022-02-20 23:33:11,044 INFO L290 TraceCheckUtils]: 109: Hoare triple {21835#false} assume !false; {21835#false} is VALID [2022-02-20 23:33:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 23:33:11,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:33:11,044 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:11,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245072328] [2022-02-20 23:33:11,044 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:11,044 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919905343] [2022-02-20 23:33:11,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919905343] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:33:11,045 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:33:11,045 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:33:11,045 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064176577] [2022-02-20 23:33:11,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:33:11,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 110 [2022-02-20 23:33:11,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:11,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 23:33:11,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:11,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:33:11,121 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:11,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:33:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:33:11,122 INFO L87 Difference]: Start difference. First operand 577 states and 721 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 23:33:12,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:12,712 INFO L93 Difference]: Finished difference Result 1094 states and 1379 transitions. [2022-02-20 23:33:12,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:33:12,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 110 [2022-02-20 23:33:12,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 23:33:12,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 556 transitions. [2022-02-20 23:33:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 23:33:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 556 transitions. [2022-02-20 23:33:12,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 556 transitions. [2022-02-20 23:33:13,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 556 edges. 556 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:13,123 INFO L225 Difference]: With dead ends: 1094 [2022-02-20 23:33:13,123 INFO L226 Difference]: Without dead ends: 582 [2022-02-20 23:33:13,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:33:13,125 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 18 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:13,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 1792 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:33:13,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-02-20 23:33:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2022-02-20 23:33:13,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:13,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 582 states. Second operand has 582 states, 552 states have (on average 1.2590579710144927) internal successors, (695), 559 states have internal predecessors, (695), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:13,239 INFO L74 IsIncluded]: Start isIncluded. First operand 582 states. Second operand has 582 states, 552 states have (on average 1.2590579710144927) internal successors, (695), 559 states have internal predecessors, (695), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:13,240 INFO L87 Difference]: Start difference. First operand 582 states. Second operand has 582 states, 552 states have (on average 1.2590579710144927) internal successors, (695), 559 states have internal predecessors, (695), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:13,251 INFO L93 Difference]: Finished difference Result 582 states and 727 transitions. [2022-02-20 23:33:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 727 transitions. [2022-02-20 23:33:13,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:13,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:13,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 582 states, 552 states have (on average 1.2590579710144927) internal successors, (695), 559 states have internal predecessors, (695), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) Second operand 582 states. [2022-02-20 23:33:13,253 INFO L87 Difference]: Start difference. First operand has 582 states, 552 states have (on average 1.2590579710144927) internal successors, (695), 559 states have internal predecessors, (695), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) Second operand 582 states. [2022-02-20 23:33:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:13,265 INFO L93 Difference]: Finished difference Result 582 states and 727 transitions. [2022-02-20 23:33:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 727 transitions. [2022-02-20 23:33:13,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:13,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:13,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:13,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 552 states have (on average 1.2590579710144927) internal successors, (695), 559 states have internal predecessors, (695), 16 states have call successors, (16), 9 states have call predecessors, (16), 10 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 727 transitions. [2022-02-20 23:33:13,279 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 727 transitions. Word has length 110 [2022-02-20 23:33:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:13,280 INFO L470 AbstractCegarLoop]: Abstraction has 582 states and 727 transitions. [2022-02-20 23:33:13,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-20 23:33:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 727 transitions. [2022-02-20 23:33:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-02-20 23:33:13,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:13,281 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:13,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:33:13,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:13,489 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 23:33:13,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:13,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1710945854, now seen corresponding path program 1 times [2022-02-20 23:33:13,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:13,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850885288] [2022-02-20 23:33:13,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:13,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:13,529 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:13,530 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874574268] [2022-02-20 23:33:13,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:13,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:13,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:13,531 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:33:13,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 23:33:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:14,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:33:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:14,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:14,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {25324#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {25324#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {25324#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {25324#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {25324#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {25324#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {25324#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {25324#true} havoc main_~_ha_hashv~0#1; {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {25324#true} goto; {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {25324#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {25324#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {25324#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {25324#true} assume !main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {25324#true} assume !main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:14,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {25324#true} assume !main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {25324#true} assume !main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {25324#true} assume !main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {25324#true} assume !main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {25324#true} assume !main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {25324#true} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {25324#true} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {25324#true} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:14,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {25324#true} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {25324#true} is VALID [2022-02-20 23:33:14,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {25324#true} havoc main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:14,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {25324#true} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {25324#true} is VALID [2022-02-20 23:33:14,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {25324#true} goto; {25324#true} is VALID [2022-02-20 23:33:14,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {25324#true} goto; {25324#true} is VALID [2022-02-20 23:33:14,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {25324#true} goto; {25324#true} is VALID [2022-02-20 23:33:14,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {25324#true} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {25324#true} is VALID [2022-02-20 23:33:14,789 INFO L290 TraceCheckUtils]: 39: Hoare triple {25324#true} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {25324#true} is VALID [2022-02-20 23:33:14,789 INFO L272 TraceCheckUtils]: 40: Hoare triple {25324#true} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {25324#true} is VALID [2022-02-20 23:33:14,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {25324#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {25452#(= |alt_malloc_#in~sz| alt_malloc_~sz)} is VALID [2022-02-20 23:33:14,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {25452#(= |alt_malloc_#in~sz| alt_malloc_~sz)} assume 1 == ~alt_malloc_balance~0; {25452#(= |alt_malloc_#in~sz| alt_malloc_~sz)} is VALID [2022-02-20 23:33:14,793 INFO L272 TraceCheckUtils]: 43: Hoare triple {25452#(= |alt_malloc_#in~sz| alt_malloc_~sz)} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {25324#true} is VALID [2022-02-20 23:33:14,793 INFO L290 TraceCheckUtils]: 44: Hoare triple {25324#true} ~cond := #in~cond; {25462#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 23:33:14,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {25462#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25466#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 23:33:14,794 INFO L290 TraceCheckUtils]: 46: Hoare triple {25466#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25466#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 23:33:14,794 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25466#(not (= |__VERIFIER_assert_#in~cond| 0))} {25452#(= |alt_malloc_#in~sz| alt_malloc_~sz)} #833#return; {25473#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-20 23:33:14,794 INFO L290 TraceCheckUtils]: 48: Hoare triple {25473#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {25473#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-20 23:33:14,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {25473#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} assume true; {25473#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-20 23:33:14,795 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25473#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} {25324#true} #835#return; {25324#true} is VALID [2022-02-20 23:33:14,795 INFO L290 TraceCheckUtils]: 51: Hoare triple {25324#true} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {25324#true} is VALID [2022-02-20 23:33:14,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {25324#true} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {25324#true} is VALID [2022-02-20 23:33:14,795 INFO L272 TraceCheckUtils]: 53: Hoare triple {25324#true} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {25324#true} is VALID [2022-02-20 23:33:14,795 INFO L290 TraceCheckUtils]: 54: Hoare triple {25324#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {25495#(and (= |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 0) (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:33:14,796 INFO L290 TraceCheckUtils]: 55: Hoare triple {25495#(and (= |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 0) (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {25499#(and (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|) (= |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 1))} is VALID [2022-02-20 23:33:14,796 INFO L290 TraceCheckUtils]: 56: Hoare triple {25499#(and (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|) (= |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 1))} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {25503#(not (< 1 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-20 23:33:14,797 INFO L290 TraceCheckUtils]: 57: Hoare triple {25503#(not (< 1 (mod |alt_bzero_#in~n#1| 4294967296)))} 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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {25503#(not (< 1 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-20 23:33:14,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {25503#(not (< 1 (mod |alt_bzero_#in~n#1| 4294967296)))} assume true; {25503#(not (< 1 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-20 23:33:14,797 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25503#(not (< 1 (mod |alt_bzero_#in~n#1| 4294967296)))} {25324#true} #837#return; {25325#false} is VALID [2022-02-20 23:33:14,797 INFO L290 TraceCheckUtils]: 60: Hoare triple {25325#false} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L272 TraceCheckUtils]: 61: Hoare triple {25325#false} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L290 TraceCheckUtils]: 62: Hoare triple {25325#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L290 TraceCheckUtils]: 63: Hoare triple {25325#false} assume !(1 == ~alt_malloc_balance~0); {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L290 TraceCheckUtils]: 64: Hoare triple {25325#false} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L290 TraceCheckUtils]: 65: Hoare triple {25325#false} assume true; {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {25325#false} {25325#false} #839#return; {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L290 TraceCheckUtils]: 67: Hoare triple {25325#false} call write~$Pointer$(main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, 4);havoc main_#t~mem78#1.base, main_#t~mem78#1.offset;havoc main_#t~ret79#1.base, main_#t~ret79#1.offset;call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem80#1.base, 40 + main_#t~mem80#1.offset, 4);havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$(main_#t~mem81#1.base, main_#t~mem81#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L290 TraceCheckUtils]: 68: Hoare triple {25325#false} assume !(main_#t~mem82#1.base == 0 && main_#t~mem82#1.offset == 0);havoc main_#t~mem81#1.base, main_#t~mem81#1.offset;havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(main_#t~mem84#1.base, main_#t~mem84#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L272 TraceCheckUtils]: 69: Hoare triple {25325#false} call alt_bzero(main_#t~mem85#1.base, main_#t~mem85#1.offset, 384); {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L290 TraceCheckUtils]: 70: Hoare triple {25325#false} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L290 TraceCheckUtils]: 71: Hoare triple {25325#false} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L290 TraceCheckUtils]: 72: Hoare triple {25325#false} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L290 TraceCheckUtils]: 73: Hoare triple {25325#false} 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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L290 TraceCheckUtils]: 74: Hoare triple {25325#false} assume true; {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {25325#false} {25325#false} #843#return; {25325#false} is VALID [2022-02-20 23:33:14,798 INFO L290 TraceCheckUtils]: 76: Hoare triple {25325#false} havoc main_#t~mem84#1.base, main_#t~mem84#1.offset;havoc main_#t~mem85#1.base, main_#t~mem85#1.offset; {25325#false} is VALID [2022-02-20 23:33:14,799 INFO L290 TraceCheckUtils]: 77: Hoare triple {25325#false} goto; {25325#false} is VALID [2022-02-20 23:33:14,799 INFO L290 TraceCheckUtils]: 78: Hoare triple {25325#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {25325#false} is VALID [2022-02-20 23:33:14,799 INFO L290 TraceCheckUtils]: 79: Hoare triple {25325#false} havoc main_~_ha_bkt~0#1;call main_#t~mem94#1.base, main_#t~mem94#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem95#1 := read~int(main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);main_#t~post96#1 := main_#t~mem95#1;call write~int(1 + main_#t~post96#1, main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);havoc main_#t~mem94#1.base, main_#t~mem94#1.offset;havoc main_#t~mem95#1;havoc main_#t~post96#1; {25325#false} is VALID [2022-02-20 23:33:14,799 INFO L290 TraceCheckUtils]: 80: Hoare triple {25325#false} call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem98#1 := read~int(main_#t~mem97#1.base, 4 + main_#t~mem97#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem98#1 - 1 then 0 else (if 1 == main_#t~mem98#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem98#1 - 1 || 0 == main_#t~mem98#1 - 1 then main_#t~mem98#1 - 1 else (if main_#t~mem98#1 - 1 >= 0 then (main_#t~mem98#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1; {25325#false} is VALID [2022-02-20 23:33:14,799 INFO L290 TraceCheckUtils]: 81: Hoare triple {25325#false} goto; {25325#false} is VALID [2022-02-20 23:33:14,799 INFO L290 TraceCheckUtils]: 82: Hoare triple {25325#false} call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem100#1.base, main_#t~mem100#1.offset := read~$Pointer$(main_#t~mem99#1.base, main_#t~mem99#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem100#1.base, main_#t~mem100#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem99#1.base, main_#t~mem99#1.offset;havoc main_#t~mem100#1.base, main_#t~mem100#1.offset;call main_#t~mem101#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post102#1 := main_#t~mem101#1;call write~int(1 + main_#t~post102#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem101#1;havoc main_#t~post102#1;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem103#1.base, main_#t~mem103#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:14,799 INFO L290 TraceCheckUtils]: 83: Hoare triple {25325#false} assume main_#t~mem104#1.base != 0 || main_#t~mem104#1.offset != 0;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem105#1.base, 12 + main_#t~mem105#1.offset, 4);havoc main_#t~mem105#1.base, main_#t~mem105#1.offset; {25325#false} is VALID [2022-02-20 23:33:14,799 INFO L290 TraceCheckUtils]: 84: Hoare triple {25325#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem107#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem106#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short110#1 := main_#t~mem107#1 % 4294967296 >= 10 * (1 + main_#t~mem106#1) % 4294967296; {25325#false} is VALID [2022-02-20 23:33:14,799 INFO L290 TraceCheckUtils]: 85: Hoare triple {25325#false} assume main_#t~short110#1;call main_#t~mem108#1.base, main_#t~mem108#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem109#1 := read~int(main_#t~mem108#1.base, 36 + main_#t~mem108#1.offset, 4);main_#t~short110#1 := 0 == main_#t~mem109#1 % 4294967296; {25325#false} is VALID [2022-02-20 23:33:14,799 INFO L290 TraceCheckUtils]: 86: Hoare triple {25325#false} assume main_#t~short110#1;havoc main_#t~mem107#1;havoc main_#t~mem106#1;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;havoc main_#t~mem109#1;havoc main_#t~short110#1; {25325#false} is VALID [2022-02-20 23:33:14,799 INFO L290 TraceCheckUtils]: 87: Hoare triple {25325#false} havoc main_~_he_bkt~0#1;havoc main_~_he_bkt_i~0#1;havoc main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset;havoc main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset;call main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset;call main_#t~mem111#1.base, main_#t~mem111#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem112#1 := read~int(main_#t~mem111#1.base, 4 + main_#t~mem111#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:14,800 INFO L272 TraceCheckUtils]: 88: Hoare triple {25325#false} call main_#t~ret113#1.base, main_#t~ret113#1.offset := alt_malloc(24 * main_#t~mem112#1); {25325#false} is VALID [2022-02-20 23:33:14,800 INFO L290 TraceCheckUtils]: 89: Hoare triple {25325#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {25325#false} is VALID [2022-02-20 23:33:14,800 INFO L290 TraceCheckUtils]: 90: Hoare triple {25325#false} assume !(1 == ~alt_malloc_balance~0); {25325#false} is VALID [2022-02-20 23:33:14,800 INFO L290 TraceCheckUtils]: 91: Hoare triple {25325#false} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {25325#false} is VALID [2022-02-20 23:33:14,800 INFO L290 TraceCheckUtils]: 92: Hoare triple {25325#false} assume true; {25325#false} is VALID [2022-02-20 23:33:14,800 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {25325#false} {25325#false} #845#return; {25325#false} is VALID [2022-02-20 23:33:14,800 INFO L290 TraceCheckUtils]: 94: Hoare triple {25325#false} call write~$Pointer$(main_#t~ret113#1.base, main_#t~ret113#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4);havoc main_#t~mem111#1.base, main_#t~mem111#1.offset;havoc main_#t~mem112#1;havoc main_#t~ret113#1.base, main_#t~ret113#1.offset;call main_#t~mem114#1.base, main_#t~mem114#1.offset := read~$Pointer$(main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:14,800 INFO L290 TraceCheckUtils]: 95: Hoare triple {25325#false} assume !(main_#t~mem114#1.base == 0 && main_#t~mem114#1.offset == 0);havoc main_#t~mem114#1.base, main_#t~mem114#1.offset;call main_#t~mem115#1.base, main_#t~mem115#1.offset := read~$Pointer$(main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4);call main_#t~mem116#1.base, main_#t~mem116#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem117#1 := read~int(main_#t~mem116#1.base, 4 + main_#t~mem116#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:14,801 INFO L272 TraceCheckUtils]: 96: Hoare triple {25325#false} call alt_bzero(main_#t~mem115#1.base, main_#t~mem115#1.offset, 24 * main_#t~mem117#1); {25325#false} is VALID [2022-02-20 23:33:14,801 INFO L290 TraceCheckUtils]: 97: Hoare triple {25325#false} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {25325#false} is VALID [2022-02-20 23:33:14,801 INFO L290 TraceCheckUtils]: 98: Hoare triple {25325#false} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {25325#false} is VALID [2022-02-20 23:33:14,801 INFO L290 TraceCheckUtils]: 99: Hoare triple {25325#false} 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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {25325#false} is VALID [2022-02-20 23:33:14,801 INFO L290 TraceCheckUtils]: 100: Hoare triple {25325#false} assume true; {25325#false} is VALID [2022-02-20 23:33:14,801 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {25325#false} {25325#false} #847#return; {25325#false} is VALID [2022-02-20 23:33:14,801 INFO L290 TraceCheckUtils]: 102: Hoare triple {25325#false} havoc main_#t~mem115#1.base, main_#t~mem115#1.offset;havoc main_#t~mem116#1.base, main_#t~mem116#1.offset;havoc main_#t~mem117#1;call main_#t~mem118#1.base, main_#t~mem118#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem119#1.base, main_#t~mem119#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem122#1 := read~int(main_#t~mem119#1.base, 12 + main_#t~mem119#1.offset, 4);call main_#t~mem120#1.base, main_#t~mem120#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem121#1 := read~int(main_#t~mem120#1.base, 8 + main_#t~mem120#1.offset, 4);call main_#t~mem123#1.base, main_#t~mem123#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem126#1 := read~int(main_#t~mem123#1.base, 12 + main_#t~mem123#1.offset, 4);call main_#t~mem124#1.base, main_#t~mem124#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem125#1 := read~int(main_#t~mem124#1.base, 4 + main_#t~mem124#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:14,801 INFO L290 TraceCheckUtils]: 103: Hoare triple {25325#false} assume 0 != (if 0 == main_#t~mem126#1 || 0 == 2 * main_#t~mem125#1 - 1 then 0 else (if 1 == 2 * main_#t~mem125#1 - 1 then (if 1 == main_#t~mem126#1 || 0 == main_#t~mem126#1 then main_#t~mem126#1 else (if main_#t~mem126#1 >= 0 then main_#t~mem126#1 % 2 else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1))) else (if 1 == main_#t~mem126#1 then (if 1 == 2 * main_#t~mem125#1 - 1 || 0 == 2 * main_#t~mem125#1 - 1 then 2 * main_#t~mem125#1 - 1 else (if 2 * main_#t~mem125#1 - 1 >= 0 then (2 * main_#t~mem125#1 - 1) % 2 else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1))) else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1)))) % 4294967296;main_#t~ite127#1 := 1; {25325#false} is VALID [2022-02-20 23:33:14,802 INFO L290 TraceCheckUtils]: 104: Hoare triple {25325#false} call write~int((if main_#t~mem122#1 < 0 && (31 == 1 + main_#t~mem121#1 || 63 == 1 + main_#t~mem121#1) then 1 else (if main_#t~mem122#1 >= 0 && (31 == 1 + main_#t~mem121#1 || 63 == 1 + main_#t~mem121#1) then 0 else ~shiftRight(main_#t~mem122#1, 1 + main_#t~mem121#1))) + main_#t~ite127#1, main_#t~mem118#1.base, 24 + main_#t~mem118#1.offset, 4);havoc main_#t~mem118#1.base, main_#t~mem118#1.offset;havoc main_#t~mem119#1.base, main_#t~mem119#1.offset;havoc main_#t~mem122#1;havoc main_#t~mem120#1.base, main_#t~mem120#1.offset;havoc main_#t~mem121#1;havoc main_#t~mem123#1.base, main_#t~mem123#1.offset;havoc main_#t~mem126#1;havoc main_#t~mem124#1.base, main_#t~mem124#1.offset;havoc main_#t~mem125#1;havoc main_#t~ite127#1;call main_#t~mem128#1.base, main_#t~mem128#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(0, main_#t~mem128#1.base, 28 + main_#t~mem128#1.offset, 4);havoc main_#t~mem128#1.base, main_#t~mem128#1.offset;main_~_he_bkt_i~0#1 := 0; {25325#false} is VALID [2022-02-20 23:33:14,802 INFO L290 TraceCheckUtils]: 105: Hoare triple {25325#false} call main_#t~mem130#1.base, main_#t~mem130#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem131#1 := read~int(main_#t~mem130#1.base, 4 + main_#t~mem130#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:14,802 INFO L290 TraceCheckUtils]: 106: Hoare triple {25325#false} assume !(main_~_he_bkt_i~0#1 % 4294967296 < main_#t~mem131#1 % 4294967296);havoc main_#t~mem130#1.base, main_#t~mem130#1.offset;havoc main_#t~mem131#1; {25325#false} is VALID [2022-02-20 23:33:14,802 INFO L290 TraceCheckUtils]: 107: Hoare triple {25325#false} call main_#t~mem156#1.base, main_#t~mem156#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem157#1.base, main_#t~mem157#1.offset := read~$Pointer$(main_#t~mem156#1.base, main_#t~mem156#1.offset, 4);call main_#t~mem158#1.base, main_#t~mem158#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem159#1 := read~int(main_#t~mem158#1.base, 4 + main_#t~mem158#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:14,802 INFO L272 TraceCheckUtils]: 108: Hoare triple {25325#false} call alt_free(main_#t~mem157#1.base, main_#t~mem157#1.offset, 12 * main_#t~mem159#1); {25325#false} is VALID [2022-02-20 23:33:14,802 INFO L290 TraceCheckUtils]: 109: Hoare triple {25325#false} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;~sz := #in~sz;#t~pre33 := ~alt_malloc_balance~0 - 1;~alt_malloc_balance~0 := ~alt_malloc_balance~0 - 1;call #t~mem34 := read~int(~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~pre33, 4);~expected~0 := #t~mem34;havoc #t~pre33;havoc #t~mem34; {25325#false} is VALID [2022-02-20 23:33:14,802 INFO L290 TraceCheckUtils]: 110: Hoare triple {25325#false} assume ~sz % 4294967296 != ~expected~0 % 4294967296; {25325#false} is VALID [2022-02-20 23:33:14,802 INFO L290 TraceCheckUtils]: 111: Hoare triple {25325#false} assume !false; {25325#false} is VALID [2022-02-20 23:33:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 23:33:14,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:33:15,448 INFO L290 TraceCheckUtils]: 111: Hoare triple {25325#false} assume !false; {25325#false} is VALID [2022-02-20 23:33:15,448 INFO L290 TraceCheckUtils]: 110: Hoare triple {25325#false} assume ~sz % 4294967296 != ~expected~0 % 4294967296; {25325#false} is VALID [2022-02-20 23:33:15,449 INFO L290 TraceCheckUtils]: 109: Hoare triple {25325#false} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;~sz := #in~sz;#t~pre33 := ~alt_malloc_balance~0 - 1;~alt_malloc_balance~0 := ~alt_malloc_balance~0 - 1;call #t~mem34 := read~int(~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~pre33, 4);~expected~0 := #t~mem34;havoc #t~pre33;havoc #t~mem34; {25325#false} is VALID [2022-02-20 23:33:15,449 INFO L272 TraceCheckUtils]: 108: Hoare triple {25325#false} call alt_free(main_#t~mem157#1.base, main_#t~mem157#1.offset, 12 * main_#t~mem159#1); {25325#false} is VALID [2022-02-20 23:33:15,449 INFO L290 TraceCheckUtils]: 107: Hoare triple {25325#false} call main_#t~mem156#1.base, main_#t~mem156#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem157#1.base, main_#t~mem157#1.offset := read~$Pointer$(main_#t~mem156#1.base, main_#t~mem156#1.offset, 4);call main_#t~mem158#1.base, main_#t~mem158#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem159#1 := read~int(main_#t~mem158#1.base, 4 + main_#t~mem158#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:15,449 INFO L290 TraceCheckUtils]: 106: Hoare triple {25325#false} assume !(main_~_he_bkt_i~0#1 % 4294967296 < main_#t~mem131#1 % 4294967296);havoc main_#t~mem130#1.base, main_#t~mem130#1.offset;havoc main_#t~mem131#1; {25325#false} is VALID [2022-02-20 23:33:15,449 INFO L290 TraceCheckUtils]: 105: Hoare triple {25325#false} call main_#t~mem130#1.base, main_#t~mem130#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem131#1 := read~int(main_#t~mem130#1.base, 4 + main_#t~mem130#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:15,449 INFO L290 TraceCheckUtils]: 104: Hoare triple {25325#false} call write~int((if main_#t~mem122#1 < 0 && (31 == 1 + main_#t~mem121#1 || 63 == 1 + main_#t~mem121#1) then 1 else (if main_#t~mem122#1 >= 0 && (31 == 1 + main_#t~mem121#1 || 63 == 1 + main_#t~mem121#1) then 0 else ~shiftRight(main_#t~mem122#1, 1 + main_#t~mem121#1))) + main_#t~ite127#1, main_#t~mem118#1.base, 24 + main_#t~mem118#1.offset, 4);havoc main_#t~mem118#1.base, main_#t~mem118#1.offset;havoc main_#t~mem119#1.base, main_#t~mem119#1.offset;havoc main_#t~mem122#1;havoc main_#t~mem120#1.base, main_#t~mem120#1.offset;havoc main_#t~mem121#1;havoc main_#t~mem123#1.base, main_#t~mem123#1.offset;havoc main_#t~mem126#1;havoc main_#t~mem124#1.base, main_#t~mem124#1.offset;havoc main_#t~mem125#1;havoc main_#t~ite127#1;call main_#t~mem128#1.base, main_#t~mem128#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(0, main_#t~mem128#1.base, 28 + main_#t~mem128#1.offset, 4);havoc main_#t~mem128#1.base, main_#t~mem128#1.offset;main_~_he_bkt_i~0#1 := 0; {25325#false} is VALID [2022-02-20 23:33:15,449 INFO L290 TraceCheckUtils]: 103: Hoare triple {25325#false} assume 0 != (if 0 == main_#t~mem126#1 || 0 == 2 * main_#t~mem125#1 - 1 then 0 else (if 1 == 2 * main_#t~mem125#1 - 1 then (if 1 == main_#t~mem126#1 || 0 == main_#t~mem126#1 then main_#t~mem126#1 else (if main_#t~mem126#1 >= 0 then main_#t~mem126#1 % 2 else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1))) else (if 1 == main_#t~mem126#1 then (if 1 == 2 * main_#t~mem125#1 - 1 || 0 == 2 * main_#t~mem125#1 - 1 then 2 * main_#t~mem125#1 - 1 else (if 2 * main_#t~mem125#1 - 1 >= 0 then (2 * main_#t~mem125#1 - 1) % 2 else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1))) else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1)))) % 4294967296;main_#t~ite127#1 := 1; {25325#false} is VALID [2022-02-20 23:33:15,449 INFO L290 TraceCheckUtils]: 102: Hoare triple {25325#false} havoc main_#t~mem115#1.base, main_#t~mem115#1.offset;havoc main_#t~mem116#1.base, main_#t~mem116#1.offset;havoc main_#t~mem117#1;call main_#t~mem118#1.base, main_#t~mem118#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem119#1.base, main_#t~mem119#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem122#1 := read~int(main_#t~mem119#1.base, 12 + main_#t~mem119#1.offset, 4);call main_#t~mem120#1.base, main_#t~mem120#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem121#1 := read~int(main_#t~mem120#1.base, 8 + main_#t~mem120#1.offset, 4);call main_#t~mem123#1.base, main_#t~mem123#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem126#1 := read~int(main_#t~mem123#1.base, 12 + main_#t~mem123#1.offset, 4);call main_#t~mem124#1.base, main_#t~mem124#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem125#1 := read~int(main_#t~mem124#1.base, 4 + main_#t~mem124#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:15,450 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {25324#true} {25325#false} #847#return; {25325#false} is VALID [2022-02-20 23:33:15,450 INFO L290 TraceCheckUtils]: 100: Hoare triple {25324#true} assume true; {25324#true} is VALID [2022-02-20 23:33:15,450 INFO L290 TraceCheckUtils]: 99: Hoare triple {25324#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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {25324#true} is VALID [2022-02-20 23:33:15,450 INFO L290 TraceCheckUtils]: 98: Hoare triple {25324#true} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {25324#true} is VALID [2022-02-20 23:33:15,450 INFO L290 TraceCheckUtils]: 97: Hoare triple {25324#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {25324#true} is VALID [2022-02-20 23:33:15,450 INFO L272 TraceCheckUtils]: 96: Hoare triple {25325#false} call alt_bzero(main_#t~mem115#1.base, main_#t~mem115#1.offset, 24 * main_#t~mem117#1); {25324#true} is VALID [2022-02-20 23:33:15,450 INFO L290 TraceCheckUtils]: 95: Hoare triple {25325#false} assume !(main_#t~mem114#1.base == 0 && main_#t~mem114#1.offset == 0);havoc main_#t~mem114#1.base, main_#t~mem114#1.offset;call main_#t~mem115#1.base, main_#t~mem115#1.offset := read~$Pointer$(main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4);call main_#t~mem116#1.base, main_#t~mem116#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem117#1 := read~int(main_#t~mem116#1.base, 4 + main_#t~mem116#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:15,450 INFO L290 TraceCheckUtils]: 94: Hoare triple {25325#false} call write~$Pointer$(main_#t~ret113#1.base, main_#t~ret113#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4);havoc main_#t~mem111#1.base, main_#t~mem111#1.offset;havoc main_#t~mem112#1;havoc main_#t~ret113#1.base, main_#t~ret113#1.offset;call main_#t~mem114#1.base, main_#t~mem114#1.offset := read~$Pointer$(main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:15,451 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {25324#true} {25325#false} #845#return; {25325#false} is VALID [2022-02-20 23:33:15,451 INFO L290 TraceCheckUtils]: 92: Hoare triple {25324#true} assume true; {25324#true} is VALID [2022-02-20 23:33:15,451 INFO L290 TraceCheckUtils]: 91: Hoare triple {25324#true} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {25324#true} is VALID [2022-02-20 23:33:15,451 INFO L290 TraceCheckUtils]: 90: Hoare triple {25324#true} assume !(1 == ~alt_malloc_balance~0); {25324#true} is VALID [2022-02-20 23:33:15,451 INFO L290 TraceCheckUtils]: 89: Hoare triple {25324#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {25324#true} is VALID [2022-02-20 23:33:15,451 INFO L272 TraceCheckUtils]: 88: Hoare triple {25325#false} call main_#t~ret113#1.base, main_#t~ret113#1.offset := alt_malloc(24 * main_#t~mem112#1); {25324#true} is VALID [2022-02-20 23:33:15,451 INFO L290 TraceCheckUtils]: 87: Hoare triple {25325#false} havoc main_~_he_bkt~0#1;havoc main_~_he_bkt_i~0#1;havoc main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset;havoc main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset;call main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset;call main_#t~mem111#1.base, main_#t~mem111#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem112#1 := read~int(main_#t~mem111#1.base, 4 + main_#t~mem111#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:15,451 INFO L290 TraceCheckUtils]: 86: Hoare triple {25325#false} assume main_#t~short110#1;havoc main_#t~mem107#1;havoc main_#t~mem106#1;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;havoc main_#t~mem109#1;havoc main_#t~short110#1; {25325#false} is VALID [2022-02-20 23:33:15,452 INFO L290 TraceCheckUtils]: 85: Hoare triple {25325#false} assume main_#t~short110#1;call main_#t~mem108#1.base, main_#t~mem108#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem109#1 := read~int(main_#t~mem108#1.base, 36 + main_#t~mem108#1.offset, 4);main_#t~short110#1 := 0 == main_#t~mem109#1 % 4294967296; {25325#false} is VALID [2022-02-20 23:33:15,452 INFO L290 TraceCheckUtils]: 84: Hoare triple {25325#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem107#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem106#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short110#1 := main_#t~mem107#1 % 4294967296 >= 10 * (1 + main_#t~mem106#1) % 4294967296; {25325#false} is VALID [2022-02-20 23:33:15,452 INFO L290 TraceCheckUtils]: 83: Hoare triple {25325#false} assume main_#t~mem104#1.base != 0 || main_#t~mem104#1.offset != 0;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem105#1.base, 12 + main_#t~mem105#1.offset, 4);havoc main_#t~mem105#1.base, main_#t~mem105#1.offset; {25325#false} is VALID [2022-02-20 23:33:15,452 INFO L290 TraceCheckUtils]: 82: Hoare triple {25325#false} call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem100#1.base, main_#t~mem100#1.offset := read~$Pointer$(main_#t~mem99#1.base, main_#t~mem99#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem100#1.base, main_#t~mem100#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem99#1.base, main_#t~mem99#1.offset;havoc main_#t~mem100#1.base, main_#t~mem100#1.offset;call main_#t~mem101#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post102#1 := main_#t~mem101#1;call write~int(1 + main_#t~post102#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem101#1;havoc main_#t~post102#1;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem103#1.base, main_#t~mem103#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:15,452 INFO L290 TraceCheckUtils]: 81: Hoare triple {25325#false} goto; {25325#false} is VALID [2022-02-20 23:33:15,452 INFO L290 TraceCheckUtils]: 80: Hoare triple {25325#false} call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem98#1 := read~int(main_#t~mem97#1.base, 4 + main_#t~mem97#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem98#1 - 1 then 0 else (if 1 == main_#t~mem98#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem98#1 - 1 || 0 == main_#t~mem98#1 - 1 then main_#t~mem98#1 - 1 else (if main_#t~mem98#1 - 1 >= 0 then (main_#t~mem98#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1; {25325#false} is VALID [2022-02-20 23:33:15,452 INFO L290 TraceCheckUtils]: 79: Hoare triple {25325#false} havoc main_~_ha_bkt~0#1;call main_#t~mem94#1.base, main_#t~mem94#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem95#1 := read~int(main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);main_#t~post96#1 := main_#t~mem95#1;call write~int(1 + main_#t~post96#1, main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);havoc main_#t~mem94#1.base, main_#t~mem94#1.offset;havoc main_#t~mem95#1;havoc main_#t~post96#1; {25325#false} is VALID [2022-02-20 23:33:15,452 INFO L290 TraceCheckUtils]: 78: Hoare triple {25325#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {25325#false} is VALID [2022-02-20 23:33:15,452 INFO L290 TraceCheckUtils]: 77: Hoare triple {25325#false} goto; {25325#false} is VALID [2022-02-20 23:33:15,453 INFO L290 TraceCheckUtils]: 76: Hoare triple {25325#false} havoc main_#t~mem84#1.base, main_#t~mem84#1.offset;havoc main_#t~mem85#1.base, main_#t~mem85#1.offset; {25325#false} is VALID [2022-02-20 23:33:15,453 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {25324#true} {25325#false} #843#return; {25325#false} is VALID [2022-02-20 23:33:15,453 INFO L290 TraceCheckUtils]: 74: Hoare triple {25324#true} assume true; {25324#true} is VALID [2022-02-20 23:33:15,453 INFO L290 TraceCheckUtils]: 73: Hoare triple {25324#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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {25324#true} is VALID [2022-02-20 23:33:15,453 INFO L290 TraceCheckUtils]: 72: Hoare triple {25324#true} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {25324#true} is VALID [2022-02-20 23:33:15,453 INFO L290 TraceCheckUtils]: 71: Hoare triple {25324#true} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {25324#true} is VALID [2022-02-20 23:33:15,453 INFO L290 TraceCheckUtils]: 70: Hoare triple {25324#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {25324#true} is VALID [2022-02-20 23:33:15,453 INFO L272 TraceCheckUtils]: 69: Hoare triple {25325#false} call alt_bzero(main_#t~mem85#1.base, main_#t~mem85#1.offset, 384); {25324#true} is VALID [2022-02-20 23:33:15,454 INFO L290 TraceCheckUtils]: 68: Hoare triple {25325#false} assume !(main_#t~mem82#1.base == 0 && main_#t~mem82#1.offset == 0);havoc main_#t~mem81#1.base, main_#t~mem81#1.offset;havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(main_#t~mem84#1.base, main_#t~mem84#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:15,454 INFO L290 TraceCheckUtils]: 67: Hoare triple {25325#false} call write~$Pointer$(main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, 4);havoc main_#t~mem78#1.base, main_#t~mem78#1.offset;havoc main_#t~ret79#1.base, main_#t~ret79#1.offset;call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem80#1.base, 40 + main_#t~mem80#1.offset, 4);havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$(main_#t~mem81#1.base, main_#t~mem81#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:15,454 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {25324#true} {25325#false} #839#return; {25325#false} is VALID [2022-02-20 23:33:15,454 INFO L290 TraceCheckUtils]: 65: Hoare triple {25324#true} assume true; {25324#true} is VALID [2022-02-20 23:33:15,454 INFO L290 TraceCheckUtils]: 64: Hoare triple {25324#true} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {25324#true} is VALID [2022-02-20 23:33:15,454 INFO L290 TraceCheckUtils]: 63: Hoare triple {25324#true} assume !(1 == ~alt_malloc_balance~0); {25324#true} is VALID [2022-02-20 23:33:15,454 INFO L290 TraceCheckUtils]: 62: Hoare triple {25324#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {25324#true} is VALID [2022-02-20 23:33:15,454 INFO L272 TraceCheckUtils]: 61: Hoare triple {25325#false} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {25324#true} is VALID [2022-02-20 23:33:15,455 INFO L290 TraceCheckUtils]: 60: Hoare triple {25325#false} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {25325#false} is VALID [2022-02-20 23:33:15,455 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25828#(not (= |alt_bzero_#in~n#1| 44))} {25324#true} #837#return; {25325#false} is VALID [2022-02-20 23:33:15,456 INFO L290 TraceCheckUtils]: 58: Hoare triple {25828#(not (= |alt_bzero_#in~n#1| 44))} assume true; {25828#(not (= |alt_bzero_#in~n#1| 44))} is VALID [2022-02-20 23:33:15,456 INFO L290 TraceCheckUtils]: 57: Hoare triple {25828#(not (= |alt_bzero_#in~n#1| 44))} 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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {25828#(not (= |alt_bzero_#in~n#1| 44))} is VALID [2022-02-20 23:33:15,457 INFO L290 TraceCheckUtils]: 56: Hoare triple {25838#(or (< (mod |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {25828#(not (= |alt_bzero_#in~n#1| 44))} is VALID [2022-02-20 23:33:15,458 INFO L290 TraceCheckUtils]: 55: Hoare triple {25842#(or (< (mod (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 1) 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {25838#(or (< (mod |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} is VALID [2022-02-20 23:33:15,458 INFO L290 TraceCheckUtils]: 54: Hoare triple {25324#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {25842#(or (< (mod (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 1) 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} is VALID [2022-02-20 23:33:15,458 INFO L272 TraceCheckUtils]: 53: Hoare triple {25324#true} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {25324#true} is VALID [2022-02-20 23:33:15,459 INFO L290 TraceCheckUtils]: 52: Hoare triple {25324#true} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {25324#true} is VALID [2022-02-20 23:33:15,459 INFO L290 TraceCheckUtils]: 51: Hoare triple {25324#true} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {25324#true} is VALID [2022-02-20 23:33:15,459 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {25324#true} {25324#true} #835#return; {25324#true} is VALID [2022-02-20 23:33:15,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {25324#true} assume true; {25324#true} is VALID [2022-02-20 23:33:15,459 INFO L290 TraceCheckUtils]: 48: Hoare triple {25324#true} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {25324#true} is VALID [2022-02-20 23:33:15,459 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {25324#true} {25324#true} #833#return; {25324#true} is VALID [2022-02-20 23:33:15,459 INFO L290 TraceCheckUtils]: 46: Hoare triple {25324#true} assume true; {25324#true} is VALID [2022-02-20 23:33:15,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {25324#true} assume !(0 == ~cond); {25324#true} is VALID [2022-02-20 23:33:15,460 INFO L290 TraceCheckUtils]: 44: Hoare triple {25324#true} ~cond := #in~cond; {25324#true} is VALID [2022-02-20 23:33:15,460 INFO L272 TraceCheckUtils]: 43: Hoare triple {25324#true} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {25324#true} is VALID [2022-02-20 23:33:15,460 INFO L290 TraceCheckUtils]: 42: Hoare triple {25324#true} assume 1 == ~alt_malloc_balance~0; {25324#true} is VALID [2022-02-20 23:33:15,460 INFO L290 TraceCheckUtils]: 41: Hoare triple {25324#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {25324#true} is VALID [2022-02-20 23:33:15,460 INFO L272 TraceCheckUtils]: 40: Hoare triple {25324#true} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {25324#true} is VALID [2022-02-20 23:33:15,460 INFO L290 TraceCheckUtils]: 39: Hoare triple {25324#true} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {25324#true} is VALID [2022-02-20 23:33:15,460 INFO L290 TraceCheckUtils]: 38: Hoare triple {25324#true} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {25324#true} is VALID [2022-02-20 23:33:15,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {25324#true} goto; {25324#true} is VALID [2022-02-20 23:33:15,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {25324#true} goto; {25324#true} is VALID [2022-02-20 23:33:15,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {25324#true} goto; {25324#true} is VALID [2022-02-20 23:33:15,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {25324#true} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {25324#true} is VALID [2022-02-20 23:33:15,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {25324#true} havoc main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:15,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {25324#true} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {25324#true} is VALID [2022-02-20 23:33:15,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:15,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {25324#true} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {25324#true} is VALID [2022-02-20 23:33:15,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:15,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {25324#true} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {25324#true} is VALID [2022-02-20 23:33:15,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:15,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {25324#true} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {25324#true} is VALID [2022-02-20 23:33:15,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:15,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {25324#true} assume !main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:15,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:15,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {25324#true} assume !main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:15,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:15,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {25324#true} assume !main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:15,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:15,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {25324#true} assume !main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:15,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:15,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {25324#true} assume !main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:15,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:15,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {25324#true} assume !main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:15,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {25324#true} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:15,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {25324#true} assume !main_#t~switch59#1; {25324#true} is VALID [2022-02-20 23:33:15,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {25324#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {25324#true} is VALID [2022-02-20 23:33:15,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {25324#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {25324#true} is VALID [2022-02-20 23:33:15,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {25324#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {25324#true} is VALID [2022-02-20 23:33:15,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {25324#true} goto; {25324#true} is VALID [2022-02-20 23:33:15,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {25324#true} havoc main_~_ha_hashv~0#1; {25324#true} is VALID [2022-02-20 23:33:15,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {25324#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {25324#true} is VALID [2022-02-20 23:33:15,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {25324#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {25324#true} is VALID [2022-02-20 23:33:15,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {25324#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {25324#true} is VALID [2022-02-20 23:33:15,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {25324#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {25324#true} is VALID [2022-02-20 23:33:15,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {25324#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {25324#true} is VALID [2022-02-20 23:33:15,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {25324#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {25324#true} is VALID [2022-02-20 23:33:15,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {25324#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {25324#true} is VALID [2022-02-20 23:33:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 23:33:15,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:15,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850885288] [2022-02-20 23:33:15,466 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:15,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874574268] [2022-02-20 23:33:15,466 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874574268] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:33:15,466 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:33:15,466 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2022-02-20 23:33:15,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574849271] [2022-02-20 23:33:15,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:33:15,467 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 112 [2022-02-20 23:33:15,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:15,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-02-20 23:33:15,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:15,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:33:15,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:15,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:33:15,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:33:15,576 INFO L87 Difference]: Start difference. First operand 582 states and 727 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-02-20 23:33:17,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:17,992 INFO L93 Difference]: Finished difference Result 1117 states and 1411 transitions. [2022-02-20 23:33:17,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:33:17,992 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 112 [2022-02-20 23:33:17,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-02-20 23:33:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 575 transitions. [2022-02-20 23:33:17,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-02-20 23:33:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 575 transitions. [2022-02-20 23:33:18,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 575 transitions. [2022-02-20 23:33:18,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 575 edges. 575 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:18,444 INFO L225 Difference]: With dead ends: 1117 [2022-02-20 23:33:18,444 INFO L226 Difference]: Without dead ends: 598 [2022-02-20 23:33:18,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:33:18,445 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 37 mSDsluCounter, 2051 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 2312 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:18,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 2312 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:33:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-02-20 23:33:18,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 595. [2022-02-20 23:33:18,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:18,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 598 states. Second operand has 595 states, 564 states have (on average 1.2641843971631206) internal successors, (713), 571 states have internal predecessors, (713), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:18,563 INFO L74 IsIncluded]: Start isIncluded. First operand 598 states. Second operand has 595 states, 564 states have (on average 1.2641843971631206) internal successors, (713), 571 states have internal predecessors, (713), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:18,564 INFO L87 Difference]: Start difference. First operand 598 states. Second operand has 595 states, 564 states have (on average 1.2641843971631206) internal successors, (713), 571 states have internal predecessors, (713), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:18,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:18,576 INFO L93 Difference]: Finished difference Result 598 states and 748 transitions. [2022-02-20 23:33:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 748 transitions. [2022-02-20 23:33:18,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:18,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:18,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 595 states, 564 states have (on average 1.2641843971631206) internal successors, (713), 571 states have internal predecessors, (713), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) Second operand 598 states. [2022-02-20 23:33:18,578 INFO L87 Difference]: Start difference. First operand has 595 states, 564 states have (on average 1.2641843971631206) internal successors, (713), 571 states have internal predecessors, (713), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) Second operand 598 states. [2022-02-20 23:33:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:18,590 INFO L93 Difference]: Finished difference Result 598 states and 748 transitions. [2022-02-20 23:33:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 748 transitions. [2022-02-20 23:33:18,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:18,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:18,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:18,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 564 states have (on average 1.2641843971631206) internal successors, (713), 571 states have internal predecessors, (713), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 745 transitions. [2022-02-20 23:33:18,606 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 745 transitions. Word has length 112 [2022-02-20 23:33:18,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:18,606 INFO L470 AbstractCegarLoop]: Abstraction has 595 states and 745 transitions. [2022-02-20 23:33:18,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 12 states have internal predecessors, (107), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-02-20 23:33:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 745 transitions. [2022-02-20 23:33:18,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-02-20 23:33:18,607 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:18,607 INFO L514 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:18,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:33:18,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 23:33:18,833 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 23:33:18,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2135958996, now seen corresponding path program 2 times [2022-02-20 23:33:18,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:18,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614889687] [2022-02-20 23:33:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:18,876 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:18,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [369487318] [2022-02-20 23:33:18,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:33:18,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:18,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:18,878 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:33:18,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 23:33:22,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:33:22,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:33:22,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 1080 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 23:33:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:33:22,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:33:22,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {29254#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {29254#true} is VALID [2022-02-20 23:33:22,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {29254#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {29254#true} is VALID [2022-02-20 23:33:22,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {29254#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {29254#true} is VALID [2022-02-20 23:33:22,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {29254#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {29254#true} is VALID [2022-02-20 23:33:22,385 INFO L290 TraceCheckUtils]: 4: Hoare triple {29254#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {29254#true} is VALID [2022-02-20 23:33:22,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {29254#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {29254#true} is VALID [2022-02-20 23:33:22,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {29254#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {29254#true} is VALID [2022-02-20 23:33:22,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {29254#true} havoc main_~_ha_hashv~0#1; {29254#true} is VALID [2022-02-20 23:33:22,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {29254#true} goto; {29254#true} is VALID [2022-02-20 23:33:22,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {29254#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {29286#(= 4 |ULTIMATE.start_main_~_hj_k~0#1|)} is VALID [2022-02-20 23:33:22,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {29286#(= 4 |ULTIMATE.start_main_~_hj_k~0#1|)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {29254#true} is VALID [2022-02-20 23:33:22,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {29254#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:22,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {29254#true} assume !main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:22,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:22,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {29254#true} assume !main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:22,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:22,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {29254#true} assume !main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:22,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:22,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {29254#true} assume !main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:22,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:22,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {29254#true} assume !main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:22,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:22,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {29254#true} assume !main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:22,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:22,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {29254#true} assume !main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:22,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:22,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {29254#true} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {29254#true} is VALID [2022-02-20 23:33:22,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:22,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {29254#true} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {29254#true} is VALID [2022-02-20 23:33:22,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:22,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {29254#true} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {29254#true} is VALID [2022-02-20 23:33:22,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:22,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {29254#true} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {29254#true} is VALID [2022-02-20 23:33:22,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {29254#true} havoc main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:22,387 INFO L290 TraceCheckUtils]: 34: Hoare triple {29254#true} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {29254#true} is VALID [2022-02-20 23:33:22,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {29254#true} goto; {29254#true} is VALID [2022-02-20 23:33:22,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {29254#true} goto; {29254#true} is VALID [2022-02-20 23:33:22,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {29254#true} goto; {29254#true} is VALID [2022-02-20 23:33:22,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {29254#true} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {29254#true} is VALID [2022-02-20 23:33:22,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {29254#true} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {29254#true} is VALID [2022-02-20 23:33:22,388 INFO L272 TraceCheckUtils]: 40: Hoare triple {29254#true} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {29254#true} is VALID [2022-02-20 23:33:22,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {29254#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {29383#(= |alt_malloc_#in~sz| alt_malloc_~sz)} is VALID [2022-02-20 23:33:22,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {29383#(= |alt_malloc_#in~sz| alt_malloc_~sz)} assume 1 == ~alt_malloc_balance~0; {29383#(= |alt_malloc_#in~sz| alt_malloc_~sz)} is VALID [2022-02-20 23:33:22,389 INFO L272 TraceCheckUtils]: 43: Hoare triple {29383#(= |alt_malloc_#in~sz| alt_malloc_~sz)} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {29254#true} is VALID [2022-02-20 23:33:22,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {29254#true} ~cond := #in~cond; {29393#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 23:33:22,390 INFO L290 TraceCheckUtils]: 45: Hoare triple {29393#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {29397#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 23:33:22,390 INFO L290 TraceCheckUtils]: 46: Hoare triple {29397#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {29397#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 23:33:22,391 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {29397#(not (= |__VERIFIER_assert_#in~cond| 0))} {29383#(= |alt_malloc_#in~sz| alt_malloc_~sz)} #833#return; {29404#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-20 23:33:22,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {29404#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {29404#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-20 23:33:22,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {29404#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} assume true; {29404#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} is VALID [2022-02-20 23:33:22,391 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29404#(= 44 (mod |alt_malloc_#in~sz| 4294967296))} {29254#true} #835#return; {29254#true} is VALID [2022-02-20 23:33:22,391 INFO L290 TraceCheckUtils]: 51: Hoare triple {29254#true} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {29254#true} is VALID [2022-02-20 23:33:22,391 INFO L290 TraceCheckUtils]: 52: Hoare triple {29254#true} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {29254#true} is VALID [2022-02-20 23:33:22,392 INFO L272 TraceCheckUtils]: 53: Hoare triple {29254#true} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {29254#true} is VALID [2022-02-20 23:33:22,392 INFO L290 TraceCheckUtils]: 54: Hoare triple {29254#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {29426#(and (= |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 0) (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:33:22,393 INFO L290 TraceCheckUtils]: 55: Hoare triple {29426#(and (= |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 0) (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {29430#(and (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|) (= (+ (- 1) |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1|) 0))} is VALID [2022-02-20 23:33:22,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {29430#(and (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|) (= (+ (- 1) |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1|) 0))} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {29434#(and (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|) (= (+ (- 2) |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1|) 0))} is VALID [2022-02-20 23:33:22,394 INFO L290 TraceCheckUtils]: 57: Hoare triple {29434#(and (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|) (= (+ (- 2) |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1|) 0))} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {29438#(and (= (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| (- 3)) 0) (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:33:22,394 INFO L290 TraceCheckUtils]: 58: Hoare triple {29438#(and (= (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| (- 3)) 0) (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {29442#(and (= (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| (- 4)) 0) (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:33:22,395 INFO L290 TraceCheckUtils]: 59: Hoare triple {29442#(and (= (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| (- 4)) 0) (= |alt_bzero_#in~n#1| |alt_bzero_#Ultimate.C_memset_#amount#1|))} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {29446#(not (< 4 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-20 23:33:22,395 INFO L290 TraceCheckUtils]: 60: Hoare triple {29446#(not (< 4 (mod |alt_bzero_#in~n#1| 4294967296)))} 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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {29446#(not (< 4 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-20 23:33:22,395 INFO L290 TraceCheckUtils]: 61: Hoare triple {29446#(not (< 4 (mod |alt_bzero_#in~n#1| 4294967296)))} assume true; {29446#(not (< 4 (mod |alt_bzero_#in~n#1| 4294967296)))} is VALID [2022-02-20 23:33:22,396 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {29446#(not (< 4 (mod |alt_bzero_#in~n#1| 4294967296)))} {29254#true} #837#return; {29255#false} is VALID [2022-02-20 23:33:22,396 INFO L290 TraceCheckUtils]: 63: Hoare triple {29255#false} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:22,396 INFO L272 TraceCheckUtils]: 64: Hoare triple {29255#false} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {29255#false} is VALID [2022-02-20 23:33:22,396 INFO L290 TraceCheckUtils]: 65: Hoare triple {29255#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {29255#false} is VALID [2022-02-20 23:33:22,396 INFO L290 TraceCheckUtils]: 66: Hoare triple {29255#false} assume !(1 == ~alt_malloc_balance~0); {29255#false} is VALID [2022-02-20 23:33:22,396 INFO L290 TraceCheckUtils]: 67: Hoare triple {29255#false} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {29255#false} is VALID [2022-02-20 23:33:22,396 INFO L290 TraceCheckUtils]: 68: Hoare triple {29255#false} assume true; {29255#false} is VALID [2022-02-20 23:33:22,396 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29255#false} {29255#false} #839#return; {29255#false} is VALID [2022-02-20 23:33:22,396 INFO L290 TraceCheckUtils]: 70: Hoare triple {29255#false} call write~$Pointer$(main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, 4);havoc main_#t~mem78#1.base, main_#t~mem78#1.offset;havoc main_#t~ret79#1.base, main_#t~ret79#1.offset;call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem80#1.base, 40 + main_#t~mem80#1.offset, 4);havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$(main_#t~mem81#1.base, main_#t~mem81#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:22,397 INFO L290 TraceCheckUtils]: 71: Hoare triple {29255#false} assume !(main_#t~mem82#1.base == 0 && main_#t~mem82#1.offset == 0);havoc main_#t~mem81#1.base, main_#t~mem81#1.offset;havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(main_#t~mem84#1.base, main_#t~mem84#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:22,397 INFO L272 TraceCheckUtils]: 72: Hoare triple {29255#false} call alt_bzero(main_#t~mem85#1.base, main_#t~mem85#1.offset, 384); {29255#false} is VALID [2022-02-20 23:33:22,397 INFO L290 TraceCheckUtils]: 73: Hoare triple {29255#false} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {29255#false} is VALID [2022-02-20 23:33:22,397 INFO L290 TraceCheckUtils]: 74: Hoare triple {29255#false} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {29255#false} is VALID [2022-02-20 23:33:22,397 INFO L290 TraceCheckUtils]: 75: Hoare triple {29255#false} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {29255#false} is VALID [2022-02-20 23:33:22,397 INFO L290 TraceCheckUtils]: 76: Hoare triple {29255#false} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {29255#false} is VALID [2022-02-20 23:33:22,397 INFO L290 TraceCheckUtils]: 77: Hoare triple {29255#false} 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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {29255#false} is VALID [2022-02-20 23:33:22,398 INFO L290 TraceCheckUtils]: 78: Hoare triple {29255#false} assume true; {29255#false} is VALID [2022-02-20 23:33:22,398 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {29255#false} {29255#false} #843#return; {29255#false} is VALID [2022-02-20 23:33:22,398 INFO L290 TraceCheckUtils]: 80: Hoare triple {29255#false} havoc main_#t~mem84#1.base, main_#t~mem84#1.offset;havoc main_#t~mem85#1.base, main_#t~mem85#1.offset; {29255#false} is VALID [2022-02-20 23:33:22,398 INFO L290 TraceCheckUtils]: 81: Hoare triple {29255#false} goto; {29255#false} is VALID [2022-02-20 23:33:22,398 INFO L290 TraceCheckUtils]: 82: Hoare triple {29255#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {29255#false} is VALID [2022-02-20 23:33:22,398 INFO L290 TraceCheckUtils]: 83: Hoare triple {29255#false} havoc main_~_ha_bkt~0#1;call main_#t~mem94#1.base, main_#t~mem94#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem95#1 := read~int(main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);main_#t~post96#1 := main_#t~mem95#1;call write~int(1 + main_#t~post96#1, main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);havoc main_#t~mem94#1.base, main_#t~mem94#1.offset;havoc main_#t~mem95#1;havoc main_#t~post96#1; {29255#false} is VALID [2022-02-20 23:33:22,398 INFO L290 TraceCheckUtils]: 84: Hoare triple {29255#false} call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem98#1 := read~int(main_#t~mem97#1.base, 4 + main_#t~mem97#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem98#1 - 1 then 0 else (if 1 == main_#t~mem98#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem98#1 - 1 || 0 == main_#t~mem98#1 - 1 then main_#t~mem98#1 - 1 else (if main_#t~mem98#1 - 1 >= 0 then (main_#t~mem98#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1; {29255#false} is VALID [2022-02-20 23:33:22,398 INFO L290 TraceCheckUtils]: 85: Hoare triple {29255#false} goto; {29255#false} is VALID [2022-02-20 23:33:22,398 INFO L290 TraceCheckUtils]: 86: Hoare triple {29255#false} call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem100#1.base, main_#t~mem100#1.offset := read~$Pointer$(main_#t~mem99#1.base, main_#t~mem99#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem100#1.base, main_#t~mem100#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem99#1.base, main_#t~mem99#1.offset;havoc main_#t~mem100#1.base, main_#t~mem100#1.offset;call main_#t~mem101#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post102#1 := main_#t~mem101#1;call write~int(1 + main_#t~post102#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem101#1;havoc main_#t~post102#1;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem103#1.base, main_#t~mem103#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:22,399 INFO L290 TraceCheckUtils]: 87: Hoare triple {29255#false} assume main_#t~mem104#1.base != 0 || main_#t~mem104#1.offset != 0;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem105#1.base, 12 + main_#t~mem105#1.offset, 4);havoc main_#t~mem105#1.base, main_#t~mem105#1.offset; {29255#false} is VALID [2022-02-20 23:33:22,399 INFO L290 TraceCheckUtils]: 88: Hoare triple {29255#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem107#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem106#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short110#1 := main_#t~mem107#1 % 4294967296 >= 10 * (1 + main_#t~mem106#1) % 4294967296; {29255#false} is VALID [2022-02-20 23:33:22,399 INFO L290 TraceCheckUtils]: 89: Hoare triple {29255#false} assume main_#t~short110#1;call main_#t~mem108#1.base, main_#t~mem108#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem109#1 := read~int(main_#t~mem108#1.base, 36 + main_#t~mem108#1.offset, 4);main_#t~short110#1 := 0 == main_#t~mem109#1 % 4294967296; {29255#false} is VALID [2022-02-20 23:33:22,399 INFO L290 TraceCheckUtils]: 90: Hoare triple {29255#false} assume main_#t~short110#1;havoc main_#t~mem107#1;havoc main_#t~mem106#1;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;havoc main_#t~mem109#1;havoc main_#t~short110#1; {29255#false} is VALID [2022-02-20 23:33:22,399 INFO L290 TraceCheckUtils]: 91: Hoare triple {29255#false} havoc main_~_he_bkt~0#1;havoc main_~_he_bkt_i~0#1;havoc main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset;havoc main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset;call main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset;call main_#t~mem111#1.base, main_#t~mem111#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem112#1 := read~int(main_#t~mem111#1.base, 4 + main_#t~mem111#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:22,399 INFO L272 TraceCheckUtils]: 92: Hoare triple {29255#false} call main_#t~ret113#1.base, main_#t~ret113#1.offset := alt_malloc(24 * main_#t~mem112#1); {29255#false} is VALID [2022-02-20 23:33:22,399 INFO L290 TraceCheckUtils]: 93: Hoare triple {29255#false} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {29255#false} is VALID [2022-02-20 23:33:22,399 INFO L290 TraceCheckUtils]: 94: Hoare triple {29255#false} assume !(1 == ~alt_malloc_balance~0); {29255#false} is VALID [2022-02-20 23:33:22,400 INFO L290 TraceCheckUtils]: 95: Hoare triple {29255#false} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {29255#false} is VALID [2022-02-20 23:33:22,400 INFO L290 TraceCheckUtils]: 96: Hoare triple {29255#false} assume true; {29255#false} is VALID [2022-02-20 23:33:22,400 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29255#false} {29255#false} #845#return; {29255#false} is VALID [2022-02-20 23:33:22,400 INFO L290 TraceCheckUtils]: 98: Hoare triple {29255#false} call write~$Pointer$(main_#t~ret113#1.base, main_#t~ret113#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4);havoc main_#t~mem111#1.base, main_#t~mem111#1.offset;havoc main_#t~mem112#1;havoc main_#t~ret113#1.base, main_#t~ret113#1.offset;call main_#t~mem114#1.base, main_#t~mem114#1.offset := read~$Pointer$(main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:22,400 INFO L290 TraceCheckUtils]: 99: Hoare triple {29255#false} assume !(main_#t~mem114#1.base == 0 && main_#t~mem114#1.offset == 0);havoc main_#t~mem114#1.base, main_#t~mem114#1.offset;call main_#t~mem115#1.base, main_#t~mem115#1.offset := read~$Pointer$(main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4);call main_#t~mem116#1.base, main_#t~mem116#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem117#1 := read~int(main_#t~mem116#1.base, 4 + main_#t~mem116#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:22,400 INFO L272 TraceCheckUtils]: 100: Hoare triple {29255#false} call alt_bzero(main_#t~mem115#1.base, main_#t~mem115#1.offset, 24 * main_#t~mem117#1); {29255#false} is VALID [2022-02-20 23:33:22,400 INFO L290 TraceCheckUtils]: 101: Hoare triple {29255#false} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {29255#false} is VALID [2022-02-20 23:33:22,400 INFO L290 TraceCheckUtils]: 102: Hoare triple {29255#false} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {29255#false} is VALID [2022-02-20 23:33:22,400 INFO L290 TraceCheckUtils]: 103: Hoare triple {29255#false} 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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {29255#false} is VALID [2022-02-20 23:33:22,401 INFO L290 TraceCheckUtils]: 104: Hoare triple {29255#false} assume true; {29255#false} is VALID [2022-02-20 23:33:22,401 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {29255#false} {29255#false} #847#return; {29255#false} is VALID [2022-02-20 23:33:22,401 INFO L290 TraceCheckUtils]: 106: Hoare triple {29255#false} havoc main_#t~mem115#1.base, main_#t~mem115#1.offset;havoc main_#t~mem116#1.base, main_#t~mem116#1.offset;havoc main_#t~mem117#1;call main_#t~mem118#1.base, main_#t~mem118#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem119#1.base, main_#t~mem119#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem122#1 := read~int(main_#t~mem119#1.base, 12 + main_#t~mem119#1.offset, 4);call main_#t~mem120#1.base, main_#t~mem120#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem121#1 := read~int(main_#t~mem120#1.base, 8 + main_#t~mem120#1.offset, 4);call main_#t~mem123#1.base, main_#t~mem123#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem126#1 := read~int(main_#t~mem123#1.base, 12 + main_#t~mem123#1.offset, 4);call main_#t~mem124#1.base, main_#t~mem124#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem125#1 := read~int(main_#t~mem124#1.base, 4 + main_#t~mem124#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:22,401 INFO L290 TraceCheckUtils]: 107: Hoare triple {29255#false} assume 0 != (if 0 == main_#t~mem126#1 || 0 == 2 * main_#t~mem125#1 - 1 then 0 else (if 1 == 2 * main_#t~mem125#1 - 1 then (if 1 == main_#t~mem126#1 || 0 == main_#t~mem126#1 then main_#t~mem126#1 else (if main_#t~mem126#1 >= 0 then main_#t~mem126#1 % 2 else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1))) else (if 1 == main_#t~mem126#1 then (if 1 == 2 * main_#t~mem125#1 - 1 || 0 == 2 * main_#t~mem125#1 - 1 then 2 * main_#t~mem125#1 - 1 else (if 2 * main_#t~mem125#1 - 1 >= 0 then (2 * main_#t~mem125#1 - 1) % 2 else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1))) else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1)))) % 4294967296;main_#t~ite127#1 := 1; {29255#false} is VALID [2022-02-20 23:33:22,401 INFO L290 TraceCheckUtils]: 108: Hoare triple {29255#false} call write~int((if main_#t~mem122#1 < 0 && (31 == 1 + main_#t~mem121#1 || 63 == 1 + main_#t~mem121#1) then 1 else (if main_#t~mem122#1 >= 0 && (31 == 1 + main_#t~mem121#1 || 63 == 1 + main_#t~mem121#1) then 0 else ~shiftRight(main_#t~mem122#1, 1 + main_#t~mem121#1))) + main_#t~ite127#1, main_#t~mem118#1.base, 24 + main_#t~mem118#1.offset, 4);havoc main_#t~mem118#1.base, main_#t~mem118#1.offset;havoc main_#t~mem119#1.base, main_#t~mem119#1.offset;havoc main_#t~mem122#1;havoc main_#t~mem120#1.base, main_#t~mem120#1.offset;havoc main_#t~mem121#1;havoc main_#t~mem123#1.base, main_#t~mem123#1.offset;havoc main_#t~mem126#1;havoc main_#t~mem124#1.base, main_#t~mem124#1.offset;havoc main_#t~mem125#1;havoc main_#t~ite127#1;call main_#t~mem128#1.base, main_#t~mem128#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(0, main_#t~mem128#1.base, 28 + main_#t~mem128#1.offset, 4);havoc main_#t~mem128#1.base, main_#t~mem128#1.offset;main_~_he_bkt_i~0#1 := 0; {29255#false} is VALID [2022-02-20 23:33:22,401 INFO L290 TraceCheckUtils]: 109: Hoare triple {29255#false} call main_#t~mem130#1.base, main_#t~mem130#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem131#1 := read~int(main_#t~mem130#1.base, 4 + main_#t~mem130#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:22,401 INFO L290 TraceCheckUtils]: 110: Hoare triple {29255#false} assume !(main_~_he_bkt_i~0#1 % 4294967296 < main_#t~mem131#1 % 4294967296);havoc main_#t~mem130#1.base, main_#t~mem130#1.offset;havoc main_#t~mem131#1; {29255#false} is VALID [2022-02-20 23:33:22,401 INFO L290 TraceCheckUtils]: 111: Hoare triple {29255#false} call main_#t~mem156#1.base, main_#t~mem156#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem157#1.base, main_#t~mem157#1.offset := read~$Pointer$(main_#t~mem156#1.base, main_#t~mem156#1.offset, 4);call main_#t~mem158#1.base, main_#t~mem158#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem159#1 := read~int(main_#t~mem158#1.base, 4 + main_#t~mem158#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:22,402 INFO L272 TraceCheckUtils]: 112: Hoare triple {29255#false} call alt_free(main_#t~mem157#1.base, main_#t~mem157#1.offset, 12 * main_#t~mem159#1); {29255#false} is VALID [2022-02-20 23:33:22,402 INFO L290 TraceCheckUtils]: 113: Hoare triple {29255#false} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;~sz := #in~sz;#t~pre33 := ~alt_malloc_balance~0 - 1;~alt_malloc_balance~0 := ~alt_malloc_balance~0 - 1;call #t~mem34 := read~int(~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~pre33, 4);~expected~0 := #t~mem34;havoc #t~pre33;havoc #t~mem34; {29255#false} is VALID [2022-02-20 23:33:22,402 INFO L290 TraceCheckUtils]: 114: Hoare triple {29255#false} assume ~sz % 4294967296 != ~expected~0 % 4294967296; {29255#false} is VALID [2022-02-20 23:33:22,402 INFO L290 TraceCheckUtils]: 115: Hoare triple {29255#false} assume !false; {29255#false} is VALID [2022-02-20 23:33:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 38 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 23:33:22,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:33:23,167 INFO L290 TraceCheckUtils]: 115: Hoare triple {29255#false} assume !false; {29255#false} is VALID [2022-02-20 23:33:23,167 INFO L290 TraceCheckUtils]: 114: Hoare triple {29255#false} assume ~sz % 4294967296 != ~expected~0 % 4294967296; {29255#false} is VALID [2022-02-20 23:33:23,167 INFO L290 TraceCheckUtils]: 113: Hoare triple {29255#false} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;~sz := #in~sz;#t~pre33 := ~alt_malloc_balance~0 - 1;~alt_malloc_balance~0 := ~alt_malloc_balance~0 - 1;call #t~mem34 := read~int(~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~pre33, 4);~expected~0 := #t~mem34;havoc #t~pre33;havoc #t~mem34; {29255#false} is VALID [2022-02-20 23:33:23,167 INFO L272 TraceCheckUtils]: 112: Hoare triple {29255#false} call alt_free(main_#t~mem157#1.base, main_#t~mem157#1.offset, 12 * main_#t~mem159#1); {29255#false} is VALID [2022-02-20 23:33:23,167 INFO L290 TraceCheckUtils]: 111: Hoare triple {29255#false} call main_#t~mem156#1.base, main_#t~mem156#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem157#1.base, main_#t~mem157#1.offset := read~$Pointer$(main_#t~mem156#1.base, main_#t~mem156#1.offset, 4);call main_#t~mem158#1.base, main_#t~mem158#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem159#1 := read~int(main_#t~mem158#1.base, 4 + main_#t~mem158#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:23,167 INFO L290 TraceCheckUtils]: 110: Hoare triple {29255#false} assume !(main_~_he_bkt_i~0#1 % 4294967296 < main_#t~mem131#1 % 4294967296);havoc main_#t~mem130#1.base, main_#t~mem130#1.offset;havoc main_#t~mem131#1; {29255#false} is VALID [2022-02-20 23:33:23,167 INFO L290 TraceCheckUtils]: 109: Hoare triple {29255#false} call main_#t~mem130#1.base, main_#t~mem130#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem131#1 := read~int(main_#t~mem130#1.base, 4 + main_#t~mem130#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:23,167 INFO L290 TraceCheckUtils]: 108: Hoare triple {29255#false} call write~int((if main_#t~mem122#1 < 0 && (31 == 1 + main_#t~mem121#1 || 63 == 1 + main_#t~mem121#1) then 1 else (if main_#t~mem122#1 >= 0 && (31 == 1 + main_#t~mem121#1 || 63 == 1 + main_#t~mem121#1) then 0 else ~shiftRight(main_#t~mem122#1, 1 + main_#t~mem121#1))) + main_#t~ite127#1, main_#t~mem118#1.base, 24 + main_#t~mem118#1.offset, 4);havoc main_#t~mem118#1.base, main_#t~mem118#1.offset;havoc main_#t~mem119#1.base, main_#t~mem119#1.offset;havoc main_#t~mem122#1;havoc main_#t~mem120#1.base, main_#t~mem120#1.offset;havoc main_#t~mem121#1;havoc main_#t~mem123#1.base, main_#t~mem123#1.offset;havoc main_#t~mem126#1;havoc main_#t~mem124#1.base, main_#t~mem124#1.offset;havoc main_#t~mem125#1;havoc main_#t~ite127#1;call main_#t~mem128#1.base, main_#t~mem128#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(0, main_#t~mem128#1.base, 28 + main_#t~mem128#1.offset, 4);havoc main_#t~mem128#1.base, main_#t~mem128#1.offset;main_~_he_bkt_i~0#1 := 0; {29255#false} is VALID [2022-02-20 23:33:23,167 INFO L290 TraceCheckUtils]: 107: Hoare triple {29255#false} assume 0 != (if 0 == main_#t~mem126#1 || 0 == 2 * main_#t~mem125#1 - 1 then 0 else (if 1 == 2 * main_#t~mem125#1 - 1 then (if 1 == main_#t~mem126#1 || 0 == main_#t~mem126#1 then main_#t~mem126#1 else (if main_#t~mem126#1 >= 0 then main_#t~mem126#1 % 2 else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1))) else (if 1 == main_#t~mem126#1 then (if 1 == 2 * main_#t~mem125#1 - 1 || 0 == 2 * main_#t~mem125#1 - 1 then 2 * main_#t~mem125#1 - 1 else (if 2 * main_#t~mem125#1 - 1 >= 0 then (2 * main_#t~mem125#1 - 1) % 2 else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1))) else ~bitwiseAnd(main_#t~mem126#1, 2 * main_#t~mem125#1 - 1)))) % 4294967296;main_#t~ite127#1 := 1; {29255#false} is VALID [2022-02-20 23:33:23,168 INFO L290 TraceCheckUtils]: 106: Hoare triple {29255#false} havoc main_#t~mem115#1.base, main_#t~mem115#1.offset;havoc main_#t~mem116#1.base, main_#t~mem116#1.offset;havoc main_#t~mem117#1;call main_#t~mem118#1.base, main_#t~mem118#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem119#1.base, main_#t~mem119#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem122#1 := read~int(main_#t~mem119#1.base, 12 + main_#t~mem119#1.offset, 4);call main_#t~mem120#1.base, main_#t~mem120#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem121#1 := read~int(main_#t~mem120#1.base, 8 + main_#t~mem120#1.offset, 4);call main_#t~mem123#1.base, main_#t~mem123#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem126#1 := read~int(main_#t~mem123#1.base, 12 + main_#t~mem123#1.offset, 4);call main_#t~mem124#1.base, main_#t~mem124#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem125#1 := read~int(main_#t~mem124#1.base, 4 + main_#t~mem124#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:23,168 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {29254#true} {29255#false} #847#return; {29255#false} is VALID [2022-02-20 23:33:23,168 INFO L290 TraceCheckUtils]: 104: Hoare triple {29254#true} assume true; {29254#true} is VALID [2022-02-20 23:33:23,168 INFO L290 TraceCheckUtils]: 103: Hoare triple {29254#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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {29254#true} is VALID [2022-02-20 23:33:23,168 INFO L290 TraceCheckUtils]: 102: Hoare triple {29254#true} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {29254#true} is VALID [2022-02-20 23:33:23,168 INFO L290 TraceCheckUtils]: 101: Hoare triple {29254#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {29254#true} is VALID [2022-02-20 23:33:23,168 INFO L272 TraceCheckUtils]: 100: Hoare triple {29255#false} call alt_bzero(main_#t~mem115#1.base, main_#t~mem115#1.offset, 24 * main_#t~mem117#1); {29254#true} is VALID [2022-02-20 23:33:23,168 INFO L290 TraceCheckUtils]: 99: Hoare triple {29255#false} assume !(main_#t~mem114#1.base == 0 && main_#t~mem114#1.offset == 0);havoc main_#t~mem114#1.base, main_#t~mem114#1.offset;call main_#t~mem115#1.base, main_#t~mem115#1.offset := read~$Pointer$(main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4);call main_#t~mem116#1.base, main_#t~mem116#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem117#1 := read~int(main_#t~mem116#1.base, 4 + main_#t~mem116#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:23,168 INFO L290 TraceCheckUtils]: 98: Hoare triple {29255#false} call write~$Pointer$(main_#t~ret113#1.base, main_#t~ret113#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4);havoc main_#t~mem111#1.base, main_#t~mem111#1.offset;havoc main_#t~mem112#1;havoc main_#t~ret113#1.base, main_#t~ret113#1.offset;call main_#t~mem114#1.base, main_#t~mem114#1.offset := read~$Pointer$(main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:23,168 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {29254#true} {29255#false} #845#return; {29255#false} is VALID [2022-02-20 23:33:23,168 INFO L290 TraceCheckUtils]: 96: Hoare triple {29254#true} assume true; {29254#true} is VALID [2022-02-20 23:33:23,168 INFO L290 TraceCheckUtils]: 95: Hoare triple {29254#true} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {29254#true} is VALID [2022-02-20 23:33:23,168 INFO L290 TraceCheckUtils]: 94: Hoare triple {29254#true} assume !(1 == ~alt_malloc_balance~0); {29254#true} is VALID [2022-02-20 23:33:23,168 INFO L290 TraceCheckUtils]: 93: Hoare triple {29254#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {29254#true} is VALID [2022-02-20 23:33:23,168 INFO L272 TraceCheckUtils]: 92: Hoare triple {29255#false} call main_#t~ret113#1.base, main_#t~ret113#1.offset := alt_malloc(24 * main_#t~mem112#1); {29254#true} is VALID [2022-02-20 23:33:23,168 INFO L290 TraceCheckUtils]: 91: Hoare triple {29255#false} havoc main_~_he_bkt~0#1;havoc main_~_he_bkt_i~0#1;havoc main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset;havoc main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset;call main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset;call main_#t~mem111#1.base, main_#t~mem111#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem112#1 := read~int(main_#t~mem111#1.base, 4 + main_#t~mem111#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 90: Hoare triple {29255#false} assume main_#t~short110#1;havoc main_#t~mem107#1;havoc main_#t~mem106#1;havoc main_#t~mem108#1.base, main_#t~mem108#1.offset;havoc main_#t~mem109#1;havoc main_#t~short110#1; {29255#false} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 89: Hoare triple {29255#false} assume main_#t~short110#1;call main_#t~mem108#1.base, main_#t~mem108#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem109#1 := read~int(main_#t~mem108#1.base, 36 + main_#t~mem108#1.offset, 4);main_#t~short110#1 := 0 == main_#t~mem109#1 % 4294967296; {29255#false} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 88: Hoare triple {29255#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem107#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem106#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short110#1 := main_#t~mem107#1 % 4294967296 >= 10 * (1 + main_#t~mem106#1) % 4294967296; {29255#false} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 87: Hoare triple {29255#false} assume main_#t~mem104#1.base != 0 || main_#t~mem104#1.offset != 0;havoc main_#t~mem104#1.base, main_#t~mem104#1.offset;call main_#t~mem105#1.base, main_#t~mem105#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem105#1.base, 12 + main_#t~mem105#1.offset, 4);havoc main_#t~mem105#1.base, main_#t~mem105#1.offset; {29255#false} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 86: Hoare triple {29255#false} call main_#t~mem99#1.base, main_#t~mem99#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem100#1.base, main_#t~mem100#1.offset := read~$Pointer$(main_#t~mem99#1.base, main_#t~mem99#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem100#1.base, main_#t~mem100#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem99#1.base, main_#t~mem99#1.offset;havoc main_#t~mem100#1.base, main_#t~mem100#1.offset;call main_#t~mem101#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post102#1 := main_#t~mem101#1;call write~int(1 + main_#t~post102#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem101#1;havoc main_#t~post102#1;call main_#t~mem103#1.base, main_#t~mem103#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem103#1.base, main_#t~mem103#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem103#1.base, main_#t~mem103#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem104#1.base, main_#t~mem104#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 85: Hoare triple {29255#false} goto; {29255#false} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 84: Hoare triple {29255#false} call main_#t~mem97#1.base, main_#t~mem97#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem98#1 := read~int(main_#t~mem97#1.base, 4 + main_#t~mem97#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem98#1 - 1 then 0 else (if 1 == main_#t~mem98#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem98#1 - 1 || 0 == main_#t~mem98#1 - 1 then main_#t~mem98#1 - 1 else (if main_#t~mem98#1 - 1 >= 0 then (main_#t~mem98#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem98#1 - 1))));havoc main_#t~mem97#1.base, main_#t~mem97#1.offset;havoc main_#t~mem98#1; {29255#false} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 83: Hoare triple {29255#false} havoc main_~_ha_bkt~0#1;call main_#t~mem94#1.base, main_#t~mem94#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem95#1 := read~int(main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);main_#t~post96#1 := main_#t~mem95#1;call write~int(1 + main_#t~post96#1, main_#t~mem94#1.base, 12 + main_#t~mem94#1.offset, 4);havoc main_#t~mem94#1.base, main_#t~mem94#1.offset;havoc main_#t~mem95#1;havoc main_#t~post96#1; {29255#false} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 82: Hoare triple {29255#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {29255#false} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 81: Hoare triple {29255#false} goto; {29255#false} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 80: Hoare triple {29255#false} havoc main_#t~mem84#1.base, main_#t~mem84#1.offset;havoc main_#t~mem85#1.base, main_#t~mem85#1.offset; {29255#false} is VALID [2022-02-20 23:33:23,169 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {29254#true} {29255#false} #843#return; {29255#false} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 78: Hoare triple {29254#true} assume true; {29254#true} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 77: Hoare triple {29254#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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {29254#true} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 76: Hoare triple {29254#true} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {29254#true} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 75: Hoare triple {29254#true} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {29254#true} is VALID [2022-02-20 23:33:23,169 INFO L290 TraceCheckUtils]: 74: Hoare triple {29254#true} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {29254#true} is VALID [2022-02-20 23:33:23,170 INFO L290 TraceCheckUtils]: 73: Hoare triple {29254#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {29254#true} is VALID [2022-02-20 23:33:23,170 INFO L272 TraceCheckUtils]: 72: Hoare triple {29255#false} call alt_bzero(main_#t~mem85#1.base, main_#t~mem85#1.offset, 384); {29254#true} is VALID [2022-02-20 23:33:23,170 INFO L290 TraceCheckUtils]: 71: Hoare triple {29255#false} assume !(main_#t~mem82#1.base == 0 && main_#t~mem82#1.offset == 0);havoc main_#t~mem81#1.base, main_#t~mem81#1.offset;havoc main_#t~mem82#1.base, main_#t~mem82#1.offset;call main_#t~mem84#1.base, main_#t~mem84#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem85#1.base, main_#t~mem85#1.offset := read~$Pointer$(main_#t~mem84#1.base, main_#t~mem84#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:23,170 INFO L290 TraceCheckUtils]: 70: Hoare triple {29255#false} call write~$Pointer$(main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, 4);havoc main_#t~mem78#1.base, main_#t~mem78#1.offset;havoc main_#t~ret79#1.base, main_#t~ret79#1.offset;call main_#t~mem80#1.base, main_#t~mem80#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem80#1.base, 40 + main_#t~mem80#1.offset, 4);havoc main_#t~mem80#1.base, main_#t~mem80#1.offset;call main_#t~mem81#1.base, main_#t~mem81#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem82#1.base, main_#t~mem82#1.offset := read~$Pointer$(main_#t~mem81#1.base, main_#t~mem81#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:23,170 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {29254#true} {29255#false} #839#return; {29255#false} is VALID [2022-02-20 23:33:23,170 INFO L290 TraceCheckUtils]: 68: Hoare triple {29254#true} assume true; {29254#true} is VALID [2022-02-20 23:33:23,170 INFO L290 TraceCheckUtils]: 67: Hoare triple {29254#true} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {29254#true} is VALID [2022-02-20 23:33:23,170 INFO L290 TraceCheckUtils]: 66: Hoare triple {29254#true} assume !(1 == ~alt_malloc_balance~0); {29254#true} is VALID [2022-02-20 23:33:23,170 INFO L290 TraceCheckUtils]: 65: Hoare triple {29254#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {29254#true} is VALID [2022-02-20 23:33:23,170 INFO L272 TraceCheckUtils]: 64: Hoare triple {29255#false} call main_#t~ret79#1.base, main_#t~ret79#1.offset := alt_malloc(384); {29254#true} is VALID [2022-02-20 23:33:23,170 INFO L290 TraceCheckUtils]: 63: Hoare triple {29255#false} havoc main_#t~mem73#1.base, main_#t~mem73#1.offset;call main_#t~mem74#1.base, main_#t~mem74#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem74#1.base, 16 + main_#t~mem74#1.offset, 4);havoc main_#t~mem74#1.base, main_#t~mem74#1.offset;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem75#1.base, 4 + main_#t~mem75#1.offset, 4);havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;call main_#t~mem76#1.base, main_#t~mem76#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem76#1.base, 8 + main_#t~mem76#1.offset, 4);havoc main_#t~mem76#1.base, main_#t~mem76#1.offset;call main_#t~mem77#1.base, main_#t~mem77#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem77#1.base, 20 + main_#t~mem77#1.offset, 4);havoc main_#t~mem77#1.base, main_#t~mem77#1.offset;call main_#t~mem78#1.base, main_#t~mem78#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {29255#false} is VALID [2022-02-20 23:33:23,171 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {29777#(not (= |alt_bzero_#in~n#1| 44))} {29254#true} #837#return; {29255#false} is VALID [2022-02-20 23:33:23,171 INFO L290 TraceCheckUtils]: 61: Hoare triple {29777#(not (= |alt_bzero_#in~n#1| 44))} assume true; {29777#(not (= |alt_bzero_#in~n#1| 44))} is VALID [2022-02-20 23:33:23,172 INFO L290 TraceCheckUtils]: 60: Hoare triple {29777#(not (= |alt_bzero_#in~n#1| 44))} 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;#t~memset~res38#1.base, #t~memset~res38#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc #t~memset~res38#1.base, #t~memset~res38#1.offset; {29777#(not (= |alt_bzero_#in~n#1| 44))} is VALID [2022-02-20 23:33:23,172 INFO L290 TraceCheckUtils]: 59: Hoare triple {29787#(or (< (mod |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} assume !(#Ultimate.C_memset_#t~loopctr269#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {29777#(not (= |alt_bzero_#in~n#1| 44))} is VALID [2022-02-20 23:33:23,173 INFO L290 TraceCheckUtils]: 58: Hoare triple {29791#(or (< (mod (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 1) 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {29787#(or (< (mod |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} is VALID [2022-02-20 23:33:23,175 INFO L290 TraceCheckUtils]: 57: Hoare triple {29795#(or (< (mod (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 2) 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {29791#(or (< (mod (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 1) 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} is VALID [2022-02-20 23:33:23,176 INFO L290 TraceCheckUtils]: 56: Hoare triple {29799#(or (< (mod (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 3) 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {29795#(or (< (mod (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 2) 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} is VALID [2022-02-20 23:33:23,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {29803#(or (not (= |alt_bzero_#in~n#1| 44)) (< (mod (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 4) 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)))} assume #Ultimate.C_memset_#t~loopctr269#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~loopctr269#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~loopctr269#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr269#1 := #Ultimate.C_memset_#value#1 % 256];#Ultimate.C_memset_#t~loopctr269#1 := 1 + #Ultimate.C_memset_#t~loopctr269#1; {29799#(or (< (mod (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 3) 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)) (not (= |alt_bzero_#in~n#1| 44)))} is VALID [2022-02-20 23:33:23,178 INFO L290 TraceCheckUtils]: 54: Hoare triple {29254#true} ~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~n#1 := #in~n#1;#t~pre37#1 := 1 + ~alt_bzero_count~0;~alt_bzero_count~0 := 1 + ~alt_bzero_count~0;havoc #t~pre37#1;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 := ~a#1.base, ~a#1.offset, 0, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr269#1;#Ultimate.C_memset_#t~loopctr269#1 := 0; {29803#(or (not (= |alt_bzero_#in~n#1| 44)) (< (mod (+ |alt_bzero_#Ultimate.C_memset_#t~loopctr269#1| 4) 4294967296) (mod |alt_bzero_#Ultimate.C_memset_#amount#1| 4294967296)))} is VALID [2022-02-20 23:33:23,178 INFO L272 TraceCheckUtils]: 53: Hoare triple {29254#true} call alt_bzero(main_#t~mem73#1.base, main_#t~mem73#1.offset, 44); {29254#true} is VALID [2022-02-20 23:33:23,178 INFO L290 TraceCheckUtils]: 52: Hoare triple {29254#true} assume !(main_#t~mem72#1.base == 0 && main_#t~mem72#1.offset == 0);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset;call main_#t~mem73#1.base, main_#t~mem73#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {29254#true} is VALID [2022-02-20 23:33:23,178 INFO L290 TraceCheckUtils]: 51: Hoare triple {29254#true} call write~$Pointer$(main_#t~ret71#1.base, main_#t~ret71#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~ret71#1.base, main_#t~ret71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {29254#true} is VALID [2022-02-20 23:33:23,178 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {29254#true} {29254#true} #835#return; {29254#true} is VALID [2022-02-20 23:33:23,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {29254#true} assume true; {29254#true} is VALID [2022-02-20 23:33:23,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {29254#true} call #t~malloc32.base, #t~malloc32.offset := #Ultimate.allocOnHeap(~sz);#res.base, #res.offset := #t~malloc32.base, #t~malloc32.offset;havoc #t~malloc32.base, #t~malloc32.offset; {29254#true} is VALID [2022-02-20 23:33:23,178 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {29254#true} {29254#true} #833#return; {29254#true} is VALID [2022-02-20 23:33:23,178 INFO L290 TraceCheckUtils]: 46: Hoare triple {29254#true} assume true; {29254#true} is VALID [2022-02-20 23:33:23,178 INFO L290 TraceCheckUtils]: 45: Hoare triple {29254#true} assume !(0 == ~cond); {29254#true} is VALID [2022-02-20 23:33:23,178 INFO L290 TraceCheckUtils]: 44: Hoare triple {29254#true} ~cond := #in~cond; {29254#true} is VALID [2022-02-20 23:33:23,178 INFO L272 TraceCheckUtils]: 43: Hoare triple {29254#true} call __VERIFIER_assert((if 44 == ~sz % 4294967296 then 1 else 0)); {29254#true} is VALID [2022-02-20 23:33:23,178 INFO L290 TraceCheckUtils]: 42: Hoare triple {29254#true} assume 1 == ~alt_malloc_balance~0; {29254#true} is VALID [2022-02-20 23:33:23,179 INFO L290 TraceCheckUtils]: 41: Hoare triple {29254#true} ~sz := #in~sz;#t~post31 := ~alt_malloc_balance~0;~alt_malloc_balance~0 := 1 + #t~post31;call write~int(~sz, ~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset + 4 * #t~post31, 4);havoc #t~post31; {29254#true} is VALID [2022-02-20 23:33:23,179 INFO L272 TraceCheckUtils]: 40: Hoare triple {29254#true} call main_#t~ret71#1.base, main_#t~ret71#1.offset := alt_malloc(44); {29254#true} is VALID [2022-02-20 23:33:23,179 INFO L290 TraceCheckUtils]: 39: Hoare triple {29254#true} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {29254#true} is VALID [2022-02-20 23:33:23,179 INFO L290 TraceCheckUtils]: 38: Hoare triple {29254#true} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {29254#true} is VALID [2022-02-20 23:33:23,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {29254#true} goto; {29254#true} is VALID [2022-02-20 23:33:23,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {29254#true} goto; {29254#true} is VALID [2022-02-20 23:33:23,179 INFO L290 TraceCheckUtils]: 35: Hoare triple {29254#true} goto; {29254#true} is VALID [2022-02-20 23:33:23,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {29254#true} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {29254#true} is VALID [2022-02-20 23:33:23,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {29254#true} havoc main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:23,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {29254#true} assume main_#t~switch59#1;call main_#t~mem70#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem70#1 % 256;havoc main_#t~mem70#1; {29254#true} is VALID [2022-02-20 23:33:23,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 1 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:23,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {29254#true} assume main_#t~switch59#1;call main_#t~mem69#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem69#1 % 256);havoc main_#t~mem69#1; {29254#true} is VALID [2022-02-20 23:33:23,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 2 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:23,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {29254#true} assume main_#t~switch59#1;call main_#t~mem68#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem68#1 % 256);havoc main_#t~mem68#1; {29254#true} is VALID [2022-02-20 23:33:23,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 3 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:23,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {29254#true} assume main_#t~switch59#1;call main_#t~mem67#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem67#1 % 256);havoc main_#t~mem67#1; {29254#true} is VALID [2022-02-20 23:33:23,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 4 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:23,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {29254#true} assume !main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:23,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 5 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:23,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {29254#true} assume !main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:23,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 6 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:23,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {29254#true} assume !main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:23,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 7 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:23,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {29254#true} assume !main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:23,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 8 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:23,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {29254#true} assume !main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:23,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 9 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:23,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {29254#true} assume !main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:23,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {29254#true} main_#t~switch59#1 := main_#t~switch59#1 || 10 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:23,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {29254#true} assume !main_#t~switch59#1; {29254#true} is VALID [2022-02-20 23:33:23,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {29254#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch59#1 := 11 == main_~_hj_k~0#1; {29254#true} is VALID [2022-02-20 23:33:23,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {29254#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {29254#true} is VALID [2022-02-20 23:33:23,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {29254#true} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {29254#true} is VALID [2022-02-20 23:33:23,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {29254#true} goto; {29254#true} is VALID [2022-02-20 23:33:23,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {29254#true} havoc main_~_ha_hashv~0#1; {29254#true} is VALID [2022-02-20 23:33:23,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {29254#true} call main_#t~mem44#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem44#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem44#1;call main_#t~mem45#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem46#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem45#1 * main_#t~mem46#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem45#1;havoc main_#t~mem46#1; {29254#true} is VALID [2022-02-20 23:33:23,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {29254#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {29254#true} is VALID [2022-02-20 23:33:23,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {29254#true} main_#t~ret43#1.base, main_#t~ret43#1.offset := real_malloc_#res#1.base, real_malloc_#res#1.offset;assume { :end_inline_real_malloc } true;main_~user~0#1.base, main_~user~0#1.offset := main_#t~ret43#1.base, main_#t~ret43#1.offset;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset; {29254#true} is VALID [2022-02-20 23:33:23,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {29254#true} assume !!(main_#t~mem42#1 < 10);havoc main_#t~mem42#1;assume { :begin_inline_real_malloc } true;real_malloc_#in~n#1 := 40;havoc real_malloc_#res#1.base, real_malloc_#res#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset, real_malloc_~n#1;real_malloc_~n#1 := real_malloc_#in~n#1;call real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset := #Ultimate.allocOnHeap(real_malloc_~n#1);real_malloc_#res#1.base, real_malloc_#res#1.offset := real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset;havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; {29254#true} is VALID [2022-02-20 23:33:23,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {29254#true} call main_#t~mem42#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {29254#true} is VALID [2022-02-20 23:33:23,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {29254#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret43#1.base, main_#t~ret43#1.offset, main_#t~mem44#1, main_#t~mem45#1, main_#t~mem46#1, main_#t~mem48#1, main_#t~mem47#1, main_#t~mem49#1, main_#t~mem50#1, main_#t~mem52#1, main_#t~mem51#1, main_#t~mem53#1, main_#t~mem54#1, main_#t~mem56#1, main_#t~mem55#1, main_#t~mem57#1, main_#t~mem58#1, main_#t~switch59#1, main_#t~mem60#1, main_#t~mem61#1, main_#t~mem62#1, main_#t~mem63#1, main_#t~mem64#1, main_#t~mem65#1, main_#t~mem66#1, main_#t~mem67#1, main_#t~mem68#1, main_#t~mem69#1, main_#t~mem70#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~ret71#1.base, main_#t~ret71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1.base, main_#t~mem74#1.offset, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~ret79#1.base, main_#t~ret79#1.offset, main_#t~mem80#1.base, main_#t~mem80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1.base, main_#t~mem84#1.offset, main_#t~mem85#1.base, main_#t~mem85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1.base, main_#t~mem89#1.offset, main_#t~mem90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1.base, main_#t~mem94#1.offset, main_#t~mem95#1, main_#t~post96#1, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1, main_#t~post102#1, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem107#1, main_#t~mem106#1, main_#t~mem108#1.base, main_#t~mem108#1.offset, main_#t~mem109#1, main_#t~short110#1, main_#t~mem111#1.base, main_#t~mem111#1.offset, main_#t~mem112#1, main_#t~ret113#1.base, main_#t~ret113#1.offset, main_#t~mem114#1.base, main_#t~mem114#1.offset, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem122#1, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem126#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1, main_#t~ite127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem138#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_#t~mem140#1, main_#t~pre141#1, main_#t~mem142#1.base, main_#t~mem142#1.offset, main_#t~mem143#1, main_#t~mem144#1.base, main_#t~mem144#1.offset, main_#t~mem145#1, main_#t~post146#1, main_#t~mem150#1, main_#t~mem148#1, main_#t~mem147#1.base, main_#t~mem147#1.offset, main_#t~mem149#1, main_#t~mem151#1, main_#t~post152#1, main_#t~mem153#1.base, main_#t~mem153#1.offset, main_#t~mem154#1.base, main_#t~mem154#1.offset, main_#t~mem155#1.base, main_#t~mem155#1.offset, main_#t~post129#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~mem156#1.base, main_#t~mem156#1.offset, main_#t~mem157#1.base, main_#t~mem157#1.offset, main_#t~mem158#1.base, main_#t~mem158#1.offset, main_#t~mem159#1, main_#t~mem160#1.base, main_#t~mem160#1.offset, main_#t~mem161#1, main_#t~mem162#1.base, main_#t~mem162#1.offset, main_#t~mem163#1, main_#t~post164#1, main_#t~mem165#1.base, main_#t~mem165#1.offset, main_#t~mem166#1.base, main_#t~mem166#1.offset, main_#t~mem167#1.base, main_#t~mem167#1.offset, main_#t~mem168#1.base, main_#t~mem168#1.offset, main_#t~mem171#1, main_#t~mem169#1.base, main_#t~mem169#1.offset, main_#t~mem170#1, main_#t~ite174#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem40#1, main_#t~post41#1, main_#t~mem42#1, main_#t~mem182#1, main_#t~mem181#1, main_#t~mem183#1, main_#t~mem184#1, main_#t~mem186#1, main_#t~mem185#1, main_#t~mem187#1, main_#t~mem188#1, main_#t~mem190#1, main_#t~mem189#1, main_#t~mem191#1, main_#t~mem192#1, main_#t~switch193#1, main_#t~mem194#1, main_#t~mem195#1, main_#t~mem196#1, main_#t~mem197#1, main_#t~mem198#1, main_#t~mem199#1, main_#t~mem200#1, main_#t~mem201#1, main_#t~mem202#1, main_#t~mem203#1, main_#t~mem204#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1, main_#t~mem207#1.base, main_#t~mem207#1.offset, main_#t~mem208#1.base, main_#t~mem208#1.offset, main_#t~mem209#1.base, main_#t~mem209#1.offset, main_#t~mem210#1.base, main_#t~mem210#1.offset, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1.base, main_#t~mem213#1.offset, main_#t~mem214#1, main_#t~mem215#1, main_#t~mem216#1, main_#t~short217#1, main_#t~mem218#1.base, main_#t~mem218#1.offset, main_#t~ret219#1, main_#t~mem220#1.base, main_#t~mem220#1.offset, main_#t~mem221#1.base, main_#t~mem221#1.offset, main_#t~mem222#1.base, main_#t~mem222#1.offset, main_#t~mem223#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~short226#1, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1.base, main_#t~mem228#1.offset, main_#t~mem229#1.base, main_#t~mem229#1.offset, main_#t~mem230#1, main_#t~mem231#1.base, main_#t~mem231#1.offset, main_#t~mem232#1.base, main_#t~mem232#1.offset, main_#t~mem233#1.base, main_#t~mem233#1.offset, main_#t~mem234#1.base, main_#t~mem234#1.offset, main_#t~mem235#1.base, main_#t~mem235#1.offset, main_#t~mem236#1.base, main_#t~mem236#1.offset, main_#t~mem237#1, main_#t~mem238#1.base, main_#t~mem238#1.offset, main_#t~mem239#1.base, main_#t~mem239#1.offset, main_#t~mem240#1.base, main_#t~mem240#1.offset, main_#t~mem241#1, main_#t~mem242#1.base, main_#t~mem242#1.offset, main_#t~mem243#1.base, main_#t~mem243#1.offset, main_#t~mem244#1.base, main_#t~mem244#1.offset, main_#t~mem245#1.base, main_#t~mem245#1.offset, main_#t~mem246#1.base, main_#t~mem246#1.offset, main_#t~mem247#1, main_#t~mem248#1.base, main_#t~mem248#1.offset, main_#t~mem251#1, main_#t~mem249#1.base, main_#t~mem249#1.offset, main_#t~mem250#1, main_#t~mem252#1.base, main_#t~mem252#1.offset, main_#t~mem253#1.base, main_#t~mem253#1.offset, main_#t~mem254#1, main_#t~post255#1, main_#t~mem256#1.base, main_#t~mem256#1.offset, main_#t~mem257#1.base, main_#t~mem257#1.offset, main_#t~mem258#1.base, main_#t~mem258#1.offset, main_#t~mem259#1.base, main_#t~mem259#1.offset, main_#t~mem260#1.base, main_#t~mem260#1.offset, main_#t~mem261#1.base, main_#t~mem261#1.offset, main_#t~mem262#1.base, main_#t~mem262#1.offset, main_#t~mem263#1.base, main_#t~mem263#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem264#1.base, main_#t~mem264#1.offset, main_#t~mem265#1, main_#t~post266#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem178#1, main_#t~post179#1, main_#t~mem180#1, main_#t~mem267#1.base, main_#t~mem267#1.offset, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {29254#true} is VALID [2022-02-20 23:33:23,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {29254#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(21, 2);~#alt_malloc_sizes~0.base, ~#alt_malloc_sizes~0.offset := 3, 0;call #Ultimate.allocInit(40, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#alt_malloc_sizes~0.base);~alt_malloc_balance~0 := 0;~alt_memcmp_count~0 := 0;~alt_bzero_count~0 := 0; {29254#true} is VALID [2022-02-20 23:33:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-20 23:33:23,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:33:23,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614889687] [2022-02-20 23:33:23,183 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:33:23,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369487318] [2022-02-20 23:33:23,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369487318] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:33:23,184 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:33:23,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2022-02-20 23:33:23,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350858678] [2022-02-20 23:33:23,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:33:23,185 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2022-02-20 23:33:23,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:33:23,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-02-20 23:33:23,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:23,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 23:33:23,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:33:23,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 23:33:23,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:33:23,312 INFO L87 Difference]: Start difference. First operand 595 states and 745 transitions. Second operand has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-02-20 23:33:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:27,362 INFO L93 Difference]: Finished difference Result 1210 states and 1528 transitions. [2022-02-20 23:33:27,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-20 23:33:27,362 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2022-02-20 23:33:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:33:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-02-20 23:33:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 612 transitions. [2022-02-20 23:33:27,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-02-20 23:33:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 612 transitions. [2022-02-20 23:33:27,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 612 transitions. [2022-02-20 23:33:27,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 612 edges. 612 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:33:27,866 INFO L225 Difference]: With dead ends: 1210 [2022-02-20 23:33:27,866 INFO L226 Difference]: Without dead ends: 613 [2022-02-20 23:33:27,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=275, Invalid=915, Unknown=0, NotChecked=0, Total=1190 [2022-02-20 23:33:27,867 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 298 mSDsluCounter, 2338 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:33:27,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 2597 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:33:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2022-02-20 23:33:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 601. [2022-02-20 23:33:28,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:33:28,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 613 states. Second operand has 601 states, 570 states have (on average 1.2614035087719297) internal successors, (719), 577 states have internal predecessors, (719), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:28,034 INFO L74 IsIncluded]: Start isIncluded. First operand 613 states. Second operand has 601 states, 570 states have (on average 1.2614035087719297) internal successors, (719), 577 states have internal predecessors, (719), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:28,034 INFO L87 Difference]: Start difference. First operand 613 states. Second operand has 601 states, 570 states have (on average 1.2614035087719297) internal successors, (719), 577 states have internal predecessors, (719), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:28,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:28,047 INFO L93 Difference]: Finished difference Result 613 states and 763 transitions. [2022-02-20 23:33:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 763 transitions. [2022-02-20 23:33:28,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:28,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:28,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 570 states have (on average 1.2614035087719297) internal successors, (719), 577 states have internal predecessors, (719), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) Second operand 613 states. [2022-02-20 23:33:28,049 INFO L87 Difference]: Start difference. First operand has 601 states, 570 states have (on average 1.2614035087719297) internal successors, (719), 577 states have internal predecessors, (719), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) Second operand 613 states. [2022-02-20 23:33:28,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:33:28,063 INFO L93 Difference]: Finished difference Result 613 states and 763 transitions. [2022-02-20 23:33:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 763 transitions. [2022-02-20 23:33:28,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:33:28,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:33:28,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:33:28,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:33:28,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 570 states have (on average 1.2614035087719297) internal successors, (719), 577 states have internal predecessors, (719), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (16), 13 states have call predecessors, (16), 15 states have call successors, (16) [2022-02-20 23:33:28,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 751 transitions. [2022-02-20 23:33:28,079 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 751 transitions. Word has length 116 [2022-02-20 23:33:28,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:33:28,079 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 751 transitions. [2022-02-20 23:33:28,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 3 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-02-20 23:33:28,080 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 751 transitions. [2022-02-20 23:33:28,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-02-20 23:33:28,080 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:33:28,081 INFO L514 BasicCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:33:28,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:33:28,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-20 23:33:28,292 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 23:33:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:33:28,293 INFO L85 PathProgramCache]: Analyzing trace with hash -224218713, now seen corresponding path program 3 times [2022-02-20 23:33:28,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:33:28,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974981264] [2022-02-20 23:33:28,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:33:28,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:33:28,337 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:33:28,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561512654] [2022-02-20 23:33:28,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:33:28,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:33:28,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:33:28,339 INFO L229 MonitoredProcess]: Starting monitored process 13 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:33:28,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process