./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-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_BER_test3-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 eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:24:22,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:24:22,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:24:22,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:24:22,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:24:22,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:24:22,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:24:22,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:24:22,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:24:22,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:24:22,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:24:22,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:24:22,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:24:22,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:24:22,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:24:22,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:24:22,277 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:24:22,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:24:22,282 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:24:22,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:24:22,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:24:22,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:24:22,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:24:22,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:24:22,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:24:22,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:24:22,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:24:22,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:24:22,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:24:22,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:24:22,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:24:22,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:24:22,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:24:22,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:24:22,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:24:22,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:24:22,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:24:22,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:24:22,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:24:22,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:24:22,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:24:22,304 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:24:22,326 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:24:22,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:24:22,331 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:24:22,331 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:24:22,332 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:24:22,332 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:24:22,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:24:22,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:24:22,333 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:24:22,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:24:22,334 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:24:22,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:24:22,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:24:22,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:24:22,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 23:24:22,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:24:22,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 23:24:22,335 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:24:22,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 23:24:22,335 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:24:22,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 23:24:22,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:24:22,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:24:22,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:24:22,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:24:22,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:24:22,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:24:22,336 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 23:24:22,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:24:22,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:24:22,337 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 23:24:22,337 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 23:24:22,337 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 23:24:22,338 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 -> eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 [2022-02-20 23:24:22,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:24:22,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:24:22,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:24:22,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:24:22,537 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:24:22,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2022-02-20 23:24:22,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ab41482/d66c2f7c5e734307806a4d7fa3386b81/FLAG9eb3c8c0b [2022-02-20 23:24:23,017 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:24:23,018 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2022-02-20 23:24:23,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ab41482/d66c2f7c5e734307806a4d7fa3386b81/FLAG9eb3c8c0b [2022-02-20 23:24:23,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2ab41482/d66c2f7c5e734307806a4d7fa3386b81 [2022-02-20 23:24:23,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:24:23,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:24:23,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:24:23,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:24:23,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:24:23,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:24:23" (1/1) ... [2022-02-20 23:24:23,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47622dd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:23, skipping insertion in model container [2022-02-20 23:24:23,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:24:23" (1/1) ... [2022-02-20 23:24:23,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:24:23,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:24:23,390 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_BER_test3-1.i[33021,33034] [2022-02-20 23:24:23,512 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_BER_test3-1.i[44590,44603] [2022-02-20 23:24:23,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:24:23,529 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:24:23,557 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_BER_test3-1.i[33021,33034] [2022-02-20 23:24:23,611 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_BER_test3-1.i[44590,44603] [2022-02-20 23:24:23,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:24:23,659 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:24:23,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:23 WrapperNode [2022-02-20 23:24:23,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:24:23,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:24:23,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:24:23,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:24:23,666 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:24:23" (1/1) ... [2022-02-20 23:24:23,698 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:24:23" (1/1) ... [2022-02-20 23:24:23,789 INFO L137 Inliner]: procedures = 177, calls = 285, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1026 [2022-02-20 23:24:23,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:24:23,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:24:23,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:24:23,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:24:23,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:23" (1/1) ... [2022-02-20 23:24:23,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:23" (1/1) ... [2022-02-20 23:24:23,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:23" (1/1) ... [2022-02-20 23:24:23,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:23" (1/1) ... [2022-02-20 23:24:23,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:23" (1/1) ... [2022-02-20 23:24:23,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:23" (1/1) ... [2022-02-20 23:24:23,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:23" (1/1) ... [2022-02-20 23:24:23,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:24:23,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:24:23,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:24:23,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:24:23,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:23" (1/1) ... [2022-02-20 23:24:23,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:24:23,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:23,908 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:24:23,929 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:24:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:24:23,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 23:24:23,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 23:24:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:24:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 23:24:23,952 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 23:24:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:24:23,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:24:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:24:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:24:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-20 23:24:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:24:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:24:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:24:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:24:23,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:24:24,128 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:24:24,129 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:24:25,723 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:24:25,730 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:24:25,731 INFO L299 CfgBuilder]: Removed 63 assume(true) statements. [2022-02-20 23:24:25,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:24:25 BoogieIcfgContainer [2022-02-20 23:24:25,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:24:25,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:24:25,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:24:25,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:24:25,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:24:23" (1/3) ... [2022-02-20 23:24:25,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2350a664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:24:25, skipping insertion in model container [2022-02-20 23:24:25,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:23" (2/3) ... [2022-02-20 23:24:25,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2350a664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:24:25, skipping insertion in model container [2022-02-20 23:24:25,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:24:25" (3/3) ... [2022-02-20 23:24:25,738 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test3-1.i [2022-02-20 23:24:25,742 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:24:25,742 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 23:24:25,774 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:24:25,778 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:24:25,779 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 23:24:25,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 189 states have (on average 1.693121693121693) internal successors, (320), 196 states have internal predecessors, (320), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:24:25,800 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:25,801 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:24:25,801 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:25,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:25,805 INFO L85 PathProgramCache]: Analyzing trace with hash -858857507, now seen corresponding path program 1 times [2022-02-20 23:24:25,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:25,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074773352] [2022-02-20 23:24:25,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:25,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:25,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {205#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);~count_int_int~0 := 0; {205#true} is VALID [2022-02-20 23:24:25,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#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, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#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~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1.base, main_#t~mem190#1.offset, main_#t~short191#1, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, 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, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem214#1, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1.base, main_#t~mem216#1.offset, main_#t~mem217#1, main_#t~post218#1, main_#t~mem219#1.base, main_#t~mem219#1.offset, 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.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1, main_#t~post229#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem144#1, main_#t~mem145#1, main_#t~mem231#1, main_#t~mem232#1, main_#t~mem230#1.base, main_#t~mem230#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); {205#true} is VALID [2022-02-20 23:24:25,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {205#true} assume !true; {206#false} is VALID [2022-02-20 23:24:25,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {206#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {206#false} is VALID [2022-02-20 23:24:25,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {206#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {206#false} is VALID [2022-02-20 23:24:25,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#false} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {206#false} is VALID [2022-02-20 23:24:25,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {206#false} assume !true; {206#false} is VALID [2022-02-20 23:24:25,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {206#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {206#false} is VALID [2022-02-20 23:24:25,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {206#false} assume !false; {206#false} is VALID [2022-02-20 23:24:25,942 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:24:25,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:25,943 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074773352] [2022-02-20 23:24:25,943 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074773352] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:25,944 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:25,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:24:25,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548614940] [2022-02-20 23:24:25,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:25,950 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 23:24:25,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:25,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:24:25,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:25,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:24:25,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:25,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:24:25,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:24:25,986 INFO L87 Difference]: Start difference. First operand has 202 states, 189 states have (on average 1.693121693121693) internal successors, (320), 196 states have internal predecessors, (320), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:24:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:26,274 INFO L93 Difference]: Finished difference Result 402 states and 675 transitions. [2022-02-20 23:24:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:24:26,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 23:24:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:24:26,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 675 transitions. [2022-02-20 23:24:26,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:24:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 675 transitions. [2022-02-20 23:24:26,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 675 transitions. [2022-02-20 23:24:26,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 675 edges. 675 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:26,822 INFO L225 Difference]: With dead ends: 402 [2022-02-20 23:24:26,822 INFO L226 Difference]: Without dead ends: 198 [2022-02-20 23:24:26,825 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:24:26,828 INFO L933 BasicCegarLoop]: 267 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, 267 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:24:26,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:24:26,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-02-20 23:24:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-02-20 23:24:26,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:26,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 198 states, 186 states have (on average 1.3279569892473118) internal successors, (247), 192 states have internal predecessors, (247), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:26,858 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 198 states, 186 states have (on average 1.3279569892473118) internal successors, (247), 192 states have internal predecessors, (247), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:26,859 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 198 states, 186 states have (on average 1.3279569892473118) internal successors, (247), 192 states have internal predecessors, (247), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:26,865 INFO L93 Difference]: Finished difference Result 198 states and 263 transitions. [2022-02-20 23:24:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 263 transitions. [2022-02-20 23:24:26,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:26,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:26,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 186 states have (on average 1.3279569892473118) internal successors, (247), 192 states have internal predecessors, (247), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 198 states. [2022-02-20 23:24:26,868 INFO L87 Difference]: Start difference. First operand has 198 states, 186 states have (on average 1.3279569892473118) internal successors, (247), 192 states have internal predecessors, (247), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 198 states. [2022-02-20 23:24:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:26,875 INFO L93 Difference]: Finished difference Result 198 states and 263 transitions. [2022-02-20 23:24:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 263 transitions. [2022-02-20 23:24:26,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:26,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:26,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:26,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 186 states have (on average 1.3279569892473118) internal successors, (247), 192 states have internal predecessors, (247), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 263 transitions. [2022-02-20 23:24:26,884 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 263 transitions. Word has length 9 [2022-02-20 23:24:26,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:26,885 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 263 transitions. [2022-02-20 23:24:26,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:24:26,885 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 263 transitions. [2022-02-20 23:24:26,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:24:26,886 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:26,886 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:24:26,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:24:26,887 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:26,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:26,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1463774514, now seen corresponding path program 1 times [2022-02-20 23:24:26,887 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:26,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036941129] [2022-02-20 23:24:26,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:26,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:26,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {1327#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);~count_int_int~0 := 0; {1327#true} is VALID [2022-02-20 23:24:26,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#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, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#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~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1.base, main_#t~mem190#1.offset, main_#t~short191#1, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, 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, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem214#1, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1.base, main_#t~mem216#1.offset, main_#t~mem217#1, main_#t~post218#1, main_#t~mem219#1.base, main_#t~mem219#1.offset, 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.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1, main_#t~post229#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem144#1, main_#t~mem145#1, main_#t~mem231#1, main_#t~mem232#1, main_#t~mem230#1.base, main_#t~mem230#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); {1329#(= (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:24:26,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {1329#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1330#(= |ULTIMATE.start_main_#t~mem7#1| 0)} is VALID [2022-02-20 23:24:26,959 INFO L290 TraceCheckUtils]: 3: Hoare triple {1330#(= |ULTIMATE.start_main_#t~mem7#1| 0)} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {1328#false} is VALID [2022-02-20 23:24:26,959 INFO L290 TraceCheckUtils]: 4: Hoare triple {1328#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1328#false} is VALID [2022-02-20 23:24:26,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {1328#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1328#false} is VALID [2022-02-20 23:24:26,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {1328#false} assume !(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {1328#false} is VALID [2022-02-20 23:24:26,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {1328#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {1328#false} is VALID [2022-02-20 23:24:26,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {1328#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem231#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem232#1 := read~int(main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);assume { :begin_inline_test_int_int } true;test_int_int_#in~a#1, test_int_int_#in~b#1 := main_#t~mem231#1, main_#t~mem232#1;havoc test_int_int_#t~post3#1, test_int_int_#t~switch4#1, test_int_int_~a#1, test_int_int_~b#1;test_int_int_~a#1 := test_int_int_#in~a#1;test_int_int_~b#1 := test_int_int_#in~b#1;test_int_int_#t~post3#1 := ~count_int_int~0;~count_int_int~0 := 1 + test_int_int_#t~post3#1;test_int_int_#t~switch4#1 := 0 == test_int_int_#t~post3#1; {1328#false} is VALID [2022-02-20 23:24:26,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {1328#false} assume test_int_int_#t~switch4#1; {1328#false} is VALID [2022-02-20 23:24:26,960 INFO L272 TraceCheckUtils]: 10: Hoare triple {1328#false} call __VERIFIER_assert((if 1 == test_int_int_~a#1 && 1 == test_int_int_~b#1 then 1 else 0)); {1328#false} is VALID [2022-02-20 23:24:26,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {1328#false} ~cond := #in~cond; {1328#false} is VALID [2022-02-20 23:24:26,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {1328#false} assume 0 == ~cond; {1328#false} is VALID [2022-02-20 23:24:26,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {1328#false} assume !false; {1328#false} is VALID [2022-02-20 23:24:26,961 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:24:26,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:26,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036941129] [2022-02-20 23:24:26,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036941129] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:26,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:26,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:24:26,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153989873] [2022-02-20 23:24:26,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:26,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:24:26,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:26,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:26,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:26,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:24:26,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:26,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:24:26,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:24:26,991 INFO L87 Difference]: Start difference. First operand 198 states and 263 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:28,085 INFO L93 Difference]: Finished difference Result 431 states and 581 transitions. [2022-02-20 23:24:28,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:24:28,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:24:28,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 581 transitions. [2022-02-20 23:24:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:28,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 581 transitions. [2022-02-20 23:24:28,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 581 transitions. [2022-02-20 23:24:28,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 581 edges. 581 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:28,552 INFO L225 Difference]: With dead ends: 431 [2022-02-20 23:24:28,552 INFO L226 Difference]: Without dead ends: 327 [2022-02-20 23:24:28,553 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:24:28,554 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 158 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:24:28,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 653 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:24:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-02-20 23:24:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 200. [2022-02-20 23:24:28,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:28,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 327 states. Second operand has 200 states, 188 states have (on average 1.324468085106383) internal successors, (249), 194 states have internal predecessors, (249), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:28,567 INFO L74 IsIncluded]: Start isIncluded. First operand 327 states. Second operand has 200 states, 188 states have (on average 1.324468085106383) internal successors, (249), 194 states have internal predecessors, (249), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:28,568 INFO L87 Difference]: Start difference. First operand 327 states. Second operand has 200 states, 188 states have (on average 1.324468085106383) internal successors, (249), 194 states have internal predecessors, (249), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:28,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:28,581 INFO L93 Difference]: Finished difference Result 327 states and 439 transitions. [2022-02-20 23:24:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 439 transitions. [2022-02-20 23:24:28,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:28,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:28,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 188 states have (on average 1.324468085106383) internal successors, (249), 194 states have internal predecessors, (249), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 327 states. [2022-02-20 23:24:28,584 INFO L87 Difference]: Start difference. First operand has 200 states, 188 states have (on average 1.324468085106383) internal successors, (249), 194 states have internal predecessors, (249), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 327 states. [2022-02-20 23:24:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:28,596 INFO L93 Difference]: Finished difference Result 327 states and 439 transitions. [2022-02-20 23:24:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 439 transitions. [2022-02-20 23:24:28,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:28,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:28,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:28,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 188 states have (on average 1.324468085106383) internal successors, (249), 194 states have internal predecessors, (249), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:28,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 265 transitions. [2022-02-20 23:24:28,604 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 265 transitions. Word has length 14 [2022-02-20 23:24:28,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:28,605 INFO L470 AbstractCegarLoop]: Abstraction has 200 states and 265 transitions. [2022-02-20 23:24:28,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:28,605 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 265 transitions. [2022-02-20 23:24:28,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 23:24:28,606 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:28,607 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, 1, 1, 1, 1] [2022-02-20 23:24:28,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:24:28,607 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:28,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:28,608 INFO L85 PathProgramCache]: Analyzing trace with hash -921461318, now seen corresponding path program 1 times [2022-02-20 23:24:28,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:28,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192750007] [2022-02-20 23:24:28,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:28,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:28,714 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:28,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1928781841] [2022-02-20 23:24:28,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:28,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:28,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:28,761 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:24:28,768 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:24:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:29,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:24:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:29,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:29,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {2749#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);~count_int_int~0 := 0; {2749#true} is VALID [2022-02-20 23:24:29,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {2749#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#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, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#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~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1.base, main_#t~mem190#1.offset, main_#t~short191#1, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, 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, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem214#1, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1.base, main_#t~mem216#1.offset, main_#t~mem217#1, main_#t~post218#1, main_#t~mem219#1.base, main_#t~mem219#1.offset, 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.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1, main_#t~post229#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem144#1, main_#t~mem145#1, main_#t~mem231#1, main_#t~mem232#1, main_#t~mem230#1.base, main_#t~mem230#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); {2749#true} is VALID [2022-02-20 23:24:29,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {2749#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2749#true} is VALID [2022-02-20 23:24:29,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {2749#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {2749#true} is VALID [2022-02-20 23:24:29,387 INFO L290 TraceCheckUtils]: 4: Hoare triple {2749#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {2749#true} is VALID [2022-02-20 23:24:29,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {2749#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {2749#true} is VALID [2022-02-20 23:24:29,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {2749#true} havoc main_~_ha_hashv~0#1; {2749#true} is VALID [2022-02-20 23:24:29,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {2749#true} goto; {2749#true} is VALID [2022-02-20 23:24:29,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {2749#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; {2749#true} is VALID [2022-02-20 23:24:29,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {2749#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {2749#true} is VALID [2022-02-20 23:24:29,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {2749#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {2749#true} is VALID [2022-02-20 23:24:29,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {2749#true} assume main_#t~switch24#1;call main_#t~mem25#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~mem25#1 % 256);havoc main_#t~mem25#1; {2749#true} is VALID [2022-02-20 23:24:29,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {2749#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {2749#true} is VALID [2022-02-20 23:24:29,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {2749#true} assume main_#t~switch24#1;call main_#t~mem26#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~mem26#1 % 256);havoc main_#t~mem26#1; {2749#true} is VALID [2022-02-20 23:24:29,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {2749#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {2749#true} is VALID [2022-02-20 23:24:29,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {2749#true} assume main_#t~switch24#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {2749#true} is VALID [2022-02-20 23:24:29,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {2749#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {2749#true} is VALID [2022-02-20 23:24:29,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {2749#true} assume main_#t~switch24#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {2805#|ULTIMATE.start_main_#t~switch24#1|} is VALID [2022-02-20 23:24:29,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {2805#|ULTIMATE.start_main_#t~switch24#1|} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {2805#|ULTIMATE.start_main_#t~switch24#1|} is VALID [2022-02-20 23:24:29,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {2805#|ULTIMATE.start_main_#t~switch24#1|} assume !main_#t~switch24#1; {2750#false} is VALID [2022-02-20 23:24:29,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {2750#false} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {2750#false} is VALID [2022-02-20 23:24:29,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {2750#false} assume main_#t~switch24#1;call main_#t~mem30#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~mem30#1 % 256);havoc main_#t~mem30#1; {2750#false} is VALID [2022-02-20 23:24:29,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {2750#false} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {2750#false} is VALID [2022-02-20 23:24:29,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {2750#false} assume main_#t~switch24#1;call main_#t~mem31#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~mem31#1 % 256;havoc main_#t~mem31#1; {2750#false} is VALID [2022-02-20 23:24:29,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {2750#false} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {2750#false} is VALID [2022-02-20 23:24:29,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {2750#false} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {2750#false} is VALID [2022-02-20 23:24:29,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {2750#false} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {2750#false} is VALID [2022-02-20 23:24:29,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {2750#false} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {2750#false} is VALID [2022-02-20 23:24:29,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {2750#false} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {2750#false} is VALID [2022-02-20 23:24:29,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {2750#false} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {2750#false} is VALID [2022-02-20 23:24:29,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {2750#false} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {2750#false} is VALID [2022-02-20 23:24:29,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {2750#false} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {2750#false} is VALID [2022-02-20 23:24:29,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {2750#false} havoc main_#t~switch24#1; {2750#false} is VALID [2022-02-20 23:24:29,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {2750#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)))); {2750#false} is VALID [2022-02-20 23:24:29,397 INFO L290 TraceCheckUtils]: 34: Hoare triple {2750#false} goto; {2750#false} is VALID [2022-02-20 23:24:29,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {2750#false} goto; {2750#false} is VALID [2022-02-20 23:24:29,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {2750#false} goto; {2750#false} is VALID [2022-02-20 23:24:29,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {2750#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); {2750#false} is VALID [2022-02-20 23:24:29,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {2750#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {2750#false} is VALID [2022-02-20 23:24:29,398 INFO L290 TraceCheckUtils]: 39: Hoare triple {2750#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {2750#false} is VALID [2022-02-20 23:24:29,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {2750#false} goto; {2750#false} is VALID [2022-02-20 23:24:29,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {2750#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {2750#false} is VALID [2022-02-20 23:24:29,398 INFO L290 TraceCheckUtils]: 42: Hoare triple {2750#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {2750#false} is VALID [2022-02-20 23:24:29,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {2750#false} goto; {2750#false} is VALID [2022-02-20 23:24:29,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {2750#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {2750#false} is VALID [2022-02-20 23:24:29,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {2750#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {2750#false} is VALID [2022-02-20 23:24:29,399 INFO L290 TraceCheckUtils]: 46: Hoare triple {2750#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {2750#false} is VALID [2022-02-20 23:24:29,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {2750#false} assume main_#t~short77#1;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 main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {2750#false} is VALID [2022-02-20 23:24:29,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {2750#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {2750#false} is VALID [2022-02-20 23:24:29,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {2750#false} goto; {2750#false} is VALID [2022-02-20 23:24:29,400 INFO L290 TraceCheckUtils]: 50: Hoare triple {2750#false} goto; {2750#false} is VALID [2022-02-20 23:24:29,400 INFO L290 TraceCheckUtils]: 51: Hoare triple {2750#false} goto; {2750#false} is VALID [2022-02-20 23:24:29,400 INFO L290 TraceCheckUtils]: 52: Hoare triple {2750#false} goto; {2750#false} is VALID [2022-02-20 23:24:29,401 INFO L290 TraceCheckUtils]: 53: Hoare triple {2750#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {2750#false} is VALID [2022-02-20 23:24:29,401 INFO L290 TraceCheckUtils]: 54: Hoare triple {2750#false} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2750#false} is VALID [2022-02-20 23:24:29,401 INFO L290 TraceCheckUtils]: 55: Hoare triple {2750#false} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {2750#false} is VALID [2022-02-20 23:24:29,401 INFO L290 TraceCheckUtils]: 56: Hoare triple {2750#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2750#false} is VALID [2022-02-20 23:24:29,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {2750#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2750#false} is VALID [2022-02-20 23:24:29,402 INFO L290 TraceCheckUtils]: 58: Hoare triple {2750#false} assume !(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {2750#false} is VALID [2022-02-20 23:24:29,402 INFO L290 TraceCheckUtils]: 59: Hoare triple {2750#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {2750#false} is VALID [2022-02-20 23:24:29,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {2750#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem231#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem232#1 := read~int(main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);assume { :begin_inline_test_int_int } true;test_int_int_#in~a#1, test_int_int_#in~b#1 := main_#t~mem231#1, main_#t~mem232#1;havoc test_int_int_#t~post3#1, test_int_int_#t~switch4#1, test_int_int_~a#1, test_int_int_~b#1;test_int_int_~a#1 := test_int_int_#in~a#1;test_int_int_~b#1 := test_int_int_#in~b#1;test_int_int_#t~post3#1 := ~count_int_int~0;~count_int_int~0 := 1 + test_int_int_#t~post3#1;test_int_int_#t~switch4#1 := 0 == test_int_int_#t~post3#1; {2750#false} is VALID [2022-02-20 23:24:29,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {2750#false} assume test_int_int_#t~switch4#1; {2750#false} is VALID [2022-02-20 23:24:29,402 INFO L272 TraceCheckUtils]: 62: Hoare triple {2750#false} call __VERIFIER_assert((if 1 == test_int_int_~a#1 && 1 == test_int_int_~b#1 then 1 else 0)); {2750#false} is VALID [2022-02-20 23:24:29,402 INFO L290 TraceCheckUtils]: 63: Hoare triple {2750#false} ~cond := #in~cond; {2750#false} is VALID [2022-02-20 23:24:29,403 INFO L290 TraceCheckUtils]: 64: Hoare triple {2750#false} assume 0 == ~cond; {2750#false} is VALID [2022-02-20 23:24:29,403 INFO L290 TraceCheckUtils]: 65: Hoare triple {2750#false} assume !false; {2750#false} is VALID [2022-02-20 23:24:29,403 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:24:29,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:29,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:29,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192750007] [2022-02-20 23:24:29,404 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:29,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928781841] [2022-02-20 23:24:29,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928781841] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:29,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:29,405 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:24:29,405 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904764599] [2022-02-20 23:24:29,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:29,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 23:24:29,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:29,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:29,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:29,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:24:29,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:29,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:24:29,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:24:29,449 INFO L87 Difference]: Start difference. First operand 200 states and 265 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:29,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:29,902 INFO L93 Difference]: Finished difference Result 417 states and 557 transitions. [2022-02-20 23:24:29,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:24:29,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 23:24:29,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2022-02-20 23:24:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2022-02-20 23:24:29,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 555 transitions. [2022-02-20 23:24:30,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 555 edges. 555 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:30,311 INFO L225 Difference]: With dead ends: 417 [2022-02-20 23:24:30,311 INFO L226 Difference]: Without dead ends: 221 [2022-02-20 23:24:30,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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:24:30,313 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 9 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 471 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:24:30,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 471 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:24:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-02-20 23:24:30,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2022-02-20 23:24:30,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:30,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 220 states, 208 states have (on average 1.2932692307692308) internal successors, (269), 214 states have internal predecessors, (269), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:30,321 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 220 states, 208 states have (on average 1.2932692307692308) internal successors, (269), 214 states have internal predecessors, (269), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:30,321 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 220 states, 208 states have (on average 1.2932692307692308) internal successors, (269), 214 states have internal predecessors, (269), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:30,327 INFO L93 Difference]: Finished difference Result 221 states and 286 transitions. [2022-02-20 23:24:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 286 transitions. [2022-02-20 23:24:30,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:30,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:30,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 220 states, 208 states have (on average 1.2932692307692308) internal successors, (269), 214 states have internal predecessors, (269), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 221 states. [2022-02-20 23:24:30,329 INFO L87 Difference]: Start difference. First operand has 220 states, 208 states have (on average 1.2932692307692308) internal successors, (269), 214 states have internal predecessors, (269), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 221 states. [2022-02-20 23:24:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:30,334 INFO L93 Difference]: Finished difference Result 221 states and 286 transitions. [2022-02-20 23:24:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 286 transitions. [2022-02-20 23:24:30,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:30,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:30,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:30,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 208 states have (on average 1.2932692307692308) internal successors, (269), 214 states have internal predecessors, (269), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 285 transitions. [2022-02-20 23:24:30,341 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 285 transitions. Word has length 66 [2022-02-20 23:24:30,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:30,341 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 285 transitions. [2022-02-20 23:24:30,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:30,342 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 285 transitions. [2022-02-20 23:24:30,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 23:24:30,343 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:30,343 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, 1, 1, 1, 1] [2022-02-20 23:24:30,366 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:24:30,567 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:24:30,567 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:30,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:30,568 INFO L85 PathProgramCache]: Analyzing trace with hash -568372936, now seen corresponding path program 1 times [2022-02-20 23:24:30,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:30,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451708063] [2022-02-20 23:24:30,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:30,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:30,669 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:30,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1289606913] [2022-02-20 23:24:30,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:30,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:30,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:30,687 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:24:30,688 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:24:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:31,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 1601 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:24:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:31,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:31,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {4150#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);~count_int_int~0 := 0; {4150#true} is VALID [2022-02-20 23:24:31,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {4150#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#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, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#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~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1.base, main_#t~mem190#1.offset, main_#t~short191#1, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, 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, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem214#1, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1.base, main_#t~mem216#1.offset, main_#t~mem217#1, main_#t~post218#1, main_#t~mem219#1.base, main_#t~mem219#1.offset, 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.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1, main_#t~post229#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem144#1, main_#t~mem145#1, main_#t~mem231#1, main_#t~mem232#1, main_#t~mem230#1.base, main_#t~mem230#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); {4150#true} is VALID [2022-02-20 23:24:31,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {4150#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4150#true} is VALID [2022-02-20 23:24:31,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {4150#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {4150#true} is VALID [2022-02-20 23:24:31,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {4150#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {4150#true} is VALID [2022-02-20 23:24:31,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {4150#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {4150#true} is VALID [2022-02-20 23:24:31,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {4150#true} havoc main_~_ha_hashv~0#1; {4150#true} is VALID [2022-02-20 23:24:31,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {4150#true} goto; {4150#true} is VALID [2022-02-20 23:24:31,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {4150#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; {4179#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-20 23:24:31,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {4179#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {4179#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-20 23:24:31,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {4179#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {4186#(not |ULTIMATE.start_main_#t~switch24#1|)} is VALID [2022-02-20 23:24:31,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {4186#(not |ULTIMATE.start_main_#t~switch24#1|)} assume main_#t~switch24#1;call main_#t~mem25#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~mem25#1 % 256);havoc main_#t~mem25#1; {4151#false} is VALID [2022-02-20 23:24:31,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {4151#false} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {4151#false} is VALID [2022-02-20 23:24:31,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {4151#false} assume main_#t~switch24#1;call main_#t~mem26#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~mem26#1 % 256);havoc main_#t~mem26#1; {4151#false} is VALID [2022-02-20 23:24:31,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {4151#false} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {4151#false} is VALID [2022-02-20 23:24:31,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {4151#false} assume main_#t~switch24#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {4151#false} is VALID [2022-02-20 23:24:31,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {4151#false} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {4151#false} is VALID [2022-02-20 23:24:31,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {4151#false} assume main_#t~switch24#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {4151#false} is VALID [2022-02-20 23:24:31,440 INFO L290 TraceCheckUtils]: 18: Hoare triple {4151#false} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {4151#false} is VALID [2022-02-20 23:24:31,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {4151#false} assume main_#t~switch24#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {4151#false} is VALID [2022-02-20 23:24:31,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {4151#false} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {4151#false} is VALID [2022-02-20 23:24:31,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {4151#false} assume main_#t~switch24#1;call main_#t~mem30#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~mem30#1 % 256);havoc main_#t~mem30#1; {4151#false} is VALID [2022-02-20 23:24:31,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {4151#false} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {4151#false} is VALID [2022-02-20 23:24:31,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {4151#false} assume main_#t~switch24#1;call main_#t~mem31#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~mem31#1 % 256;havoc main_#t~mem31#1; {4151#false} is VALID [2022-02-20 23:24:31,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {4151#false} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {4151#false} is VALID [2022-02-20 23:24:31,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {4151#false} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {4151#false} is VALID [2022-02-20 23:24:31,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {4151#false} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {4151#false} is VALID [2022-02-20 23:24:31,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {4151#false} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {4151#false} is VALID [2022-02-20 23:24:31,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {4151#false} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {4151#false} is VALID [2022-02-20 23:24:31,443 INFO L290 TraceCheckUtils]: 29: Hoare triple {4151#false} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {4151#false} is VALID [2022-02-20 23:24:31,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {4151#false} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {4151#false} is VALID [2022-02-20 23:24:31,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {4151#false} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {4151#false} is VALID [2022-02-20 23:24:31,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {4151#false} havoc main_#t~switch24#1; {4151#false} is VALID [2022-02-20 23:24:31,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {4151#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)))); {4151#false} is VALID [2022-02-20 23:24:31,444 INFO L290 TraceCheckUtils]: 34: Hoare triple {4151#false} goto; {4151#false} is VALID [2022-02-20 23:24:31,444 INFO L290 TraceCheckUtils]: 35: Hoare triple {4151#false} goto; {4151#false} is VALID [2022-02-20 23:24:31,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {4151#false} goto; {4151#false} is VALID [2022-02-20 23:24:31,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {4151#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); {4151#false} is VALID [2022-02-20 23:24:31,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {4151#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {4151#false} is VALID [2022-02-20 23:24:31,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {4151#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {4151#false} is VALID [2022-02-20 23:24:31,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {4151#false} goto; {4151#false} is VALID [2022-02-20 23:24:31,445 INFO L290 TraceCheckUtils]: 41: Hoare triple {4151#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {4151#false} is VALID [2022-02-20 23:24:31,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {4151#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {4151#false} is VALID [2022-02-20 23:24:31,446 INFO L290 TraceCheckUtils]: 43: Hoare triple {4151#false} goto; {4151#false} is VALID [2022-02-20 23:24:31,446 INFO L290 TraceCheckUtils]: 44: Hoare triple {4151#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {4151#false} is VALID [2022-02-20 23:24:31,446 INFO L290 TraceCheckUtils]: 45: Hoare triple {4151#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {4151#false} is VALID [2022-02-20 23:24:31,446 INFO L290 TraceCheckUtils]: 46: Hoare triple {4151#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {4151#false} is VALID [2022-02-20 23:24:31,447 INFO L290 TraceCheckUtils]: 47: Hoare triple {4151#false} assume main_#t~short77#1;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 main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {4151#false} is VALID [2022-02-20 23:24:31,447 INFO L290 TraceCheckUtils]: 48: Hoare triple {4151#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {4151#false} is VALID [2022-02-20 23:24:31,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {4151#false} goto; {4151#false} is VALID [2022-02-20 23:24:31,447 INFO L290 TraceCheckUtils]: 50: Hoare triple {4151#false} goto; {4151#false} is VALID [2022-02-20 23:24:31,447 INFO L290 TraceCheckUtils]: 51: Hoare triple {4151#false} goto; {4151#false} is VALID [2022-02-20 23:24:31,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {4151#false} goto; {4151#false} is VALID [2022-02-20 23:24:31,448 INFO L290 TraceCheckUtils]: 53: Hoare triple {4151#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {4151#false} is VALID [2022-02-20 23:24:31,448 INFO L290 TraceCheckUtils]: 54: Hoare triple {4151#false} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4151#false} is VALID [2022-02-20 23:24:31,448 INFO L290 TraceCheckUtils]: 55: Hoare triple {4151#false} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {4151#false} is VALID [2022-02-20 23:24:31,448 INFO L290 TraceCheckUtils]: 56: Hoare triple {4151#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4151#false} is VALID [2022-02-20 23:24:31,448 INFO L290 TraceCheckUtils]: 57: Hoare triple {4151#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {4151#false} is VALID [2022-02-20 23:24:31,448 INFO L290 TraceCheckUtils]: 58: Hoare triple {4151#false} assume !(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {4151#false} is VALID [2022-02-20 23:24:31,449 INFO L290 TraceCheckUtils]: 59: Hoare triple {4151#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {4151#false} is VALID [2022-02-20 23:24:31,449 INFO L290 TraceCheckUtils]: 60: Hoare triple {4151#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem231#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem232#1 := read~int(main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);assume { :begin_inline_test_int_int } true;test_int_int_#in~a#1, test_int_int_#in~b#1 := main_#t~mem231#1, main_#t~mem232#1;havoc test_int_int_#t~post3#1, test_int_int_#t~switch4#1, test_int_int_~a#1, test_int_int_~b#1;test_int_int_~a#1 := test_int_int_#in~a#1;test_int_int_~b#1 := test_int_int_#in~b#1;test_int_int_#t~post3#1 := ~count_int_int~0;~count_int_int~0 := 1 + test_int_int_#t~post3#1;test_int_int_#t~switch4#1 := 0 == test_int_int_#t~post3#1; {4151#false} is VALID [2022-02-20 23:24:31,449 INFO L290 TraceCheckUtils]: 61: Hoare triple {4151#false} assume test_int_int_#t~switch4#1; {4151#false} is VALID [2022-02-20 23:24:31,449 INFO L272 TraceCheckUtils]: 62: Hoare triple {4151#false} call __VERIFIER_assert((if 1 == test_int_int_~a#1 && 1 == test_int_int_~b#1 then 1 else 0)); {4151#false} is VALID [2022-02-20 23:24:31,449 INFO L290 TraceCheckUtils]: 63: Hoare triple {4151#false} ~cond := #in~cond; {4151#false} is VALID [2022-02-20 23:24:31,449 INFO L290 TraceCheckUtils]: 64: Hoare triple {4151#false} assume 0 == ~cond; {4151#false} is VALID [2022-02-20 23:24:31,450 INFO L290 TraceCheckUtils]: 65: Hoare triple {4151#false} assume !false; {4151#false} is VALID [2022-02-20 23:24:31,450 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:24:31,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:31,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:31,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451708063] [2022-02-20 23:24:31,451 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:31,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289606913] [2022-02-20 23:24:31,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289606913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:31,451 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:31,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:24:31,451 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586357622] [2022-02-20 23:24:31,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:31,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 23:24:31,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:31,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:31,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:31,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:24:31,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:31,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:24:31,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:24:31,502 INFO L87 Difference]: Start difference. First operand 220 states and 285 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:32,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:32,083 INFO L93 Difference]: Finished difference Result 428 states and 558 transitions. [2022-02-20 23:24:32,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:24:32,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 23:24:32,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2022-02-20 23:24:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:32,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2022-02-20 23:24:32,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 535 transitions. [2022-02-20 23:24:32,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:32,488 INFO L225 Difference]: With dead ends: 428 [2022-02-20 23:24:32,488 INFO L226 Difference]: Without dead ends: 212 [2022-02-20 23:24:32,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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:24:32,489 INFO L933 BasicCegarLoop]: 243 mSDtfsCounter, 226 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 499 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:24:32,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 499 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:24:32,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-02-20 23:24:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206. [2022-02-20 23:24:32,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:32,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 206 states, 194 states have (on average 1.2783505154639174) internal successors, (248), 200 states have internal predecessors, (248), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:32,512 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 206 states, 194 states have (on average 1.2783505154639174) internal successors, (248), 200 states have internal predecessors, (248), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:32,515 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 206 states, 194 states have (on average 1.2783505154639174) internal successors, (248), 200 states have internal predecessors, (248), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:32,519 INFO L93 Difference]: Finished difference Result 212 states and 270 transitions. [2022-02-20 23:24:32,519 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 270 transitions. [2022-02-20 23:24:32,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:32,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:32,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 194 states have (on average 1.2783505154639174) internal successors, (248), 200 states have internal predecessors, (248), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 212 states. [2022-02-20 23:24:32,520 INFO L87 Difference]: Start difference. First operand has 206 states, 194 states have (on average 1.2783505154639174) internal successors, (248), 200 states have internal predecessors, (248), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 212 states. [2022-02-20 23:24:32,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:32,525 INFO L93 Difference]: Finished difference Result 212 states and 270 transitions. [2022-02-20 23:24:32,525 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 270 transitions. [2022-02-20 23:24:32,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:32,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:32,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:32,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 194 states have (on average 1.2783505154639174) internal successors, (248), 200 states have internal predecessors, (248), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 264 transitions. [2022-02-20 23:24:32,529 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 264 transitions. Word has length 66 [2022-02-20 23:24:32,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:32,530 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 264 transitions. [2022-02-20 23:24:32,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:32,530 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 264 transitions. [2022-02-20 23:24:32,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-20 23:24:32,530 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:32,531 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, 1, 1, 1, 1] [2022-02-20 23:24:32,553 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:24:32,738 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:24:32,738 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:32,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:32,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1138787002, now seen corresponding path program 1 times [2022-02-20 23:24:32,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:32,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215545683] [2022-02-20 23:24:32,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:32,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:32,810 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:32,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582773708] [2022-02-20 23:24:32,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:32,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:32,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:32,812 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:24:32,813 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:24:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:33,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 1587 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:24:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:33,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:33,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {5536#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);~count_int_int~0 := 0; {5536#true} is VALID [2022-02-20 23:24:33,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {5536#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#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, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#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~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1.base, main_#t~mem190#1.offset, main_#t~short191#1, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, 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, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem214#1, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1.base, main_#t~mem216#1.offset, main_#t~mem217#1, main_#t~post218#1, main_#t~mem219#1.base, main_#t~mem219#1.offset, 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.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1, main_#t~post229#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem144#1, main_#t~mem145#1, main_#t~mem231#1, main_#t~mem232#1, main_#t~mem230#1.base, main_#t~mem230#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); {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,712 INFO L290 TraceCheckUtils]: 3: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {5544#(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); {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {5544#(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; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {5544#(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); {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {5544#(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~switch24#1 := 11 == main_~_hj_k~0#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch24#1; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {5544#(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)))); {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {5544#(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); {5544#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:33,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {5544#(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~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {5537#false} is VALID [2022-02-20 23:24:33,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {5537#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#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~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {5537#false} is VALID [2022-02-20 23:24:33,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {5537#false} goto; {5537#false} is VALID [2022-02-20 23:24:33,737 INFO L290 TraceCheckUtils]: 41: Hoare triple {5537#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {5537#false} is VALID [2022-02-20 23:24:33,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {5537#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {5537#false} is VALID [2022-02-20 23:24:33,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {5537#false} goto; {5537#false} is VALID [2022-02-20 23:24:33,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {5537#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {5537#false} is VALID [2022-02-20 23:24:33,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {5537#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {5537#false} is VALID [2022-02-20 23:24:33,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {5537#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {5537#false} is VALID [2022-02-20 23:24:33,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {5537#false} assume main_#t~short77#1;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 main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {5537#false} is VALID [2022-02-20 23:24:33,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {5537#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {5537#false} is VALID [2022-02-20 23:24:33,742 INFO L290 TraceCheckUtils]: 49: Hoare triple {5537#false} goto; {5537#false} is VALID [2022-02-20 23:24:33,742 INFO L290 TraceCheckUtils]: 50: Hoare triple {5537#false} goto; {5537#false} is VALID [2022-02-20 23:24:33,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {5537#false} goto; {5537#false} is VALID [2022-02-20 23:24:33,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {5537#false} goto; {5537#false} is VALID [2022-02-20 23:24:33,742 INFO L290 TraceCheckUtils]: 53: Hoare triple {5537#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {5537#false} is VALID [2022-02-20 23:24:33,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {5537#false} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5537#false} is VALID [2022-02-20 23:24:33,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {5537#false} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {5537#false} is VALID [2022-02-20 23:24:33,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {5537#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5537#false} is VALID [2022-02-20 23:24:33,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {5537#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5537#false} is VALID [2022-02-20 23:24:33,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {5537#false} assume !(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {5537#false} is VALID [2022-02-20 23:24:33,743 INFO L290 TraceCheckUtils]: 59: Hoare triple {5537#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {5537#false} is VALID [2022-02-20 23:24:33,743 INFO L290 TraceCheckUtils]: 60: Hoare triple {5537#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem231#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem232#1 := read~int(main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);assume { :begin_inline_test_int_int } true;test_int_int_#in~a#1, test_int_int_#in~b#1 := main_#t~mem231#1, main_#t~mem232#1;havoc test_int_int_#t~post3#1, test_int_int_#t~switch4#1, test_int_int_~a#1, test_int_int_~b#1;test_int_int_~a#1 := test_int_int_#in~a#1;test_int_int_~b#1 := test_int_int_#in~b#1;test_int_int_#t~post3#1 := ~count_int_int~0;~count_int_int~0 := 1 + test_int_int_#t~post3#1;test_int_int_#t~switch4#1 := 0 == test_int_int_#t~post3#1; {5537#false} is VALID [2022-02-20 23:24:33,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {5537#false} assume test_int_int_#t~switch4#1; {5537#false} is VALID [2022-02-20 23:24:33,745 INFO L272 TraceCheckUtils]: 62: Hoare triple {5537#false} call __VERIFIER_assert((if 1 == test_int_int_~a#1 && 1 == test_int_int_~b#1 then 1 else 0)); {5537#false} is VALID [2022-02-20 23:24:33,745 INFO L290 TraceCheckUtils]: 63: Hoare triple {5537#false} ~cond := #in~cond; {5537#false} is VALID [2022-02-20 23:24:33,745 INFO L290 TraceCheckUtils]: 64: Hoare triple {5537#false} assume 0 == ~cond; {5537#false} is VALID [2022-02-20 23:24:33,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {5537#false} assume !false; {5537#false} is VALID [2022-02-20 23:24:33,746 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:24:33,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:33,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:33,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215545683] [2022-02-20 23:24:33,747 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:33,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582773708] [2022-02-20 23:24:33,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582773708] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:33,747 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:33,747 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:24:33,748 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030731711] [2022-02-20 23:24:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:33,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 23:24:33,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:33,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:33,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:33,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:24:33,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:33,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:24:33,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:24:33,812 INFO L87 Difference]: Start difference. First operand 206 states and 264 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:34,716 INFO L93 Difference]: Finished difference Result 532 states and 686 transitions. [2022-02-20 23:24:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:24:34,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-02-20 23:24:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2022-02-20 23:24:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2022-02-20 23:24:34,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 668 transitions. [2022-02-20 23:24:35,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 668 edges. 668 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:35,243 INFO L225 Difference]: With dead ends: 532 [2022-02-20 23:24:35,244 INFO L226 Difference]: Without dead ends: 330 [2022-02-20 23:24:35,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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:24:35,245 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 113 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:24:35,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 550 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:24:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-02-20 23:24:35,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 312. [2022-02-20 23:24:35,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:35,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 330 states. Second operand has 312 states, 300 states have (on average 1.27) internal successors, (381), 306 states have internal predecessors, (381), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:35,276 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand has 312 states, 300 states have (on average 1.27) internal successors, (381), 306 states have internal predecessors, (381), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:35,277 INFO L87 Difference]: Start difference. First operand 330 states. Second operand has 312 states, 300 states have (on average 1.27) internal successors, (381), 306 states have internal predecessors, (381), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:35,284 INFO L93 Difference]: Finished difference Result 330 states and 424 transitions. [2022-02-20 23:24:35,284 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 424 transitions. [2022-02-20 23:24:35,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:35,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:35,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 312 states, 300 states have (on average 1.27) internal successors, (381), 306 states have internal predecessors, (381), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 330 states. [2022-02-20 23:24:35,286 INFO L87 Difference]: Start difference. First operand has 312 states, 300 states have (on average 1.27) internal successors, (381), 306 states have internal predecessors, (381), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 330 states. [2022-02-20 23:24:35,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:35,292 INFO L93 Difference]: Finished difference Result 330 states and 424 transitions. [2022-02-20 23:24:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 424 transitions. [2022-02-20 23:24:35,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:35,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:35,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:35,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 300 states have (on average 1.27) internal successors, (381), 306 states have internal predecessors, (381), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 397 transitions. [2022-02-20 23:24:35,300 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 397 transitions. Word has length 66 [2022-02-20 23:24:35,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:35,301 INFO L470 AbstractCegarLoop]: Abstraction has 312 states and 397 transitions. [2022-02-20 23:24:35,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 397 transitions. [2022-02-20 23:24:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-02-20 23:24:35,302 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:35,302 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 23:24:35,331 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:24:35,519 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:24:35,520 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:35,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:35,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1268606516, now seen corresponding path program 1 times [2022-02-20 23:24:35,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:35,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67359074] [2022-02-20 23:24:35,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:35,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:35,567 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:35,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072538879] [2022-02-20 23:24:35,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:35,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:35,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:35,569 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:24:35,570 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:24:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:36,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:24:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:36,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:36,312 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:24:36,346 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:24:36,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {7398#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);~count_int_int~0 := 0; {7398#true} is VALID [2022-02-20 23:24:36,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {7398#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#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, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#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~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1.base, main_#t~mem190#1.offset, main_#t~short191#1, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, 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, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem214#1, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1.base, main_#t~mem216#1.offset, main_#t~mem217#1, main_#t~post218#1, main_#t~mem219#1.base, main_#t~mem219#1.offset, 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.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1, main_#t~post229#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem144#1, main_#t~mem145#1, main_#t~mem231#1, main_#t~mem232#1, main_#t~mem230#1.base, main_#t~mem230#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); {7398#true} is VALID [2022-02-20 23:24:36,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {7398#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7398#true} is VALID [2022-02-20 23:24:36,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {7398#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {7398#true} is VALID [2022-02-20 23:24:36,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {7398#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {7398#true} is VALID [2022-02-20 23:24:36,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {7398#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {7398#true} is VALID [2022-02-20 23:24:36,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {7398#true} havoc main_~_ha_hashv~0#1; {7398#true} is VALID [2022-02-20 23:24:36,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {7398#true} goto; {7398#true} is VALID [2022-02-20 23:24:36,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {7398#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; {7398#true} is VALID [2022-02-20 23:24:36,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {7398#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {7398#true} is VALID [2022-02-20 23:24:36,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {7398#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {7398#true} is VALID [2022-02-20 23:24:36,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {7398#true} assume !main_#t~switch24#1; {7398#true} is VALID [2022-02-20 23:24:36,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {7398#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {7398#true} is VALID [2022-02-20 23:24:36,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {7398#true} assume !main_#t~switch24#1; {7398#true} is VALID [2022-02-20 23:24:36,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {7398#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {7398#true} is VALID [2022-02-20 23:24:36,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {7398#true} assume !main_#t~switch24#1; {7398#true} is VALID [2022-02-20 23:24:36,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {7398#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {7398#true} is VALID [2022-02-20 23:24:36,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {7398#true} assume !main_#t~switch24#1; {7398#true} is VALID [2022-02-20 23:24:36,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {7398#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {7398#true} is VALID [2022-02-20 23:24:36,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {7398#true} assume !main_#t~switch24#1; {7398#true} is VALID [2022-02-20 23:24:36,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {7398#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {7398#true} is VALID [2022-02-20 23:24:36,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {7398#true} assume !main_#t~switch24#1; {7398#true} is VALID [2022-02-20 23:24:36,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {7398#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {7398#true} is VALID [2022-02-20 23:24:36,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {7398#true} assume !main_#t~switch24#1; {7398#true} is VALID [2022-02-20 23:24:36,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {7398#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {7398#true} is VALID [2022-02-20 23:24:36,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {7398#true} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {7398#true} is VALID [2022-02-20 23:24:36,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {7398#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {7398#true} is VALID [2022-02-20 23:24:36,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {7398#true} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {7398#true} is VALID [2022-02-20 23:24:36,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {7398#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {7398#true} is VALID [2022-02-20 23:24:36,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {7398#true} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {7398#true} is VALID [2022-02-20 23:24:36,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {7398#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {7398#true} is VALID [2022-02-20 23:24:36,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {7398#true} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {7398#true} is VALID [2022-02-20 23:24:36,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {7398#true} havoc main_#t~switch24#1; {7398#true} is VALID [2022-02-20 23:24:36,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {7398#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)))); {7398#true} is VALID [2022-02-20 23:24:36,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {7398#true} goto; {7398#true} is VALID [2022-02-20 23:24:36,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {7398#true} goto; {7398#true} is VALID [2022-02-20 23:24:36,375 INFO L290 TraceCheckUtils]: 36: Hoare triple {7398#true} goto; {7398#true} is VALID [2022-02-20 23:24:36,375 INFO L290 TraceCheckUtils]: 37: Hoare triple {7398#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); {7398#true} is VALID [2022-02-20 23:24:36,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {7398#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); {7398#true} is VALID [2022-02-20 23:24:36,375 INFO L290 TraceCheckUtils]: 39: Hoare triple {7398#true} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {7398#true} is VALID [2022-02-20 23:24:36,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {7398#true} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {7398#true} is VALID [2022-02-20 23:24:36,376 INFO L272 TraceCheckUtils]: 41: Hoare triple {7398#true} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {7398#true} is VALID [2022-02-20 23:24:36,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {7398#true} #t~loopctr234 := 0; {7398#true} is VALID [2022-02-20 23:24:36,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {7398#true} assume !(#t~loopctr234 % 4294967296 < #amount % 4294967296); {7398#true} is VALID [2022-02-20 23:24:36,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {7398#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {7398#true} is VALID [2022-02-20 23:24:36,376 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7398#true} {7398#true} #820#return; {7398#true} is VALID [2022-02-20 23:24:36,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {7398#true} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#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~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem41#1.base, 4 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#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~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {7398#true} is VALID [2022-02-20 23:24:36,377 INFO L290 TraceCheckUtils]: 47: Hoare triple {7398#true} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {7398#true} is VALID [2022-02-20 23:24:36,377 INFO L272 TraceCheckUtils]: 48: Hoare triple {7398#true} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {7398#true} is VALID [2022-02-20 23:24:36,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {7398#true} #t~loopctr234 := 0; {7398#true} is VALID [2022-02-20 23:24:36,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {7398#true} assume !(#t~loopctr234 % 4294967296 < #amount % 4294967296); {7398#true} is VALID [2022-02-20 23:24:36,377 INFO L290 TraceCheckUtils]: 51: Hoare triple {7398#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {7398#true} is VALID [2022-02-20 23:24:36,377 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {7398#true} {7398#true} #822#return; {7398#true} is VALID [2022-02-20 23:24:36,378 INFO L290 TraceCheckUtils]: 53: Hoare triple {7398#true} havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset; {7398#true} is VALID [2022-02-20 23:24:36,378 INFO L290 TraceCheckUtils]: 54: Hoare triple {7398#true} goto; {7398#true} is VALID [2022-02-20 23:24:36,378 INFO L290 TraceCheckUtils]: 55: Hoare triple {7398#true} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {7398#true} is VALID [2022-02-20 23:24:36,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {7398#true} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {7398#true} is VALID [2022-02-20 23:24:36,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {7398#true} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {7398#true} is VALID [2022-02-20 23:24:36,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {7398#true} goto; {7398#true} is VALID [2022-02-20 23:24:36,379 INFO L290 TraceCheckUtils]: 59: Hoare triple {7398#true} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {7398#true} is VALID [2022-02-20 23:24:36,379 INFO L290 TraceCheckUtils]: 60: Hoare triple {7398#true} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {7398#true} is VALID [2022-02-20 23:24:36,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {7398#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {7398#true} is VALID [2022-02-20 23:24:36,379 INFO L290 TraceCheckUtils]: 62: Hoare triple {7398#true} assume main_#t~short77#1;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 main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {7398#true} is VALID [2022-02-20 23:24:36,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {7398#true} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {7398#true} is VALID [2022-02-20 23:24:36,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {7398#true} goto; {7398#true} is VALID [2022-02-20 23:24:36,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {7398#true} goto; {7398#true} is VALID [2022-02-20 23:24:36,380 INFO L290 TraceCheckUtils]: 66: Hoare triple {7398#true} goto; {7398#true} is VALID [2022-02-20 23:24:36,380 INFO L290 TraceCheckUtils]: 67: Hoare triple {7398#true} goto; {7398#true} is VALID [2022-02-20 23:24:36,380 INFO L290 TraceCheckUtils]: 68: Hoare triple {7398#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {7398#true} is VALID [2022-02-20 23:24:36,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {7398#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7398#true} is VALID [2022-02-20 23:24:36,380 INFO L290 TraceCheckUtils]: 70: Hoare triple {7398#true} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {7398#true} is VALID [2022-02-20 23:24:36,381 INFO L290 TraceCheckUtils]: 71: Hoare triple {7398#true} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7616#(<= (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:24:36,381 INFO L290 TraceCheckUtils]: 72: Hoare triple {7616#(<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7620#(<= |ULTIMATE.start_main_#t~mem145#1| 0)} is VALID [2022-02-20 23:24:36,382 INFO L290 TraceCheckUtils]: 73: Hoare triple {7620#(<= |ULTIMATE.start_main_#t~mem145#1| 0)} assume !(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {7399#false} is VALID [2022-02-20 23:24:36,382 INFO L290 TraceCheckUtils]: 74: Hoare triple {7399#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {7399#false} is VALID [2022-02-20 23:24:36,382 INFO L290 TraceCheckUtils]: 75: Hoare triple {7399#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem231#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem232#1 := read~int(main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);assume { :begin_inline_test_int_int } true;test_int_int_#in~a#1, test_int_int_#in~b#1 := main_#t~mem231#1, main_#t~mem232#1;havoc test_int_int_#t~post3#1, test_int_int_#t~switch4#1, test_int_int_~a#1, test_int_int_~b#1;test_int_int_~a#1 := test_int_int_#in~a#1;test_int_int_~b#1 := test_int_int_#in~b#1;test_int_int_#t~post3#1 := ~count_int_int~0;~count_int_int~0 := 1 + test_int_int_#t~post3#1;test_int_int_#t~switch4#1 := 0 == test_int_int_#t~post3#1; {7399#false} is VALID [2022-02-20 23:24:36,382 INFO L290 TraceCheckUtils]: 76: Hoare triple {7399#false} assume test_int_int_#t~switch4#1; {7399#false} is VALID [2022-02-20 23:24:36,382 INFO L272 TraceCheckUtils]: 77: Hoare triple {7399#false} call __VERIFIER_assert((if 1 == test_int_int_~a#1 && 1 == test_int_int_~b#1 then 1 else 0)); {7399#false} is VALID [2022-02-20 23:24:36,383 INFO L290 TraceCheckUtils]: 78: Hoare triple {7399#false} ~cond := #in~cond; {7399#false} is VALID [2022-02-20 23:24:36,383 INFO L290 TraceCheckUtils]: 79: Hoare triple {7399#false} assume 0 == ~cond; {7399#false} is VALID [2022-02-20 23:24:36,383 INFO L290 TraceCheckUtils]: 80: Hoare triple {7399#false} assume !false; {7399#false} is VALID [2022-02-20 23:24:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:24:36,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:36,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:36,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67359074] [2022-02-20 23:24:36,384 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:36,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072538879] [2022-02-20 23:24:36,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072538879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:36,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:36,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:24:36,384 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221628859] [2022-02-20 23:24:36,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:36,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2022-02-20 23:24:36,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:36,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:36,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:36,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:24:36,444 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:36,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:24:36,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:24:36,445 INFO L87 Difference]: Start difference. First operand 312 states and 397 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:38,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:38,008 INFO L93 Difference]: Finished difference Result 427 states and 554 transitions. [2022-02-20 23:24:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:24:38,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2022-02-20 23:24:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 400 transitions. [2022-02-20 23:24:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 400 transitions. [2022-02-20 23:24:38,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 400 transitions. [2022-02-20 23:24:38,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 400 edges. 400 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:38,323 INFO L225 Difference]: With dead ends: 427 [2022-02-20 23:24:38,323 INFO L226 Difference]: Without dead ends: 406 [2022-02-20 23:24:38,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 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:24:38,324 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 102 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:24:38,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 674 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:24:38,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2022-02-20 23:24:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 314. [2022-02-20 23:24:38,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:38,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 406 states. Second operand has 314 states, 302 states have (on average 1.2682119205298013) internal successors, (383), 308 states have internal predecessors, (383), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:38,364 INFO L74 IsIncluded]: Start isIncluded. First operand 406 states. Second operand has 314 states, 302 states have (on average 1.2682119205298013) internal successors, (383), 308 states have internal predecessors, (383), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:38,365 INFO L87 Difference]: Start difference. First operand 406 states. Second operand has 314 states, 302 states have (on average 1.2682119205298013) internal successors, (383), 308 states have internal predecessors, (383), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:38,373 INFO L93 Difference]: Finished difference Result 406 states and 523 transitions. [2022-02-20 23:24:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 523 transitions. [2022-02-20 23:24:38,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:38,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:38,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 314 states, 302 states have (on average 1.2682119205298013) internal successors, (383), 308 states have internal predecessors, (383), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 406 states. [2022-02-20 23:24:38,376 INFO L87 Difference]: Start difference. First operand has 314 states, 302 states have (on average 1.2682119205298013) internal successors, (383), 308 states have internal predecessors, (383), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 406 states. [2022-02-20 23:24:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:38,384 INFO L93 Difference]: Finished difference Result 406 states and 523 transitions. [2022-02-20 23:24:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 523 transitions. [2022-02-20 23:24:38,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:38,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:38,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:38,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:38,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 302 states have (on average 1.2682119205298013) internal successors, (383), 308 states have internal predecessors, (383), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:38,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 399 transitions. [2022-02-20 23:24:38,392 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 399 transitions. Word has length 81 [2022-02-20 23:24:38,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:38,392 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 399 transitions. [2022-02-20 23:24:38,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:38,393 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 399 transitions. [2022-02-20 23:24:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-20 23:24:38,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:38,394 INFO L514 BasicCegarLoop]: trace histogram [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, 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:24:38,422 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:24:38,614 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:24:38,614 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:38,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:38,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1512236935, now seen corresponding path program 1 times [2022-02-20 23:24:38,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:38,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391425454] [2022-02-20 23:24:38,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:38,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:38,676 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:38,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619069583] [2022-02-20 23:24:38,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:38,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:38,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:38,689 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:24:38,691 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:24:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:39,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:24:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:39,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:39,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {9332#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);~count_int_int~0 := 0; {9332#true} is VALID [2022-02-20 23:24:39,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {9332#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#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, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#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~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1.base, main_#t~mem190#1.offset, main_#t~short191#1, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, 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, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem214#1, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1.base, main_#t~mem216#1.offset, main_#t~mem217#1, main_#t~post218#1, main_#t~mem219#1.base, main_#t~mem219#1.offset, 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.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1, main_#t~post229#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem144#1, main_#t~mem145#1, main_#t~mem231#1, main_#t~mem232#1, main_#t~mem230#1.base, main_#t~mem230#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); {9332#true} is VALID [2022-02-20 23:24:39,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {9332#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {9332#true} is VALID [2022-02-20 23:24:39,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {9332#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {9332#true} is VALID [2022-02-20 23:24:39,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {9332#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {9332#true} is VALID [2022-02-20 23:24:39,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {9332#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {9332#true} is VALID [2022-02-20 23:24:39,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {9332#true} havoc main_~_ha_hashv~0#1; {9332#true} is VALID [2022-02-20 23:24:39,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {9332#true} goto; {9332#true} is VALID [2022-02-20 23:24:39,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {9332#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; {9332#true} is VALID [2022-02-20 23:24:39,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {9332#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {9332#true} is VALID [2022-02-20 23:24:39,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {9332#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {9332#true} is VALID [2022-02-20 23:24:39,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {9332#true} assume !main_#t~switch24#1; {9332#true} is VALID [2022-02-20 23:24:39,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {9332#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {9332#true} is VALID [2022-02-20 23:24:39,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {9332#true} assume !main_#t~switch24#1; {9332#true} is VALID [2022-02-20 23:24:39,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {9332#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {9332#true} is VALID [2022-02-20 23:24:39,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {9332#true} assume !main_#t~switch24#1; {9332#true} is VALID [2022-02-20 23:24:39,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {9332#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {9332#true} is VALID [2022-02-20 23:24:39,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {9332#true} assume !main_#t~switch24#1; {9332#true} is VALID [2022-02-20 23:24:39,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {9332#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {9332#true} is VALID [2022-02-20 23:24:39,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {9332#true} assume !main_#t~switch24#1; {9332#true} is VALID [2022-02-20 23:24:39,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {9332#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {9332#true} is VALID [2022-02-20 23:24:39,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {9332#true} assume !main_#t~switch24#1; {9332#true} is VALID [2022-02-20 23:24:39,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {9332#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {9332#true} is VALID [2022-02-20 23:24:39,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {9332#true} assume !main_#t~switch24#1; {9332#true} is VALID [2022-02-20 23:24:39,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {9332#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {9332#true} is VALID [2022-02-20 23:24:39,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {9332#true} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {9332#true} is VALID [2022-02-20 23:24:39,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {9332#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {9332#true} is VALID [2022-02-20 23:24:39,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {9332#true} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {9332#true} is VALID [2022-02-20 23:24:39,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {9332#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {9332#true} is VALID [2022-02-20 23:24:39,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {9332#true} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {9332#true} is VALID [2022-02-20 23:24:39,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {9332#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {9332#true} is VALID [2022-02-20 23:24:39,450 INFO L290 TraceCheckUtils]: 31: Hoare triple {9332#true} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {9332#true} is VALID [2022-02-20 23:24:39,450 INFO L290 TraceCheckUtils]: 32: Hoare triple {9332#true} havoc main_#t~switch24#1; {9332#true} is VALID [2022-02-20 23:24:39,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {9332#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)))); {9332#true} is VALID [2022-02-20 23:24:39,450 INFO L290 TraceCheckUtils]: 34: Hoare triple {9332#true} goto; {9332#true} is VALID [2022-02-20 23:24:39,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {9332#true} goto; {9332#true} is VALID [2022-02-20 23:24:39,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {9332#true} goto; {9332#true} is VALID [2022-02-20 23:24:39,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {9332#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); {9332#true} is VALID [2022-02-20 23:24:39,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {9332#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); {9332#true} is VALID [2022-02-20 23:24:39,451 INFO L290 TraceCheckUtils]: 39: Hoare triple {9332#true} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {9332#true} is VALID [2022-02-20 23:24:39,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {9332#true} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {9332#true} is VALID [2022-02-20 23:24:39,452 INFO L272 TraceCheckUtils]: 41: Hoare triple {9332#true} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {9332#true} is VALID [2022-02-20 23:24:39,452 INFO L290 TraceCheckUtils]: 42: Hoare triple {9332#true} #t~loopctr234 := 0; {9332#true} is VALID [2022-02-20 23:24:39,452 INFO L290 TraceCheckUtils]: 43: Hoare triple {9332#true} assume !(#t~loopctr234 % 4294967296 < #amount % 4294967296); {9332#true} is VALID [2022-02-20 23:24:39,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {9332#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9332#true} is VALID [2022-02-20 23:24:39,452 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9332#true} {9332#true} #820#return; {9332#true} is VALID [2022-02-20 23:24:39,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {9332#true} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#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~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem41#1.base, 4 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#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~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {9332#true} is VALID [2022-02-20 23:24:39,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {9332#true} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {9332#true} is VALID [2022-02-20 23:24:39,453 INFO L272 TraceCheckUtils]: 48: Hoare triple {9332#true} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {9332#true} is VALID [2022-02-20 23:24:39,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {9332#true} #t~loopctr234 := 0; {9332#true} is VALID [2022-02-20 23:24:39,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {9332#true} assume !(#t~loopctr234 % 4294967296 < #amount % 4294967296); {9332#true} is VALID [2022-02-20 23:24:39,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {9332#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9332#true} is VALID [2022-02-20 23:24:39,453 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9332#true} {9332#true} #822#return; {9332#true} is VALID [2022-02-20 23:24:39,453 INFO L290 TraceCheckUtils]: 53: Hoare triple {9332#true} havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset; {9332#true} is VALID [2022-02-20 23:24:39,453 INFO L290 TraceCheckUtils]: 54: Hoare triple {9332#true} goto; {9332#true} is VALID [2022-02-20 23:24:39,453 INFO L290 TraceCheckUtils]: 55: Hoare triple {9332#true} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {9332#true} is VALID [2022-02-20 23:24:39,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {9332#true} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {9332#true} is VALID [2022-02-20 23:24:39,454 INFO L290 TraceCheckUtils]: 57: Hoare triple {9332#true} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {9332#true} is VALID [2022-02-20 23:24:39,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {9332#true} goto; {9332#true} is VALID [2022-02-20 23:24:39,454 INFO L290 TraceCheckUtils]: 59: Hoare triple {9332#true} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {9332#true} is VALID [2022-02-20 23:24:39,454 INFO L290 TraceCheckUtils]: 60: Hoare triple {9332#true} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {9332#true} is VALID [2022-02-20 23:24:39,454 INFO L290 TraceCheckUtils]: 61: Hoare triple {9332#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {9332#true} is VALID [2022-02-20 23:24:39,454 INFO L290 TraceCheckUtils]: 62: Hoare triple {9332#true} assume main_#t~short77#1;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 main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {9332#true} is VALID [2022-02-20 23:24:39,455 INFO L290 TraceCheckUtils]: 63: Hoare triple {9332#true} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {9332#true} is VALID [2022-02-20 23:24:39,455 INFO L290 TraceCheckUtils]: 64: Hoare triple {9332#true} goto; {9332#true} is VALID [2022-02-20 23:24:39,455 INFO L290 TraceCheckUtils]: 65: Hoare triple {9332#true} goto; {9332#true} is VALID [2022-02-20 23:24:39,455 INFO L290 TraceCheckUtils]: 66: Hoare triple {9332#true} goto; {9332#true} is VALID [2022-02-20 23:24:39,455 INFO L290 TraceCheckUtils]: 67: Hoare triple {9332#true} goto; {9332#true} is VALID [2022-02-20 23:24:39,455 INFO L290 TraceCheckUtils]: 68: Hoare triple {9332#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {9332#true} is VALID [2022-02-20 23:24:39,455 INFO L290 TraceCheckUtils]: 69: Hoare triple {9332#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {9332#true} is VALID [2022-02-20 23:24:39,456 INFO L290 TraceCheckUtils]: 70: Hoare triple {9332#true} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {9332#true} is VALID [2022-02-20 23:24:39,457 INFO L290 TraceCheckUtils]: 71: Hoare triple {9332#true} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {9332#true} is VALID [2022-02-20 23:24:39,459 INFO L290 TraceCheckUtils]: 72: Hoare triple {9332#true} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {9332#true} is VALID [2022-02-20 23:24:39,460 INFO L290 TraceCheckUtils]: 73: Hoare triple {9332#true} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {9332#true} is VALID [2022-02-20 23:24:39,460 INFO L290 TraceCheckUtils]: 74: Hoare triple {9332#true} havoc main_~_hf_hashv~0#1; {9332#true} is VALID [2022-02-20 23:24:39,461 INFO L290 TraceCheckUtils]: 75: Hoare triple {9332#true} goto; {9332#true} is VALID [2022-02-20 23:24:39,461 INFO L290 TraceCheckUtils]: 76: Hoare triple {9332#true} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {9332#true} is VALID [2022-02-20 23:24:39,461 INFO L290 TraceCheckUtils]: 77: Hoare triple {9332#true} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {9332#true} is VALID [2022-02-20 23:24:39,462 INFO L290 TraceCheckUtils]: 78: Hoare triple {9332#true} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {9332#true} is VALID [2022-02-20 23:24:39,462 INFO L290 TraceCheckUtils]: 79: Hoare triple {9332#true} assume !main_#t~switch158#1; {9332#true} is VALID [2022-02-20 23:24:39,462 INFO L290 TraceCheckUtils]: 80: Hoare triple {9332#true} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {9332#true} is VALID [2022-02-20 23:24:39,465 INFO L290 TraceCheckUtils]: 81: Hoare triple {9332#true} assume main_#t~switch158#1;call main_#t~mem160#1 := read~int(main_~_hj_key~1#1.base, 9 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 65536 * (main_#t~mem160#1 % 256);havoc main_#t~mem160#1; {9332#true} is VALID [2022-02-20 23:24:39,465 INFO L290 TraceCheckUtils]: 82: Hoare triple {9332#true} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {9332#true} is VALID [2022-02-20 23:24:39,465 INFO L290 TraceCheckUtils]: 83: Hoare triple {9332#true} assume main_#t~switch158#1;call main_#t~mem161#1 := read~int(main_~_hj_key~1#1.base, 8 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 256 * (main_#t~mem161#1 % 256);havoc main_#t~mem161#1; {9332#true} is VALID [2022-02-20 23:24:39,465 INFO L290 TraceCheckUtils]: 84: Hoare triple {9332#true} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {9332#true} is VALID [2022-02-20 23:24:39,465 INFO L290 TraceCheckUtils]: 85: Hoare triple {9332#true} assume main_#t~switch158#1;call main_#t~mem162#1 := read~int(main_~_hj_key~1#1.base, 7 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 16777216 * (main_#t~mem162#1 % 256);havoc main_#t~mem162#1; {9332#true} is VALID [2022-02-20 23:24:39,465 INFO L290 TraceCheckUtils]: 86: Hoare triple {9332#true} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {9332#true} is VALID [2022-02-20 23:24:39,465 INFO L290 TraceCheckUtils]: 87: Hoare triple {9332#true} assume main_#t~switch158#1;call main_#t~mem163#1 := read~int(main_~_hj_key~1#1.base, 6 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 65536 * (main_#t~mem163#1 % 256);havoc main_#t~mem163#1; {9332#true} is VALID [2022-02-20 23:24:39,466 INFO L290 TraceCheckUtils]: 88: Hoare triple {9332#true} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {9332#true} is VALID [2022-02-20 23:24:39,466 INFO L290 TraceCheckUtils]: 89: Hoare triple {9332#true} assume main_#t~switch158#1;call main_#t~mem164#1 := read~int(main_~_hj_key~1#1.base, 5 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 256 * (main_#t~mem164#1 % 256);havoc main_#t~mem164#1; {9332#true} is VALID [2022-02-20 23:24:39,466 INFO L290 TraceCheckUtils]: 90: Hoare triple {9332#true} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {9332#true} is VALID [2022-02-20 23:24:39,466 INFO L290 TraceCheckUtils]: 91: Hoare triple {9332#true} assume main_#t~switch158#1;call main_#t~mem165#1 := read~int(main_~_hj_key~1#1.base, 4 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + main_#t~mem165#1 % 256;havoc main_#t~mem165#1; {9332#true} is VALID [2022-02-20 23:24:39,466 INFO L290 TraceCheckUtils]: 92: Hoare triple {9332#true} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {9332#true} is VALID [2022-02-20 23:24:39,466 INFO L290 TraceCheckUtils]: 93: Hoare triple {9332#true} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {9332#true} is VALID [2022-02-20 23:24:39,466 INFO L290 TraceCheckUtils]: 94: Hoare triple {9332#true} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {9332#true} is VALID [2022-02-20 23:24:39,467 INFO L290 TraceCheckUtils]: 95: Hoare triple {9332#true} assume main_#t~switch158#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem167#1 % 256);havoc main_#t~mem167#1; {9622#|ULTIMATE.start_main_#t~switch158#1|} is VALID [2022-02-20 23:24:39,467 INFO L290 TraceCheckUtils]: 96: Hoare triple {9622#|ULTIMATE.start_main_#t~switch158#1|} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {9622#|ULTIMATE.start_main_#t~switch158#1|} is VALID [2022-02-20 23:24:39,468 INFO L290 TraceCheckUtils]: 97: Hoare triple {9622#|ULTIMATE.start_main_#t~switch158#1|} assume !main_#t~switch158#1; {9333#false} is VALID [2022-02-20 23:24:39,468 INFO L290 TraceCheckUtils]: 98: Hoare triple {9333#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {9333#false} is VALID [2022-02-20 23:24:39,468 INFO L290 TraceCheckUtils]: 99: Hoare triple {9333#false} assume main_#t~switch158#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem169#1 % 256;havoc main_#t~mem169#1; {9333#false} is VALID [2022-02-20 23:24:39,468 INFO L290 TraceCheckUtils]: 100: Hoare triple {9333#false} havoc main_#t~switch158#1; {9333#false} is VALID [2022-02-20 23:24:39,469 INFO L290 TraceCheckUtils]: 101: Hoare triple {9333#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {9333#false} is VALID [2022-02-20 23:24:39,469 INFO L290 TraceCheckUtils]: 102: Hoare triple {9333#false} goto; {9333#false} is VALID [2022-02-20 23:24:39,469 INFO L290 TraceCheckUtils]: 103: Hoare triple {9333#false} goto; {9333#false} is VALID [2022-02-20 23:24:39,469 INFO L290 TraceCheckUtils]: 104: Hoare triple {9333#false} goto; {9333#false} is VALID [2022-02-20 23:24:39,469 INFO L290 TraceCheckUtils]: 105: Hoare triple {9333#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {9333#false} is VALID [2022-02-20 23:24:39,469 INFO L290 TraceCheckUtils]: 106: Hoare triple {9333#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {9333#false} is VALID [2022-02-20 23:24:39,469 INFO L290 TraceCheckUtils]: 107: Hoare triple {9333#false} goto; {9333#false} is VALID [2022-02-20 23:24:39,471 INFO L290 TraceCheckUtils]: 108: Hoare triple {9333#false} goto; {9333#false} is VALID [2022-02-20 23:24:39,471 INFO L290 TraceCheckUtils]: 109: Hoare triple {9333#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {9333#false} is VALID [2022-02-20 23:24:39,471 INFO L290 TraceCheckUtils]: 110: Hoare triple {9333#false} assume !false; {9333#false} is VALID [2022-02-20 23:24:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:24:39,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:39,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:39,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391425454] [2022-02-20 23:24:39,474 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:39,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619069583] [2022-02-20 23:24:39,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619069583] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:39,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:39,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:24:39,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055577955] [2022-02-20 23:24:39,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:39,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-02-20 23:24:39,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:39,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:39,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:39,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:24:39,580 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:39,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:24:39,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:24:39,580 INFO L87 Difference]: Start difference. First operand 314 states and 399 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:40,056 INFO L93 Difference]: Finished difference Result 521 states and 685 transitions. [2022-02-20 23:24:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:24:40,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-02-20 23:24:40,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 23:24:40,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2022-02-20 23:24:40,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 427 transitions. [2022-02-20 23:24:40,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:40,364 INFO L225 Difference]: With dead ends: 521 [2022-02-20 23:24:40,364 INFO L226 Difference]: Without dead ends: 356 [2022-02-20 23:24:40,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 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:24:40,366 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 8 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 459 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:24:40,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 459 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:24:40,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-02-20 23:24:40,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2022-02-20 23:24:40,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:40,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 356 states. Second operand has 354 states, 342 states have (on average 1.236842105263158) internal successors, (423), 348 states have internal predecessors, (423), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:40,401 INFO L74 IsIncluded]: Start isIncluded. First operand 356 states. Second operand has 354 states, 342 states have (on average 1.236842105263158) internal successors, (423), 348 states have internal predecessors, (423), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:40,402 INFO L87 Difference]: Start difference. First operand 356 states. Second operand has 354 states, 342 states have (on average 1.236842105263158) internal successors, (423), 348 states have internal predecessors, (423), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:40,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:40,408 INFO L93 Difference]: Finished difference Result 356 states and 441 transitions. [2022-02-20 23:24:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 441 transitions. [2022-02-20 23:24:40,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:40,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:40,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 354 states, 342 states have (on average 1.236842105263158) internal successors, (423), 348 states have internal predecessors, (423), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 356 states. [2022-02-20 23:24:40,411 INFO L87 Difference]: Start difference. First operand has 354 states, 342 states have (on average 1.236842105263158) internal successors, (423), 348 states have internal predecessors, (423), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 356 states. [2022-02-20 23:24:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:40,417 INFO L93 Difference]: Finished difference Result 356 states and 441 transitions. [2022-02-20 23:24:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 441 transitions. [2022-02-20 23:24:40,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:40,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:40,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:40,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 342 states have (on average 1.236842105263158) internal successors, (423), 348 states have internal predecessors, (423), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 439 transitions. [2022-02-20 23:24:40,424 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 439 transitions. Word has length 111 [2022-02-20 23:24:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:40,425 INFO L470 AbstractCegarLoop]: Abstraction has 354 states and 439 transitions. [2022-02-20 23:24:40,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 439 transitions. [2022-02-20 23:24:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-20 23:24:40,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:40,427 INFO L514 BasicCegarLoop]: trace histogram [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, 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:24:40,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 23:24:40,633 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:24:40,633 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:40,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:40,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1771613111, now seen corresponding path program 1 times [2022-02-20 23:24:40,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:40,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122010178] [2022-02-20 23:24:40,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:40,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:40,689 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:40,691 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [333315515] [2022-02-20 23:24:40,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:40,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:40,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:40,704 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:24:40,704 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:24:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:41,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:24:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:41,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:41,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {11395#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);~count_int_int~0 := 0; {11395#true} is VALID [2022-02-20 23:24:41,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {11395#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#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, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#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~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1.base, main_#t~mem190#1.offset, main_#t~short191#1, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, 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, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem214#1, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1.base, main_#t~mem216#1.offset, main_#t~mem217#1, main_#t~post218#1, main_#t~mem219#1.base, main_#t~mem219#1.offset, 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.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1, main_#t~post229#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem144#1, main_#t~mem145#1, main_#t~mem231#1, main_#t~mem232#1, main_#t~mem230#1.base, main_#t~mem230#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); {11395#true} is VALID [2022-02-20 23:24:41,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {11395#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11395#true} is VALID [2022-02-20 23:24:41,508 INFO L290 TraceCheckUtils]: 3: Hoare triple {11395#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {11395#true} is VALID [2022-02-20 23:24:41,508 INFO L290 TraceCheckUtils]: 4: Hoare triple {11395#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {11395#true} is VALID [2022-02-20 23:24:41,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {11395#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {11395#true} is VALID [2022-02-20 23:24:41,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {11395#true} havoc main_~_ha_hashv~0#1; {11395#true} is VALID [2022-02-20 23:24:41,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {11395#true} goto; {11395#true} is VALID [2022-02-20 23:24:41,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {11395#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; {11395#true} is VALID [2022-02-20 23:24:41,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {11395#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {11395#true} is VALID [2022-02-20 23:24:41,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {11395#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {11395#true} is VALID [2022-02-20 23:24:41,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {11395#true} assume !main_#t~switch24#1; {11395#true} is VALID [2022-02-20 23:24:41,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {11395#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {11395#true} is VALID [2022-02-20 23:24:41,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {11395#true} assume !main_#t~switch24#1; {11395#true} is VALID [2022-02-20 23:24:41,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {11395#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {11395#true} is VALID [2022-02-20 23:24:41,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {11395#true} assume !main_#t~switch24#1; {11395#true} is VALID [2022-02-20 23:24:41,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {11395#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {11395#true} is VALID [2022-02-20 23:24:41,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {11395#true} assume !main_#t~switch24#1; {11395#true} is VALID [2022-02-20 23:24:41,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {11395#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {11395#true} is VALID [2022-02-20 23:24:41,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {11395#true} assume !main_#t~switch24#1; {11395#true} is VALID [2022-02-20 23:24:41,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {11395#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {11395#true} is VALID [2022-02-20 23:24:41,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {11395#true} assume !main_#t~switch24#1; {11395#true} is VALID [2022-02-20 23:24:41,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {11395#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {11395#true} is VALID [2022-02-20 23:24:41,510 INFO L290 TraceCheckUtils]: 23: Hoare triple {11395#true} assume !main_#t~switch24#1; {11395#true} is VALID [2022-02-20 23:24:41,510 INFO L290 TraceCheckUtils]: 24: Hoare triple {11395#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {11395#true} is VALID [2022-02-20 23:24:41,510 INFO L290 TraceCheckUtils]: 25: Hoare triple {11395#true} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {11395#true} is VALID [2022-02-20 23:24:41,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {11395#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {11395#true} is VALID [2022-02-20 23:24:41,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {11395#true} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {11395#true} is VALID [2022-02-20 23:24:41,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {11395#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {11395#true} is VALID [2022-02-20 23:24:41,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {11395#true} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {11395#true} is VALID [2022-02-20 23:24:41,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {11395#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {11395#true} is VALID [2022-02-20 23:24:41,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {11395#true} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {11395#true} is VALID [2022-02-20 23:24:41,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {11395#true} havoc main_#t~switch24#1; {11395#true} is VALID [2022-02-20 23:24:41,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {11395#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)))); {11395#true} is VALID [2022-02-20 23:24:41,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {11395#true} goto; {11395#true} is VALID [2022-02-20 23:24:41,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {11395#true} goto; {11395#true} is VALID [2022-02-20 23:24:41,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {11395#true} goto; {11395#true} is VALID [2022-02-20 23:24:41,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {11395#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); {11395#true} is VALID [2022-02-20 23:24:41,511 INFO L290 TraceCheckUtils]: 38: Hoare triple {11395#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); {11395#true} is VALID [2022-02-20 23:24:41,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {11395#true} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11395#true} is VALID [2022-02-20 23:24:41,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {11395#true} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11395#true} is VALID [2022-02-20 23:24:41,511 INFO L272 TraceCheckUtils]: 41: Hoare triple {11395#true} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {11395#true} is VALID [2022-02-20 23:24:41,511 INFO L290 TraceCheckUtils]: 42: Hoare triple {11395#true} #t~loopctr234 := 0; {11395#true} is VALID [2022-02-20 23:24:41,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {11395#true} assume !(#t~loopctr234 % 4294967296 < #amount % 4294967296); {11395#true} is VALID [2022-02-20 23:24:41,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {11395#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11395#true} is VALID [2022-02-20 23:24:41,511 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11395#true} {11395#true} #820#return; {11395#true} is VALID [2022-02-20 23:24:41,512 INFO L290 TraceCheckUtils]: 46: Hoare triple {11395#true} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#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~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem41#1.base, 4 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#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~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {11395#true} is VALID [2022-02-20 23:24:41,512 INFO L290 TraceCheckUtils]: 47: Hoare triple {11395#true} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {11395#true} is VALID [2022-02-20 23:24:41,512 INFO L272 TraceCheckUtils]: 48: Hoare triple {11395#true} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {11395#true} is VALID [2022-02-20 23:24:41,512 INFO L290 TraceCheckUtils]: 49: Hoare triple {11395#true} #t~loopctr234 := 0; {11395#true} is VALID [2022-02-20 23:24:41,512 INFO L290 TraceCheckUtils]: 50: Hoare triple {11395#true} assume !(#t~loopctr234 % 4294967296 < #amount % 4294967296); {11395#true} is VALID [2022-02-20 23:24:41,512 INFO L290 TraceCheckUtils]: 51: Hoare triple {11395#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11395#true} is VALID [2022-02-20 23:24:41,512 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11395#true} {11395#true} #822#return; {11395#true} is VALID [2022-02-20 23:24:41,512 INFO L290 TraceCheckUtils]: 53: Hoare triple {11395#true} havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset; {11395#true} is VALID [2022-02-20 23:24:41,512 INFO L290 TraceCheckUtils]: 54: Hoare triple {11395#true} goto; {11395#true} is VALID [2022-02-20 23:24:41,512 INFO L290 TraceCheckUtils]: 55: Hoare triple {11395#true} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {11395#true} is VALID [2022-02-20 23:24:41,513 INFO L290 TraceCheckUtils]: 56: Hoare triple {11395#true} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {11395#true} is VALID [2022-02-20 23:24:41,513 INFO L290 TraceCheckUtils]: 57: Hoare triple {11395#true} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {11395#true} is VALID [2022-02-20 23:24:41,513 INFO L290 TraceCheckUtils]: 58: Hoare triple {11395#true} goto; {11395#true} is VALID [2022-02-20 23:24:41,513 INFO L290 TraceCheckUtils]: 59: Hoare triple {11395#true} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {11395#true} is VALID [2022-02-20 23:24:41,513 INFO L290 TraceCheckUtils]: 60: Hoare triple {11395#true} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {11395#true} is VALID [2022-02-20 23:24:41,513 INFO L290 TraceCheckUtils]: 61: Hoare triple {11395#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {11395#true} is VALID [2022-02-20 23:24:41,513 INFO L290 TraceCheckUtils]: 62: Hoare triple {11395#true} assume main_#t~short77#1;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 main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {11395#true} is VALID [2022-02-20 23:24:41,513 INFO L290 TraceCheckUtils]: 63: Hoare triple {11395#true} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {11395#true} is VALID [2022-02-20 23:24:41,513 INFO L290 TraceCheckUtils]: 64: Hoare triple {11395#true} goto; {11395#true} is VALID [2022-02-20 23:24:41,513 INFO L290 TraceCheckUtils]: 65: Hoare triple {11395#true} goto; {11395#true} is VALID [2022-02-20 23:24:41,513 INFO L290 TraceCheckUtils]: 66: Hoare triple {11395#true} goto; {11395#true} is VALID [2022-02-20 23:24:41,513 INFO L290 TraceCheckUtils]: 67: Hoare triple {11395#true} goto; {11395#true} is VALID [2022-02-20 23:24:41,513 INFO L290 TraceCheckUtils]: 68: Hoare triple {11395#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {11395#true} is VALID [2022-02-20 23:24:41,514 INFO L290 TraceCheckUtils]: 69: Hoare triple {11395#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11395#true} is VALID [2022-02-20 23:24:41,514 INFO L290 TraceCheckUtils]: 70: Hoare triple {11395#true} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {11395#true} is VALID [2022-02-20 23:24:41,514 INFO L290 TraceCheckUtils]: 71: Hoare triple {11395#true} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11395#true} is VALID [2022-02-20 23:24:41,514 INFO L290 TraceCheckUtils]: 72: Hoare triple {11395#true} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11395#true} is VALID [2022-02-20 23:24:41,514 INFO L290 TraceCheckUtils]: 73: Hoare triple {11395#true} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {11395#true} is VALID [2022-02-20 23:24:41,514 INFO L290 TraceCheckUtils]: 74: Hoare triple {11395#true} havoc main_~_hf_hashv~0#1; {11395#true} is VALID [2022-02-20 23:24:41,514 INFO L290 TraceCheckUtils]: 75: Hoare triple {11395#true} goto; {11395#true} is VALID [2022-02-20 23:24:41,515 INFO L290 TraceCheckUtils]: 76: Hoare triple {11395#true} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {11628#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} is VALID [2022-02-20 23:24:41,515 INFO L290 TraceCheckUtils]: 77: Hoare triple {11628#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {11628#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} is VALID [2022-02-20 23:24:41,515 INFO L290 TraceCheckUtils]: 78: Hoare triple {11628#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {11628#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} is VALID [2022-02-20 23:24:41,516 INFO L290 TraceCheckUtils]: 79: Hoare triple {11628#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} assume !main_#t~switch158#1; {11638#(and (<= |ULTIMATE.start_main_~_hj_k~1#1| 4) (not |ULTIMATE.start_main_#t~switch158#1|))} is VALID [2022-02-20 23:24:41,516 INFO L290 TraceCheckUtils]: 80: Hoare triple {11638#(and (<= |ULTIMATE.start_main_~_hj_k~1#1| 4) (not |ULTIMATE.start_main_#t~switch158#1|))} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {11642#(not |ULTIMATE.start_main_#t~switch158#1|)} is VALID [2022-02-20 23:24:41,516 INFO L290 TraceCheckUtils]: 81: Hoare triple {11642#(not |ULTIMATE.start_main_#t~switch158#1|)} assume main_#t~switch158#1;call main_#t~mem160#1 := read~int(main_~_hj_key~1#1.base, 9 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 65536 * (main_#t~mem160#1 % 256);havoc main_#t~mem160#1; {11396#false} is VALID [2022-02-20 23:24:41,516 INFO L290 TraceCheckUtils]: 82: Hoare triple {11396#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {11396#false} is VALID [2022-02-20 23:24:41,517 INFO L290 TraceCheckUtils]: 83: Hoare triple {11396#false} assume main_#t~switch158#1;call main_#t~mem161#1 := read~int(main_~_hj_key~1#1.base, 8 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 256 * (main_#t~mem161#1 % 256);havoc main_#t~mem161#1; {11396#false} is VALID [2022-02-20 23:24:41,517 INFO L290 TraceCheckUtils]: 84: Hoare triple {11396#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {11396#false} is VALID [2022-02-20 23:24:41,517 INFO L290 TraceCheckUtils]: 85: Hoare triple {11396#false} assume main_#t~switch158#1;call main_#t~mem162#1 := read~int(main_~_hj_key~1#1.base, 7 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 16777216 * (main_#t~mem162#1 % 256);havoc main_#t~mem162#1; {11396#false} is VALID [2022-02-20 23:24:41,517 INFO L290 TraceCheckUtils]: 86: Hoare triple {11396#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {11396#false} is VALID [2022-02-20 23:24:41,517 INFO L290 TraceCheckUtils]: 87: Hoare triple {11396#false} assume main_#t~switch158#1;call main_#t~mem163#1 := read~int(main_~_hj_key~1#1.base, 6 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 65536 * (main_#t~mem163#1 % 256);havoc main_#t~mem163#1; {11396#false} is VALID [2022-02-20 23:24:41,517 INFO L290 TraceCheckUtils]: 88: Hoare triple {11396#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {11396#false} is VALID [2022-02-20 23:24:41,517 INFO L290 TraceCheckUtils]: 89: Hoare triple {11396#false} assume main_#t~switch158#1;call main_#t~mem164#1 := read~int(main_~_hj_key~1#1.base, 5 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 256 * (main_#t~mem164#1 % 256);havoc main_#t~mem164#1; {11396#false} is VALID [2022-02-20 23:24:41,517 INFO L290 TraceCheckUtils]: 90: Hoare triple {11396#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {11396#false} is VALID [2022-02-20 23:24:41,518 INFO L290 TraceCheckUtils]: 91: Hoare triple {11396#false} assume main_#t~switch158#1;call main_#t~mem165#1 := read~int(main_~_hj_key~1#1.base, 4 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + main_#t~mem165#1 % 256;havoc main_#t~mem165#1; {11396#false} is VALID [2022-02-20 23:24:41,518 INFO L290 TraceCheckUtils]: 92: Hoare triple {11396#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {11396#false} is VALID [2022-02-20 23:24:41,518 INFO L290 TraceCheckUtils]: 93: Hoare triple {11396#false} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {11396#false} is VALID [2022-02-20 23:24:41,518 INFO L290 TraceCheckUtils]: 94: Hoare triple {11396#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {11396#false} is VALID [2022-02-20 23:24:41,518 INFO L290 TraceCheckUtils]: 95: Hoare triple {11396#false} assume main_#t~switch158#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem167#1 % 256);havoc main_#t~mem167#1; {11396#false} is VALID [2022-02-20 23:24:41,518 INFO L290 TraceCheckUtils]: 96: Hoare triple {11396#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {11396#false} is VALID [2022-02-20 23:24:41,518 INFO L290 TraceCheckUtils]: 97: Hoare triple {11396#false} assume main_#t~switch158#1;call main_#t~mem168#1 := read~int(main_~_hj_key~1#1.base, 1 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 256 * (main_#t~mem168#1 % 256);havoc main_#t~mem168#1; {11396#false} is VALID [2022-02-20 23:24:41,519 INFO L290 TraceCheckUtils]: 98: Hoare triple {11396#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {11396#false} is VALID [2022-02-20 23:24:41,519 INFO L290 TraceCheckUtils]: 99: Hoare triple {11396#false} assume main_#t~switch158#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem169#1 % 256;havoc main_#t~mem169#1; {11396#false} is VALID [2022-02-20 23:24:41,519 INFO L290 TraceCheckUtils]: 100: Hoare triple {11396#false} havoc main_#t~switch158#1; {11396#false} is VALID [2022-02-20 23:24:41,519 INFO L290 TraceCheckUtils]: 101: Hoare triple {11396#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {11396#false} is VALID [2022-02-20 23:24:41,519 INFO L290 TraceCheckUtils]: 102: Hoare triple {11396#false} goto; {11396#false} is VALID [2022-02-20 23:24:41,519 INFO L290 TraceCheckUtils]: 103: Hoare triple {11396#false} goto; {11396#false} is VALID [2022-02-20 23:24:41,519 INFO L290 TraceCheckUtils]: 104: Hoare triple {11396#false} goto; {11396#false} is VALID [2022-02-20 23:24:41,520 INFO L290 TraceCheckUtils]: 105: Hoare triple {11396#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {11396#false} is VALID [2022-02-20 23:24:41,520 INFO L290 TraceCheckUtils]: 106: Hoare triple {11396#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {11396#false} is VALID [2022-02-20 23:24:41,520 INFO L290 TraceCheckUtils]: 107: Hoare triple {11396#false} goto; {11396#false} is VALID [2022-02-20 23:24:41,520 INFO L290 TraceCheckUtils]: 108: Hoare triple {11396#false} goto; {11396#false} is VALID [2022-02-20 23:24:41,520 INFO L290 TraceCheckUtils]: 109: Hoare triple {11396#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {11396#false} is VALID [2022-02-20 23:24:41,520 INFO L290 TraceCheckUtils]: 110: Hoare triple {11396#false} assume !false; {11396#false} is VALID [2022-02-20 23:24:41,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:24:41,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:41,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:41,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122010178] [2022-02-20 23:24:41,521 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:41,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333315515] [2022-02-20 23:24:41,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333315515] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:41,521 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:41,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:24:41,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782270009] [2022-02-20 23:24:41,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:41,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-02-20 23:24:41,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:41,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:41,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:41,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:24:41,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:41,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:24:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:24:41,598 INFO L87 Difference]: Start difference. First operand 354 states and 439 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:42,262 INFO L93 Difference]: Finished difference Result 536 states and 680 transitions. [2022-02-20 23:24:42,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:24:42,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-02-20 23:24:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2022-02-20 23:24:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2022-02-20 23:24:42,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 405 transitions. [2022-02-20 23:24:42,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 405 edges. 405 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:42,557 INFO L225 Difference]: With dead ends: 536 [2022-02-20 23:24:42,557 INFO L226 Difference]: Without dead ends: 331 [2022-02-20 23:24:42,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:24:42,558 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 120 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:24:42,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 586 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:24:42,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-02-20 23:24:42,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 326. [2022-02-20 23:24:42,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:42,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 326 states, 314 states have (on average 1.213375796178344) internal successors, (381), 320 states have internal predecessors, (381), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:42,602 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 326 states, 314 states have (on average 1.213375796178344) internal successors, (381), 320 states have internal predecessors, (381), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:42,602 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 326 states, 314 states have (on average 1.213375796178344) internal successors, (381), 320 states have internal predecessors, (381), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:42,608 INFO L93 Difference]: Finished difference Result 331 states and 402 transitions. [2022-02-20 23:24:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 402 transitions. [2022-02-20 23:24:42,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:42,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:42,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 314 states have (on average 1.213375796178344) internal successors, (381), 320 states have internal predecessors, (381), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 331 states. [2022-02-20 23:24:42,610 INFO L87 Difference]: Start difference. First operand has 326 states, 314 states have (on average 1.213375796178344) internal successors, (381), 320 states have internal predecessors, (381), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 331 states. [2022-02-20 23:24:42,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:42,615 INFO L93 Difference]: Finished difference Result 331 states and 402 transitions. [2022-02-20 23:24:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 402 transitions. [2022-02-20 23:24:42,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:42,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:42,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:42,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:42,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 314 states have (on average 1.213375796178344) internal successors, (381), 320 states have internal predecessors, (381), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 397 transitions. [2022-02-20 23:24:42,622 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 397 transitions. Word has length 111 [2022-02-20 23:24:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:42,622 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 397 transitions. [2022-02-20 23:24:42,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 397 transitions. [2022-02-20 23:24:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-20 23:24:42,624 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:42,624 INFO L514 BasicCegarLoop]: trace histogram [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, 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:24:42,645 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:24:42,845 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:24:42,846 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:42,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1365745725, now seen corresponding path program 1 times [2022-02-20 23:24:42,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:42,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121730862] [2022-02-20 23:24:42,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:42,900 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:42,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [636470901] [2022-02-20 23:24:42,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:42,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:42,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:42,917 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:24:42,917 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:24:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:43,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:24:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:43,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:43,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {13400#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);~count_int_int~0 := 0; {13400#true} is VALID [2022-02-20 23:24:43,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {13400#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#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, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#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~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1.base, main_#t~mem190#1.offset, main_#t~short191#1, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, 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, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem214#1, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1.base, main_#t~mem216#1.offset, main_#t~mem217#1, main_#t~post218#1, main_#t~mem219#1.base, main_#t~mem219#1.offset, 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.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1, main_#t~post229#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem144#1, main_#t~mem145#1, main_#t~mem231#1, main_#t~mem232#1, main_#t~mem230#1.base, main_#t~mem230#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); {13400#true} is VALID [2022-02-20 23:24:43,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {13400#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {13400#true} is VALID [2022-02-20 23:24:43,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {13400#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,687 INFO L290 TraceCheckUtils]: 4: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~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; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch24#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch24#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch24#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch24#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch24#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch24#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,732 INFO L290 TraceCheckUtils]: 22: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch24#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} havoc main_#t~switch24#1; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~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)))); {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,737 INFO L290 TraceCheckUtils]: 34: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,737 INFO L290 TraceCheckUtils]: 35: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,737 INFO L290 TraceCheckUtils]: 36: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~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); {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 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); {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,739 INFO L272 TraceCheckUtils]: 41: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {13400#true} is VALID [2022-02-20 23:24:43,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {13400#true} #t~loopctr234 := 0; {13400#true} is VALID [2022-02-20 23:24:43,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {13400#true} assume !(#t~loopctr234 % 4294967296 < #amount % 4294967296); {13400#true} is VALID [2022-02-20 23:24:43,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {13400#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {13400#true} is VALID [2022-02-20 23:24:43,740 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13400#true} {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} #820#return; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#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~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem41#1.base, 4 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#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~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,741 INFO L272 TraceCheckUtils]: 48: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {13400#true} is VALID [2022-02-20 23:24:43,741 INFO L290 TraceCheckUtils]: 49: Hoare triple {13400#true} #t~loopctr234 := 0; {13400#true} is VALID [2022-02-20 23:24:43,741 INFO L290 TraceCheckUtils]: 50: Hoare triple {13400#true} assume !(#t~loopctr234 % 4294967296 < #amount % 4294967296); {13400#true} is VALID [2022-02-20 23:24:43,741 INFO L290 TraceCheckUtils]: 51: Hoare triple {13400#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {13400#true} is VALID [2022-02-20 23:24:43,742 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {13400#true} {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} #822#return; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,742 INFO L290 TraceCheckUtils]: 53: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,742 INFO L290 TraceCheckUtils]: 54: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:43,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {13414#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,744 INFO L290 TraceCheckUtils]: 59: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,744 INFO L290 TraceCheckUtils]: 60: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} 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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,745 INFO L290 TraceCheckUtils]: 62: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~short77#1;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 main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,745 INFO L290 TraceCheckUtils]: 63: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,745 INFO L290 TraceCheckUtils]: 64: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,746 INFO L290 TraceCheckUtils]: 66: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,760 INFO L290 TraceCheckUtils]: 67: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,760 INFO L290 TraceCheckUtils]: 68: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,761 INFO L290 TraceCheckUtils]: 69: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,761 INFO L290 TraceCheckUtils]: 70: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,761 INFO L290 TraceCheckUtils]: 71: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,762 INFO L290 TraceCheckUtils]: 72: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,762 INFO L290 TraceCheckUtils]: 73: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,762 INFO L290 TraceCheckUtils]: 74: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_hf_hashv~0#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,762 INFO L290 TraceCheckUtils]: 75: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,763 INFO L290 TraceCheckUtils]: 76: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,763 INFO L290 TraceCheckUtils]: 77: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,763 INFO L290 TraceCheckUtils]: 78: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,764 INFO L290 TraceCheckUtils]: 79: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch158#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,764 INFO L290 TraceCheckUtils]: 80: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,764 INFO L290 TraceCheckUtils]: 81: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch158#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,764 INFO L290 TraceCheckUtils]: 82: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,765 INFO L290 TraceCheckUtils]: 83: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch158#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,766 INFO L290 TraceCheckUtils]: 84: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,766 INFO L290 TraceCheckUtils]: 85: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch158#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,766 INFO L290 TraceCheckUtils]: 86: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,767 INFO L290 TraceCheckUtils]: 87: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch158#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,767 INFO L290 TraceCheckUtils]: 88: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,767 INFO L290 TraceCheckUtils]: 89: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch158#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,767 INFO L290 TraceCheckUtils]: 90: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,768 INFO L290 TraceCheckUtils]: 91: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch158#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,768 INFO L290 TraceCheckUtils]: 92: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,768 INFO L290 TraceCheckUtils]: 93: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,769 INFO L290 TraceCheckUtils]: 94: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,769 INFO L290 TraceCheckUtils]: 95: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch158#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem167#1 % 256);havoc main_#t~mem167#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,769 INFO L290 TraceCheckUtils]: 96: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,770 INFO L290 TraceCheckUtils]: 97: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch158#1;call main_#t~mem168#1 := read~int(main_~_hj_key~1#1.base, 1 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 256 * (main_#t~mem168#1 % 256);havoc main_#t~mem168#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,770 INFO L290 TraceCheckUtils]: 98: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,770 INFO L290 TraceCheckUtils]: 99: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch158#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem169#1 % 256;havoc main_#t~mem169#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,770 INFO L290 TraceCheckUtils]: 100: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch158#1; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,771 INFO L290 TraceCheckUtils]: 101: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,771 INFO L290 TraceCheckUtils]: 102: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,772 INFO L290 TraceCheckUtils]: 103: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,772 INFO L290 TraceCheckUtils]: 104: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,772 INFO L290 TraceCheckUtils]: 105: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:43,779 INFO L290 TraceCheckUtils]: 106: Hoare triple {13571#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {13401#false} is VALID [2022-02-20 23:24:43,779 INFO L290 TraceCheckUtils]: 107: Hoare triple {13401#false} goto; {13401#false} is VALID [2022-02-20 23:24:43,780 INFO L290 TraceCheckUtils]: 108: Hoare triple {13401#false} goto; {13401#false} is VALID [2022-02-20 23:24:43,780 INFO L290 TraceCheckUtils]: 109: Hoare triple {13401#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {13401#false} is VALID [2022-02-20 23:24:43,780 INFO L290 TraceCheckUtils]: 110: Hoare triple {13401#false} assume !false; {13401#false} is VALID [2022-02-20 23:24:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:24:43,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:43,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:43,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121730862] [2022-02-20 23:24:43,782 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:43,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636470901] [2022-02-20 23:24:43,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636470901] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:43,782 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:43,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:24:43,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130854979] [2022-02-20 23:24:43,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:43,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-02-20 23:24:43,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:43,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:43,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:43,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:24:43,850 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:43,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:24:43,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:24:43,851 INFO L87 Difference]: Start difference. First operand 326 states and 397 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:44,612 INFO L93 Difference]: Finished difference Result 720 states and 898 transitions. [2022-02-20 23:24:44,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:24:44,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-02-20 23:24:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2022-02-20 23:24:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2022-02-20 23:24:44,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 692 transitions. [2022-02-20 23:24:45,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 692 edges. 692 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:45,137 INFO L225 Difference]: With dead ends: 720 [2022-02-20 23:24:45,137 INFO L226 Difference]: Without dead ends: 442 [2022-02-20 23:24:45,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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:24:45,139 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 446 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:24:45,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 508 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:24:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-02-20 23:24:45,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 410. [2022-02-20 23:24:45,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:45,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 442 states. Second operand has 410 states, 398 states have (on average 1.2185929648241205) internal successors, (485), 404 states have internal predecessors, (485), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:45,203 INFO L74 IsIncluded]: Start isIncluded. First operand 442 states. Second operand has 410 states, 398 states have (on average 1.2185929648241205) internal successors, (485), 404 states have internal predecessors, (485), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:45,203 INFO L87 Difference]: Start difference. First operand 442 states. Second operand has 410 states, 398 states have (on average 1.2185929648241205) internal successors, (485), 404 states have internal predecessors, (485), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:45,215 INFO L93 Difference]: Finished difference Result 442 states and 552 transitions. [2022-02-20 23:24:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 552 transitions. [2022-02-20 23:24:45,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:45,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:45,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 410 states, 398 states have (on average 1.2185929648241205) internal successors, (485), 404 states have internal predecessors, (485), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 442 states. [2022-02-20 23:24:45,216 INFO L87 Difference]: Start difference. First operand has 410 states, 398 states have (on average 1.2185929648241205) internal successors, (485), 404 states have internal predecessors, (485), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 442 states. [2022-02-20 23:24:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:45,226 INFO L93 Difference]: Finished difference Result 442 states and 552 transitions. [2022-02-20 23:24:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 552 transitions. [2022-02-20 23:24:45,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:45,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:45,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:45,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 398 states have (on average 1.2185929648241205) internal successors, (485), 404 states have internal predecessors, (485), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 501 transitions. [2022-02-20 23:24:45,235 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 501 transitions. Word has length 111 [2022-02-20 23:24:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:45,235 INFO L470 AbstractCegarLoop]: Abstraction has 410 states and 501 transitions. [2022-02-20 23:24:45,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:45,235 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 501 transitions. [2022-02-20 23:24:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-20 23:24:45,236 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:45,236 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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:24:45,269 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:24:45,455 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:24:45,455 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:45,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:45,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1916658931, now seen corresponding path program 1 times [2022-02-20 23:24:45,456 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:45,456 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827018688] [2022-02-20 23:24:45,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:45,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:45,502 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:45,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [952232409] [2022-02-20 23:24:45,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:45,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:45,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:45,503 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:24:45,505 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:24:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:52,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 203 conjunts are in the unsatisfiable core [2022-02-20 23:24:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:52,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:52,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:24:52,728 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:24:52,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:24:52,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:24:52,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:24:52,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 23:24:53,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:24:53,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 23:24:53,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:24:53,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 23:24:53,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:24:53,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 23:24:53,609 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 13 treesize of output 9 [2022-02-20 23:24:53,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:24:53,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:24:53,633 INFO L356 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-02-20 23:24:53,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-02-20 23:24:53,806 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 7 treesize of output 3 [2022-02-20 23:24:53,841 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 25 treesize of output 13 [2022-02-20 23:24:54,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {15953#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);~count_int_int~0 := 0; {15953#true} is VALID [2022-02-20 23:24:54,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {15953#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#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, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#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~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1.base, main_#t~mem190#1.offset, main_#t~short191#1, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, 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, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem214#1, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1.base, main_#t~mem216#1.offset, main_#t~mem217#1, main_#t~post218#1, main_#t~mem219#1.base, main_#t~mem219#1.offset, 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.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1, main_#t~post229#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem144#1, main_#t~mem145#1, main_#t~mem231#1, main_#t~mem232#1, main_#t~mem230#1.base, main_#t~mem230#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); {15961#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {15961#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {15961#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {15961#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} havoc main_~_ha_hashv~0#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} goto; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} 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; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume !main_#t~switch24#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume !main_#t~switch24#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume !main_#t~switch24#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume !main_#t~switch24#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume !main_#t~switch24#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume !main_#t~switch24#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume !main_#t~switch24#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} havoc main_#t~switch24#1; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} 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)))); {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} goto; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} goto; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} goto; {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,889 INFO L290 TraceCheckUtils]: 37: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} 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); {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,890 INFO L290 TraceCheckUtils]: 38: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} 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); {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-20 23:24:54,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {15968#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {16077#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8))) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (not (= |ULTIMATE.start_main_~user~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8)))) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8)) |#StackHeapBarrier|))} is VALID [2022-02-20 23:24:54,892 INFO L290 TraceCheckUtils]: 40: Hoare triple {16077#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8))) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (not (= |ULTIMATE.start_main_~user~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8)))) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8)) |#StackHeapBarrier|))} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {16077#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8))) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (not (= |ULTIMATE.start_main_~user~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8)))) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8)) |#StackHeapBarrier|))} is VALID [2022-02-20 23:24:54,895 INFO L272 TraceCheckUtils]: 41: Hoare triple {16077#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8))) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (not (= |ULTIMATE.start_main_~user~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8)))) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8)) |#StackHeapBarrier|))} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {16084#(and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_11 Int)) (and (< |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| |#StackHeapBarrier|) (= 1 (select |#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| v_arrayElimCell_11)) (= (select |#valid| v_arrayElimCell_11) 1) (< v_arrayElimCell_11 |#StackHeapBarrier|))) (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|) 1) (< |#StackHeapBarrier| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|))) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 23:24:54,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {16084#(and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_11 Int)) (and (< |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| |#StackHeapBarrier|) (= 1 (select |#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| v_arrayElimCell_11)) (= (select |#valid| v_arrayElimCell_11) 1) (< v_arrayElimCell_11 |#StackHeapBarrier|))) (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|) 1) (< |#StackHeapBarrier| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|))) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} #t~loopctr234 := 0; {16088#(and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_11 Int)) (and (< |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| |#StackHeapBarrier|) (= 1 (select |#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| v_arrayElimCell_11)) (= (select |#valid| v_arrayElimCell_11) 1) (< v_arrayElimCell_11 |#StackHeapBarrier|))) (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|) 1) (< |#StackHeapBarrier| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|))) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#Ultimate.C_memset_#t~loopctr234| 0))} is VALID [2022-02-20 23:24:54,897 INFO L290 TraceCheckUtils]: 43: Hoare triple {16088#(and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_11 Int)) (and (< |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| |#StackHeapBarrier|) (= 1 (select |#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| v_arrayElimCell_11)) (= (select |#valid| v_arrayElimCell_11) 1) (< v_arrayElimCell_11 |#StackHeapBarrier|))) (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|) 1) (< |#StackHeapBarrier| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|))) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#Ultimate.C_memset_#t~loopctr234| 0))} assume !(#t~loopctr234 % 4294967296 < #amount % 4294967296); {16092#(and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_11 Int)) (and (< |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| |#StackHeapBarrier|) (= 1 (select |#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| v_arrayElimCell_11)) (= (select |#valid| v_arrayElimCell_11) 1) (< v_arrayElimCell_11 |#StackHeapBarrier|))) (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|) 1) (< |#StackHeapBarrier| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|))) (not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296))) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 23:24:54,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {16092#(and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_11 Int)) (and (< |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| |#StackHeapBarrier|) (= 1 (select |#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| v_arrayElimCell_11)) (= (select |#valid| v_arrayElimCell_11) 1) (< v_arrayElimCell_11 |#StackHeapBarrier|))) (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|) 1) (< |#StackHeapBarrier| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|))) (not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296))) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {16092#(and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_11 Int)) (and (< |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| |#StackHeapBarrier|) (= 1 (select |#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| v_arrayElimCell_11)) (= (select |#valid| v_arrayElimCell_11) 1) (< v_arrayElimCell_11 |#StackHeapBarrier|))) (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|) 1) (< |#StackHeapBarrier| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|))) (not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296))) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 23:24:54,901 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16092#(and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_11 Int)) (and (< |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| |#StackHeapBarrier|) (= 1 (select |#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3|)) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_3| v_arrayElimCell_11)) (= (select |#valid| v_arrayElimCell_11) 1) (< v_arrayElimCell_11 |#StackHeapBarrier|))) (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|) 1) (< |#StackHeapBarrier| |v_ULTIMATE.start_main_~#i~0#1.base_BEFORE_CALL_1|))) (not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296))) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} {16077#(and (= (select |#valid| |ULTIMATE.start_main_~user~0#1.base|) 1) (< |ULTIMATE.start_main_~user~0#1.base| |#StackHeapBarrier|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8))) 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~0#1.base|) (<= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= |ULTIMATE.start_main_~user~0#1.offset| 0) (not (= |ULTIMATE.start_main_~user~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8)))) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1) (< (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~user~0#1.base|) (+ |ULTIMATE.start_main_~user~0#1.offset| 8)) |#StackHeapBarrier|))} #820#return; {15954#false} is VALID [2022-02-20 23:24:54,901 INFO L290 TraceCheckUtils]: 46: Hoare triple {15954#false} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#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~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem41#1.base, 4 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#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~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {15954#false} is VALID [2022-02-20 23:24:54,901 INFO L290 TraceCheckUtils]: 47: Hoare triple {15954#false} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {15954#false} is VALID [2022-02-20 23:24:54,901 INFO L272 TraceCheckUtils]: 48: Hoare triple {15954#false} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {15954#false} is VALID [2022-02-20 23:24:54,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {15954#false} #t~loopctr234 := 0; {15954#false} is VALID [2022-02-20 23:24:54,902 INFO L290 TraceCheckUtils]: 50: Hoare triple {15954#false} assume !(#t~loopctr234 % 4294967296 < #amount % 4294967296); {15954#false} is VALID [2022-02-20 23:24:54,902 INFO L290 TraceCheckUtils]: 51: Hoare triple {15954#false} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {15954#false} is VALID [2022-02-20 23:24:54,902 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {15954#false} {15954#false} #822#return; {15954#false} is VALID [2022-02-20 23:24:54,902 INFO L290 TraceCheckUtils]: 53: Hoare triple {15954#false} havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset; {15954#false} is VALID [2022-02-20 23:24:54,902 INFO L290 TraceCheckUtils]: 54: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,902 INFO L290 TraceCheckUtils]: 55: Hoare triple {15954#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {15954#false} is VALID [2022-02-20 23:24:54,902 INFO L290 TraceCheckUtils]: 56: Hoare triple {15954#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {15954#false} is VALID [2022-02-20 23:24:54,903 INFO L290 TraceCheckUtils]: 57: Hoare triple {15954#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {15954#false} is VALID [2022-02-20 23:24:54,903 INFO L290 TraceCheckUtils]: 58: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,903 INFO L290 TraceCheckUtils]: 59: Hoare triple {15954#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {15954#false} is VALID [2022-02-20 23:24:54,903 INFO L290 TraceCheckUtils]: 60: Hoare triple {15954#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {15954#false} is VALID [2022-02-20 23:24:54,903 INFO L290 TraceCheckUtils]: 61: Hoare triple {15954#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {15954#false} is VALID [2022-02-20 23:24:54,903 INFO L290 TraceCheckUtils]: 62: Hoare triple {15954#false} assume main_#t~short77#1;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 main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {15954#false} is VALID [2022-02-20 23:24:54,903 INFO L290 TraceCheckUtils]: 63: Hoare triple {15954#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {15954#false} is VALID [2022-02-20 23:24:54,903 INFO L290 TraceCheckUtils]: 64: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,904 INFO L290 TraceCheckUtils]: 65: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,904 INFO L290 TraceCheckUtils]: 66: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,904 INFO L290 TraceCheckUtils]: 67: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,904 INFO L290 TraceCheckUtils]: 68: Hoare triple {15954#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {15954#false} is VALID [2022-02-20 23:24:54,904 INFO L290 TraceCheckUtils]: 69: Hoare triple {15954#false} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {15954#false} is VALID [2022-02-20 23:24:54,904 INFO L290 TraceCheckUtils]: 70: Hoare triple {15954#false} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {15954#false} is VALID [2022-02-20 23:24:54,904 INFO L290 TraceCheckUtils]: 71: Hoare triple {15954#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {15954#false} is VALID [2022-02-20 23:24:54,904 INFO L290 TraceCheckUtils]: 72: Hoare triple {15954#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {15954#false} is VALID [2022-02-20 23:24:54,905 INFO L290 TraceCheckUtils]: 73: Hoare triple {15954#false} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {15954#false} is VALID [2022-02-20 23:24:54,905 INFO L290 TraceCheckUtils]: 74: Hoare triple {15954#false} havoc main_~_hf_hashv~0#1; {15954#false} is VALID [2022-02-20 23:24:54,905 INFO L290 TraceCheckUtils]: 75: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,905 INFO L290 TraceCheckUtils]: 76: Hoare triple {15954#false} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {15954#false} is VALID [2022-02-20 23:24:54,905 INFO L290 TraceCheckUtils]: 77: Hoare triple {15954#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {15954#false} is VALID [2022-02-20 23:24:54,905 INFO L290 TraceCheckUtils]: 78: Hoare triple {15954#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {15954#false} is VALID [2022-02-20 23:24:54,905 INFO L290 TraceCheckUtils]: 79: Hoare triple {15954#false} assume !main_#t~switch158#1; {15954#false} is VALID [2022-02-20 23:24:54,905 INFO L290 TraceCheckUtils]: 80: Hoare triple {15954#false} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {15954#false} is VALID [2022-02-20 23:24:54,906 INFO L290 TraceCheckUtils]: 81: Hoare triple {15954#false} assume !main_#t~switch158#1; {15954#false} is VALID [2022-02-20 23:24:54,906 INFO L290 TraceCheckUtils]: 82: Hoare triple {15954#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {15954#false} is VALID [2022-02-20 23:24:54,906 INFO L290 TraceCheckUtils]: 83: Hoare triple {15954#false} assume !main_#t~switch158#1; {15954#false} is VALID [2022-02-20 23:24:54,906 INFO L290 TraceCheckUtils]: 84: Hoare triple {15954#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {15954#false} is VALID [2022-02-20 23:24:54,906 INFO L290 TraceCheckUtils]: 85: Hoare triple {15954#false} assume !main_#t~switch158#1; {15954#false} is VALID [2022-02-20 23:24:54,906 INFO L290 TraceCheckUtils]: 86: Hoare triple {15954#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {15954#false} is VALID [2022-02-20 23:24:54,906 INFO L290 TraceCheckUtils]: 87: Hoare triple {15954#false} assume !main_#t~switch158#1; {15954#false} is VALID [2022-02-20 23:24:54,906 INFO L290 TraceCheckUtils]: 88: Hoare triple {15954#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {15954#false} is VALID [2022-02-20 23:24:54,907 INFO L290 TraceCheckUtils]: 89: Hoare triple {15954#false} assume !main_#t~switch158#1; {15954#false} is VALID [2022-02-20 23:24:54,907 INFO L290 TraceCheckUtils]: 90: Hoare triple {15954#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {15954#false} is VALID [2022-02-20 23:24:54,907 INFO L290 TraceCheckUtils]: 91: Hoare triple {15954#false} assume !main_#t~switch158#1; {15954#false} is VALID [2022-02-20 23:24:54,907 INFO L290 TraceCheckUtils]: 92: Hoare triple {15954#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {15954#false} is VALID [2022-02-20 23:24:54,907 INFO L290 TraceCheckUtils]: 93: Hoare triple {15954#false} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {15954#false} is VALID [2022-02-20 23:24:54,907 INFO L290 TraceCheckUtils]: 94: Hoare triple {15954#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {15954#false} is VALID [2022-02-20 23:24:54,907 INFO L290 TraceCheckUtils]: 95: Hoare triple {15954#false} assume main_#t~switch158#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem167#1 % 256);havoc main_#t~mem167#1; {15954#false} is VALID [2022-02-20 23:24:54,907 INFO L290 TraceCheckUtils]: 96: Hoare triple {15954#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {15954#false} is VALID [2022-02-20 23:24:54,908 INFO L290 TraceCheckUtils]: 97: Hoare triple {15954#false} assume main_#t~switch158#1;call main_#t~mem168#1 := read~int(main_~_hj_key~1#1.base, 1 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 256 * (main_#t~mem168#1 % 256);havoc main_#t~mem168#1; {15954#false} is VALID [2022-02-20 23:24:54,908 INFO L290 TraceCheckUtils]: 98: Hoare triple {15954#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {15954#false} is VALID [2022-02-20 23:24:54,908 INFO L290 TraceCheckUtils]: 99: Hoare triple {15954#false} assume main_#t~switch158#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem169#1 % 256;havoc main_#t~mem169#1; {15954#false} is VALID [2022-02-20 23:24:54,908 INFO L290 TraceCheckUtils]: 100: Hoare triple {15954#false} havoc main_#t~switch158#1; {15954#false} is VALID [2022-02-20 23:24:54,908 INFO L290 TraceCheckUtils]: 101: Hoare triple {15954#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {15954#false} is VALID [2022-02-20 23:24:54,908 INFO L290 TraceCheckUtils]: 102: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,908 INFO L290 TraceCheckUtils]: 103: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,908 INFO L290 TraceCheckUtils]: 104: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,909 INFO L290 TraceCheckUtils]: 105: Hoare triple {15954#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {15954#false} is VALID [2022-02-20 23:24:54,909 INFO L290 TraceCheckUtils]: 106: Hoare triple {15954#false} assume main_~users~0#1.base != 0 || main_~users~0#1.offset != 0;havoc main_~_hf_bkt~0#1; {15954#false} is VALID [2022-02-20 23:24:54,909 INFO L290 TraceCheckUtils]: 107: Hoare triple {15954#false} call main_#t~mem170#1.base, main_#t~mem170#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem171#1 := read~int(main_#t~mem170#1.base, 4 + main_#t~mem170#1.offset, 4);main_~_hf_bkt~0#1 := (if 0 == main_~_hf_hashv~0#1 || 0 == main_#t~mem171#1 - 1 then 0 else (if 1 == main_#t~mem171#1 - 1 then (if 1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1 then main_~_hf_hashv~0#1 else (if main_~_hf_hashv~0#1 >= 0 then main_~_hf_hashv~0#1 % 2 else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem171#1 - 1))) else (if 1 == main_~_hf_hashv~0#1 then (if 1 == main_#t~mem171#1 - 1 || 0 == main_#t~mem171#1 - 1 then main_#t~mem171#1 - 1 else (if main_#t~mem171#1 - 1 >= 0 then (main_#t~mem171#1 - 1) % 2 else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem171#1 - 1))) else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem171#1 - 1))));havoc main_#t~mem170#1.base, main_#t~mem170#1.offset;havoc main_#t~mem171#1; {15954#false} is VALID [2022-02-20 23:24:54,909 INFO L290 TraceCheckUtils]: 108: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,909 INFO L290 TraceCheckUtils]: 109: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,909 INFO L290 TraceCheckUtils]: 110: Hoare triple {15954#false} call main_#t~mem172#1.base, main_#t~mem172#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem173#1.base, main_#t~mem173#1.offset := read~$Pointer$(main_#t~mem172#1.base, main_#t~mem172#1.offset, 4);call main_#t~mem174#1.base, main_#t~mem174#1.offset := read~$Pointer$(main_#t~mem173#1.base, main_#t~mem173#1.offset + 12 * (if main_~_hf_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_hf_bkt~0#1 % 4294967296 % 4294967296 else main_~_hf_bkt~0#1 % 4294967296 % 4294967296 - 4294967296), 4); {15954#false} is VALID [2022-02-20 23:24:54,909 INFO L290 TraceCheckUtils]: 111: Hoare triple {15954#false} assume !(main_#t~mem174#1.base != 0 || main_#t~mem174#1.offset != 0);havoc main_#t~mem172#1.base, main_#t~mem172#1.offset;havoc main_#t~mem173#1.base, main_#t~mem173#1.offset;havoc main_#t~mem174#1.base, main_#t~mem174#1.offset;main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {15954#false} is VALID [2022-02-20 23:24:54,910 INFO L290 TraceCheckUtils]: 112: Hoare triple {15954#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {15954#false} is VALID [2022-02-20 23:24:54,910 INFO L290 TraceCheckUtils]: 113: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,910 INFO L290 TraceCheckUtils]: 114: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,910 INFO L290 TraceCheckUtils]: 115: Hoare triple {15954#false} goto; {15954#false} is VALID [2022-02-20 23:24:54,910 INFO L290 TraceCheckUtils]: 116: Hoare triple {15954#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {15954#false} is VALID [2022-02-20 23:24:54,910 INFO L290 TraceCheckUtils]: 117: Hoare triple {15954#false} assume !false; {15954#false} is VALID [2022-02-20 23:24:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:24:54,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:54,911 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:54,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827018688] [2022-02-20 23:24:54,911 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:54,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952232409] [2022-02-20 23:24:54,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952232409] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:54,912 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:54,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:24:54,912 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305723355] [2022-02-20 23:24:54,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:54,913 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2022-02-20 23:24:54,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:54,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:24:55,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:55,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:24:55,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:55,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:24:55,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:24:55,034 INFO L87 Difference]: Start difference. First operand 410 states and 501 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:24:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:56,605 INFO L93 Difference]: Finished difference Result 773 states and 950 transitions. [2022-02-20 23:24:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:24:56,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2022-02-20 23:24:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:24:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 540 transitions. [2022-02-20 23:24:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:24:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 540 transitions. [2022-02-20 23:24:56,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 540 transitions. [2022-02-20 23:24:57,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 540 edges. 540 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:57,045 INFO L225 Difference]: With dead ends: 773 [2022-02-20 23:24:57,045 INFO L226 Difference]: Without dead ends: 412 [2022-02-20 23:24:57,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:24:57,046 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 43 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:24:57,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 769 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 107 Unchecked, 0.4s Time] [2022-02-20 23:24:57,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-02-20 23:24:57,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2022-02-20 23:24:57,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:57,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 412 states. Second operand has 412 states, 400 states have (on average 1.2175) internal successors, (487), 405 states have internal predecessors, (487), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:57,138 INFO L74 IsIncluded]: Start isIncluded. First operand 412 states. Second operand has 412 states, 400 states have (on average 1.2175) internal successors, (487), 405 states have internal predecessors, (487), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:57,139 INFO L87 Difference]: Start difference. First operand 412 states. Second operand has 412 states, 400 states have (on average 1.2175) internal successors, (487), 405 states have internal predecessors, (487), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:57,152 INFO L93 Difference]: Finished difference Result 412 states and 503 transitions. [2022-02-20 23:24:57,152 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 503 transitions. [2022-02-20 23:24:57,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:57,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:57,154 INFO L74 IsIncluded]: Start isIncluded. First operand has 412 states, 400 states have (on average 1.2175) internal successors, (487), 405 states have internal predecessors, (487), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 412 states. [2022-02-20 23:24:57,154 INFO L87 Difference]: Start difference. First operand has 412 states, 400 states have (on average 1.2175) internal successors, (487), 405 states have internal predecessors, (487), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 412 states. [2022-02-20 23:24:57,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:57,165 INFO L93 Difference]: Finished difference Result 412 states and 503 transitions. [2022-02-20 23:24:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 503 transitions. [2022-02-20 23:24:57,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:57,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:57,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:57,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 400 states have (on average 1.2175) internal successors, (487), 405 states have internal predecessors, (487), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 503 transitions. [2022-02-20 23:24:57,179 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 503 transitions. Word has length 118 [2022-02-20 23:24:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:57,179 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 503 transitions. [2022-02-20 23:24:57,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:24:57,180 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 503 transitions. [2022-02-20 23:24:57,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-02-20 23:24:57,181 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:57,181 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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:24:57,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-20 23:24:57,401 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:24:57,402 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:57,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:57,403 INFO L85 PathProgramCache]: Analyzing trace with hash 870640575, now seen corresponding path program 1 times [2022-02-20 23:24:57,403 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:57,403 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673728576] [2022-02-20 23:24:57,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:57,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:57,457 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:57,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623477049] [2022-02-20 23:24:57,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:57,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:57,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:57,461 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:24:57,463 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:25:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:25:02,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:25:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:25:02,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:25:02,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {18522#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);~count_int_int~0 := 0; {18522#true} is VALID [2022-02-20 23:25:02,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {18522#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#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, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#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~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1.base, main_#t~mem190#1.offset, main_#t~short191#1, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, 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, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem214#1, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1.base, main_#t~mem216#1.offset, main_#t~mem217#1, main_#t~post218#1, main_#t~mem219#1.base, main_#t~mem219#1.offset, 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.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1, main_#t~post229#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem144#1, main_#t~mem145#1, main_#t~mem231#1, main_#t~mem232#1, main_#t~mem230#1.base, main_#t~mem230#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); {18522#true} is VALID [2022-02-20 23:25:02,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {18522#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18522#true} is VALID [2022-02-20 23:25:02,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {18522#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {18522#true} is VALID [2022-02-20 23:25:02,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {18522#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {18522#true} is VALID [2022-02-20 23:25:02,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {18522#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {18522#true} is VALID [2022-02-20 23:25:02,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {18522#true} havoc main_~_ha_hashv~0#1; {18522#true} is VALID [2022-02-20 23:25:02,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {18522#true} goto; {18522#true} is VALID [2022-02-20 23:25:02,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {18522#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; {18522#true} is VALID [2022-02-20 23:25:02,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {18522#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {18522#true} is VALID [2022-02-20 23:25:02,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {18522#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:02,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {18522#true} assume !main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:02,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:02,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {18522#true} assume !main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:02,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:02,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {18522#true} assume !main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:02,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:02,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {18522#true} assume !main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:02,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:02,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {18522#true} assume !main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:02,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:02,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {18522#true} assume !main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:02,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:02,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {18522#true} assume !main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:02,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:02,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {18522#true} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {18522#true} is VALID [2022-02-20 23:25:02,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:02,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {18522#true} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {18522#true} is VALID [2022-02-20 23:25:02,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:02,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {18522#true} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {18522#true} is VALID [2022-02-20 23:25:02,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:02,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {18522#true} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {18522#true} is VALID [2022-02-20 23:25:02,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {18522#true} havoc main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:02,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {18522#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)))); {18522#true} is VALID [2022-02-20 23:25:02,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {18522#true} goto; {18522#true} is VALID [2022-02-20 23:25:02,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {18522#true} goto; {18522#true} is VALID [2022-02-20 23:25:02,832 INFO L290 TraceCheckUtils]: 36: Hoare triple {18522#true} goto; {18522#true} is VALID [2022-02-20 23:25:02,833 INFO L290 TraceCheckUtils]: 37: Hoare triple {18522#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); {18522#true} is VALID [2022-02-20 23:25:02,833 INFO L290 TraceCheckUtils]: 38: Hoare triple {18522#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); {18522#true} is VALID [2022-02-20 23:25:02,833 INFO L290 TraceCheckUtils]: 39: Hoare triple {18522#true} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {18522#true} is VALID [2022-02-20 23:25:02,833 INFO L290 TraceCheckUtils]: 40: Hoare triple {18522#true} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {18522#true} is VALID [2022-02-20 23:25:02,833 INFO L272 TraceCheckUtils]: 41: Hoare triple {18522#true} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {18522#true} is VALID [2022-02-20 23:25:02,833 INFO L290 TraceCheckUtils]: 42: Hoare triple {18522#true} #t~loopctr234 := 0; {18653#(= |#Ultimate.C_memset_#t~loopctr234| 0)} is VALID [2022-02-20 23:25:02,834 INFO L290 TraceCheckUtils]: 43: Hoare triple {18653#(= |#Ultimate.C_memset_#t~loopctr234| 0)} assume #t~loopctr234 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr234 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr234 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr234 := #value];#t~loopctr234 := 1 + #t~loopctr234; {18522#true} is VALID [2022-02-20 23:25:02,834 INFO L290 TraceCheckUtils]: 44: Hoare triple {18522#true} assume !(#t~loopctr234 % 4294967296 < #amount % 4294967296); {18522#true} is VALID [2022-02-20 23:25:02,834 INFO L290 TraceCheckUtils]: 45: Hoare triple {18522#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18522#true} is VALID [2022-02-20 23:25:02,834 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18522#true} {18522#true} #820#return; {18522#true} is VALID [2022-02-20 23:25:02,834 INFO L290 TraceCheckUtils]: 47: Hoare triple {18522#true} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#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~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem41#1.base, 4 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#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~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {18522#true} is VALID [2022-02-20 23:25:02,834 INFO L290 TraceCheckUtils]: 48: Hoare triple {18522#true} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {18522#true} is VALID [2022-02-20 23:25:02,834 INFO L272 TraceCheckUtils]: 49: Hoare triple {18522#true} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {18522#true} is VALID [2022-02-20 23:25:02,835 INFO L290 TraceCheckUtils]: 50: Hoare triple {18522#true} #t~loopctr234 := 0; {18653#(= |#Ultimate.C_memset_#t~loopctr234| 0)} is VALID [2022-02-20 23:25:02,835 INFO L290 TraceCheckUtils]: 51: Hoare triple {18653#(= |#Ultimate.C_memset_#t~loopctr234| 0)} assume !(#t~loopctr234 % 4294967296 < #amount % 4294967296); {18681#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:25:02,836 INFO L290 TraceCheckUtils]: 52: Hoare triple {18681#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18681#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:25:02,837 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18681#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} {18522#true} #822#return; {18523#false} is VALID [2022-02-20 23:25:02,837 INFO L290 TraceCheckUtils]: 54: Hoare triple {18523#false} havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset; {18523#false} is VALID [2022-02-20 23:25:02,837 INFO L290 TraceCheckUtils]: 55: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,837 INFO L290 TraceCheckUtils]: 56: Hoare triple {18523#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {18523#false} is VALID [2022-02-20 23:25:02,837 INFO L290 TraceCheckUtils]: 57: Hoare triple {18523#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {18523#false} is VALID [2022-02-20 23:25:02,837 INFO L290 TraceCheckUtils]: 58: Hoare triple {18523#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {18523#false} is VALID [2022-02-20 23:25:02,838 INFO L290 TraceCheckUtils]: 59: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {18523#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {18523#false} is VALID [2022-02-20 23:25:02,838 INFO L290 TraceCheckUtils]: 61: Hoare triple {18523#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {18523#false} is VALID [2022-02-20 23:25:02,838 INFO L290 TraceCheckUtils]: 62: Hoare triple {18523#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {18523#false} is VALID [2022-02-20 23:25:02,838 INFO L290 TraceCheckUtils]: 63: Hoare triple {18523#false} assume main_#t~short77#1;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 main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {18523#false} is VALID [2022-02-20 23:25:02,838 INFO L290 TraceCheckUtils]: 64: Hoare triple {18523#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {18523#false} is VALID [2022-02-20 23:25:02,838 INFO L290 TraceCheckUtils]: 65: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,839 INFO L290 TraceCheckUtils]: 66: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,839 INFO L290 TraceCheckUtils]: 67: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,839 INFO L290 TraceCheckUtils]: 68: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,839 INFO L290 TraceCheckUtils]: 69: Hoare triple {18523#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {18523#false} is VALID [2022-02-20 23:25:02,839 INFO L290 TraceCheckUtils]: 70: Hoare triple {18523#false} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18523#false} is VALID [2022-02-20 23:25:02,839 INFO L290 TraceCheckUtils]: 71: Hoare triple {18523#false} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {18523#false} is VALID [2022-02-20 23:25:02,839 INFO L290 TraceCheckUtils]: 72: Hoare triple {18523#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18523#false} is VALID [2022-02-20 23:25:02,840 INFO L290 TraceCheckUtils]: 73: Hoare triple {18523#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18523#false} is VALID [2022-02-20 23:25:02,840 INFO L290 TraceCheckUtils]: 74: Hoare triple {18523#false} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {18523#false} is VALID [2022-02-20 23:25:02,840 INFO L290 TraceCheckUtils]: 75: Hoare triple {18523#false} havoc main_~_hf_hashv~0#1; {18523#false} is VALID [2022-02-20 23:25:02,840 INFO L290 TraceCheckUtils]: 76: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,840 INFO L290 TraceCheckUtils]: 77: Hoare triple {18523#false} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {18523#false} is VALID [2022-02-20 23:25:02,840 INFO L290 TraceCheckUtils]: 78: Hoare triple {18523#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {18523#false} is VALID [2022-02-20 23:25:02,841 INFO L290 TraceCheckUtils]: 79: Hoare triple {18523#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:02,841 INFO L290 TraceCheckUtils]: 80: Hoare triple {18523#false} assume !main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:02,841 INFO L290 TraceCheckUtils]: 81: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:02,841 INFO L290 TraceCheckUtils]: 82: Hoare triple {18523#false} assume !main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:02,841 INFO L290 TraceCheckUtils]: 83: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:02,841 INFO L290 TraceCheckUtils]: 84: Hoare triple {18523#false} assume !main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:02,841 INFO L290 TraceCheckUtils]: 85: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:02,842 INFO L290 TraceCheckUtils]: 86: Hoare triple {18523#false} assume !main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:02,842 INFO L290 TraceCheckUtils]: 87: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:02,842 INFO L290 TraceCheckUtils]: 88: Hoare triple {18523#false} assume !main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:02,842 INFO L290 TraceCheckUtils]: 89: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:02,842 INFO L290 TraceCheckUtils]: 90: Hoare triple {18523#false} assume !main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:02,842 INFO L290 TraceCheckUtils]: 91: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:02,842 INFO L290 TraceCheckUtils]: 92: Hoare triple {18523#false} assume !main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:02,843 INFO L290 TraceCheckUtils]: 93: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:02,843 INFO L290 TraceCheckUtils]: 94: Hoare triple {18523#false} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {18523#false} is VALID [2022-02-20 23:25:02,843 INFO L290 TraceCheckUtils]: 95: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:02,843 INFO L290 TraceCheckUtils]: 96: Hoare triple {18523#false} assume main_#t~switch158#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem167#1 % 256);havoc main_#t~mem167#1; {18523#false} is VALID [2022-02-20 23:25:02,843 INFO L290 TraceCheckUtils]: 97: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:02,843 INFO L290 TraceCheckUtils]: 98: Hoare triple {18523#false} assume main_#t~switch158#1;call main_#t~mem168#1 := read~int(main_~_hj_key~1#1.base, 1 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 256 * (main_#t~mem168#1 % 256);havoc main_#t~mem168#1; {18523#false} is VALID [2022-02-20 23:25:02,843 INFO L290 TraceCheckUtils]: 99: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:02,844 INFO L290 TraceCheckUtils]: 100: Hoare triple {18523#false} assume main_#t~switch158#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem169#1 % 256;havoc main_#t~mem169#1; {18523#false} is VALID [2022-02-20 23:25:02,844 INFO L290 TraceCheckUtils]: 101: Hoare triple {18523#false} havoc main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:02,844 INFO L290 TraceCheckUtils]: 102: Hoare triple {18523#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {18523#false} is VALID [2022-02-20 23:25:02,844 INFO L290 TraceCheckUtils]: 103: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,844 INFO L290 TraceCheckUtils]: 104: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,844 INFO L290 TraceCheckUtils]: 105: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,845 INFO L290 TraceCheckUtils]: 106: Hoare triple {18523#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {18523#false} is VALID [2022-02-20 23:25:02,845 INFO L290 TraceCheckUtils]: 107: Hoare triple {18523#false} assume main_~users~0#1.base != 0 || main_~users~0#1.offset != 0;havoc main_~_hf_bkt~0#1; {18523#false} is VALID [2022-02-20 23:25:02,845 INFO L290 TraceCheckUtils]: 108: Hoare triple {18523#false} call main_#t~mem170#1.base, main_#t~mem170#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem171#1 := read~int(main_#t~mem170#1.base, 4 + main_#t~mem170#1.offset, 4);main_~_hf_bkt~0#1 := (if 0 == main_~_hf_hashv~0#1 || 0 == main_#t~mem171#1 - 1 then 0 else (if 1 == main_#t~mem171#1 - 1 then (if 1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1 then main_~_hf_hashv~0#1 else (if main_~_hf_hashv~0#1 >= 0 then main_~_hf_hashv~0#1 % 2 else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem171#1 - 1))) else (if 1 == main_~_hf_hashv~0#1 then (if 1 == main_#t~mem171#1 - 1 || 0 == main_#t~mem171#1 - 1 then main_#t~mem171#1 - 1 else (if main_#t~mem171#1 - 1 >= 0 then (main_#t~mem171#1 - 1) % 2 else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem171#1 - 1))) else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem171#1 - 1))));havoc main_#t~mem170#1.base, main_#t~mem170#1.offset;havoc main_#t~mem171#1; {18523#false} is VALID [2022-02-20 23:25:02,845 INFO L290 TraceCheckUtils]: 109: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,845 INFO L290 TraceCheckUtils]: 110: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,845 INFO L290 TraceCheckUtils]: 111: Hoare triple {18523#false} call main_#t~mem172#1.base, main_#t~mem172#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem173#1.base, main_#t~mem173#1.offset := read~$Pointer$(main_#t~mem172#1.base, main_#t~mem172#1.offset, 4);call main_#t~mem174#1.base, main_#t~mem174#1.offset := read~$Pointer$(main_#t~mem173#1.base, main_#t~mem173#1.offset + 12 * (if main_~_hf_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_hf_bkt~0#1 % 4294967296 % 4294967296 else main_~_hf_bkt~0#1 % 4294967296 % 4294967296 - 4294967296), 4); {18523#false} is VALID [2022-02-20 23:25:02,845 INFO L290 TraceCheckUtils]: 112: Hoare triple {18523#false} assume !(main_#t~mem174#1.base != 0 || main_#t~mem174#1.offset != 0);havoc main_#t~mem172#1.base, main_#t~mem172#1.offset;havoc main_#t~mem173#1.base, main_#t~mem173#1.offset;havoc main_#t~mem174#1.base, main_#t~mem174#1.offset;main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {18523#false} is VALID [2022-02-20 23:25:02,846 INFO L290 TraceCheckUtils]: 113: Hoare triple {18523#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {18523#false} is VALID [2022-02-20 23:25:02,846 INFO L290 TraceCheckUtils]: 114: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,846 INFO L290 TraceCheckUtils]: 115: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,846 INFO L290 TraceCheckUtils]: 116: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:02,846 INFO L290 TraceCheckUtils]: 117: Hoare triple {18523#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {18523#false} is VALID [2022-02-20 23:25:02,846 INFO L290 TraceCheckUtils]: 118: Hoare triple {18523#false} assume !false; {18523#false} is VALID [2022-02-20 23:25:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:25:02,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:25:03,289 INFO L290 TraceCheckUtils]: 118: Hoare triple {18523#false} assume !false; {18523#false} is VALID [2022-02-20 23:25:03,289 INFO L290 TraceCheckUtils]: 117: Hoare triple {18523#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {18523#false} is VALID [2022-02-20 23:25:03,289 INFO L290 TraceCheckUtils]: 116: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,289 INFO L290 TraceCheckUtils]: 115: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,289 INFO L290 TraceCheckUtils]: 114: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,289 INFO L290 TraceCheckUtils]: 113: Hoare triple {18523#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {18523#false} is VALID [2022-02-20 23:25:03,289 INFO L290 TraceCheckUtils]: 112: Hoare triple {18523#false} assume !(main_#t~mem174#1.base != 0 || main_#t~mem174#1.offset != 0);havoc main_#t~mem172#1.base, main_#t~mem172#1.offset;havoc main_#t~mem173#1.base, main_#t~mem173#1.offset;havoc main_#t~mem174#1.base, main_#t~mem174#1.offset;main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {18523#false} is VALID [2022-02-20 23:25:03,289 INFO L290 TraceCheckUtils]: 111: Hoare triple {18523#false} call main_#t~mem172#1.base, main_#t~mem172#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem173#1.base, main_#t~mem173#1.offset := read~$Pointer$(main_#t~mem172#1.base, main_#t~mem172#1.offset, 4);call main_#t~mem174#1.base, main_#t~mem174#1.offset := read~$Pointer$(main_#t~mem173#1.base, main_#t~mem173#1.offset + 12 * (if main_~_hf_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_hf_bkt~0#1 % 4294967296 % 4294967296 else main_~_hf_bkt~0#1 % 4294967296 % 4294967296 - 4294967296), 4); {18523#false} is VALID [2022-02-20 23:25:03,289 INFO L290 TraceCheckUtils]: 110: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,290 INFO L290 TraceCheckUtils]: 109: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,290 INFO L290 TraceCheckUtils]: 108: Hoare triple {18523#false} call main_#t~mem170#1.base, main_#t~mem170#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem171#1 := read~int(main_#t~mem170#1.base, 4 + main_#t~mem170#1.offset, 4);main_~_hf_bkt~0#1 := (if 0 == main_~_hf_hashv~0#1 || 0 == main_#t~mem171#1 - 1 then 0 else (if 1 == main_#t~mem171#1 - 1 then (if 1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1 then main_~_hf_hashv~0#1 else (if main_~_hf_hashv~0#1 >= 0 then main_~_hf_hashv~0#1 % 2 else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem171#1 - 1))) else (if 1 == main_~_hf_hashv~0#1 then (if 1 == main_#t~mem171#1 - 1 || 0 == main_#t~mem171#1 - 1 then main_#t~mem171#1 - 1 else (if main_#t~mem171#1 - 1 >= 0 then (main_#t~mem171#1 - 1) % 2 else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem171#1 - 1))) else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem171#1 - 1))));havoc main_#t~mem170#1.base, main_#t~mem170#1.offset;havoc main_#t~mem171#1; {18523#false} is VALID [2022-02-20 23:25:03,290 INFO L290 TraceCheckUtils]: 107: Hoare triple {18523#false} assume main_~users~0#1.base != 0 || main_~users~0#1.offset != 0;havoc main_~_hf_bkt~0#1; {18523#false} is VALID [2022-02-20 23:25:03,290 INFO L290 TraceCheckUtils]: 106: Hoare triple {18523#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {18523#false} is VALID [2022-02-20 23:25:03,290 INFO L290 TraceCheckUtils]: 105: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,290 INFO L290 TraceCheckUtils]: 104: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,290 INFO L290 TraceCheckUtils]: 103: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,290 INFO L290 TraceCheckUtils]: 102: Hoare triple {18523#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {18523#false} is VALID [2022-02-20 23:25:03,290 INFO L290 TraceCheckUtils]: 101: Hoare triple {18523#false} havoc main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:03,290 INFO L290 TraceCheckUtils]: 100: Hoare triple {18523#false} assume main_#t~switch158#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem169#1 % 256;havoc main_#t~mem169#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 99: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 98: Hoare triple {18523#false} assume main_#t~switch158#1;call main_#t~mem168#1 := read~int(main_~_hj_key~1#1.base, 1 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 256 * (main_#t~mem168#1 % 256);havoc main_#t~mem168#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 97: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 96: Hoare triple {18523#false} assume main_#t~switch158#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem167#1 % 256);havoc main_#t~mem167#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 95: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 94: Hoare triple {18523#false} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 93: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 92: Hoare triple {18523#false} assume !main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 91: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 90: Hoare triple {18523#false} assume !main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 89: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 88: Hoare triple {18523#false} assume !main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 87: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 86: Hoare triple {18523#false} assume !main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 85: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:03,291 INFO L290 TraceCheckUtils]: 84: Hoare triple {18523#false} assume !main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:03,292 INFO L290 TraceCheckUtils]: 83: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 82: Hoare triple {18523#false} assume !main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 81: Hoare triple {18523#false} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 80: Hoare triple {18523#false} assume !main_#t~switch158#1; {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 79: Hoare triple {18523#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 78: Hoare triple {18523#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 77: Hoare triple {18523#false} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 76: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 75: Hoare triple {18523#false} havoc main_~_hf_hashv~0#1; {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 74: Hoare triple {18523#false} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 73: Hoare triple {18523#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 72: Hoare triple {18523#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 71: Hoare triple {18523#false} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 70: Hoare triple {18523#false} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 69: Hoare triple {18523#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 68: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 67: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,293 INFO L290 TraceCheckUtils]: 66: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,294 INFO L290 TraceCheckUtils]: 65: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,294 INFO L290 TraceCheckUtils]: 64: Hoare triple {18523#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {18523#false} is VALID [2022-02-20 23:25:03,294 INFO L290 TraceCheckUtils]: 63: Hoare triple {18523#false} assume main_#t~short77#1;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 main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {18523#false} is VALID [2022-02-20 23:25:03,294 INFO L290 TraceCheckUtils]: 62: Hoare triple {18523#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~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {18523#false} is VALID [2022-02-20 23:25:03,294 INFO L290 TraceCheckUtils]: 61: Hoare triple {18523#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#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~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {18523#false} is VALID [2022-02-20 23:25:03,294 INFO L290 TraceCheckUtils]: 60: Hoare triple {18523#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#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~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {18523#false} is VALID [2022-02-20 23:25:03,294 INFO L290 TraceCheckUtils]: 59: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,295 INFO L290 TraceCheckUtils]: 58: Hoare triple {18523#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#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~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {18523#false} is VALID [2022-02-20 23:25:03,295 INFO L290 TraceCheckUtils]: 57: Hoare triple {18523#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {18523#false} is VALID [2022-02-20 23:25:03,295 INFO L290 TraceCheckUtils]: 56: Hoare triple {18523#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {18523#false} is VALID [2022-02-20 23:25:03,295 INFO L290 TraceCheckUtils]: 55: Hoare triple {18523#false} goto; {18523#false} is VALID [2022-02-20 23:25:03,295 INFO L290 TraceCheckUtils]: 54: Hoare triple {18523#false} havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset; {18523#false} is VALID [2022-02-20 23:25:03,296 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {19081#(not (= 384 |#Ultimate.C_memset_#amount|))} {18522#true} #822#return; {18523#false} is VALID [2022-02-20 23:25:03,296 INFO L290 TraceCheckUtils]: 52: Hoare triple {19081#(not (= 384 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {19081#(not (= 384 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 23:25:03,297 INFO L290 TraceCheckUtils]: 51: Hoare triple {19088#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (< (mod |#Ultimate.C_memset_#t~loopctr234| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume !(#t~loopctr234 % 4294967296 < #amount % 4294967296); {19081#(not (= 384 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-20 23:25:03,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {18522#true} #t~loopctr234 := 0; {19088#(or (not (= 384 |#Ultimate.C_memset_#amount|)) (< (mod |#Ultimate.C_memset_#t~loopctr234| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:25:03,297 INFO L272 TraceCheckUtils]: 49: Hoare triple {18522#true} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {18522#true} is VALID [2022-02-20 23:25:03,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {18522#true} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {18522#true} is VALID [2022-02-20 23:25:03,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {18522#true} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#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~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem41#1.base, 4 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#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~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {18522#true} is VALID [2022-02-20 23:25:03,298 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18522#true} {18522#true} #820#return; {18522#true} is VALID [2022-02-20 23:25:03,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {18522#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18522#true} is VALID [2022-02-20 23:25:03,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {18522#true} assume !(#t~loopctr234 % 4294967296 < #amount % 4294967296); {18522#true} is VALID [2022-02-20 23:25:03,298 INFO L290 TraceCheckUtils]: 43: Hoare triple {18522#true} assume #t~loopctr234 % 4294967296 < #amount % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr234 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr234 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr234 := #value];#t~loopctr234 := 1 + #t~loopctr234; {18522#true} is VALID [2022-02-20 23:25:03,298 INFO L290 TraceCheckUtils]: 42: Hoare triple {18522#true} #t~loopctr234 := 0; {18522#true} is VALID [2022-02-20 23:25:03,298 INFO L272 TraceCheckUtils]: 41: Hoare triple {18522#true} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {18522#true} is VALID [2022-02-20 23:25:03,298 INFO L290 TraceCheckUtils]: 40: Hoare triple {18522#true} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {18522#true} is VALID [2022-02-20 23:25:03,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {18522#true} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {18522#true} is VALID [2022-02-20 23:25:03,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {18522#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); {18522#true} is VALID [2022-02-20 23:25:03,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {18522#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); {18522#true} is VALID [2022-02-20 23:25:03,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {18522#true} goto; {18522#true} is VALID [2022-02-20 23:25:03,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {18522#true} goto; {18522#true} is VALID [2022-02-20 23:25:03,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {18522#true} goto; {18522#true} is VALID [2022-02-20 23:25:03,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {18522#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)))); {18522#true} is VALID [2022-02-20 23:25:03,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {18522#true} havoc main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:03,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {18522#true} assume main_#t~switch24#1;call main_#t~mem35#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~mem35#1 % 256;havoc main_#t~mem35#1; {18522#true} is VALID [2022-02-20 23:25:03,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:03,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {18522#true} assume main_#t~switch24#1;call main_#t~mem34#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~mem34#1 % 256);havoc main_#t~mem34#1; {18522#true} is VALID [2022-02-20 23:25:03,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:03,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {18522#true} assume main_#t~switch24#1;call main_#t~mem33#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~mem33#1 % 256);havoc main_#t~mem33#1; {18522#true} is VALID [2022-02-20 23:25:03,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:03,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {18522#true} assume main_#t~switch24#1;call main_#t~mem32#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~mem32#1 % 256);havoc main_#t~mem32#1; {18522#true} is VALID [2022-02-20 23:25:03,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:03,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {18522#true} assume !main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:03,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:03,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {18522#true} assume !main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:03,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:03,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {18522#true} assume !main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:03,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:03,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {18522#true} assume !main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:03,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:03,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {18522#true} assume !main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:03,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:03,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {18522#true} assume !main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:03,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {18522#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:03,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {18522#true} assume !main_#t~switch24#1; {18522#true} is VALID [2022-02-20 23:25:03,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {18522#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {18522#true} is VALID [2022-02-20 23:25:03,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {18522#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {18522#true} is VALID [2022-02-20 23:25:03,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {18522#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; {18522#true} is VALID [2022-02-20 23:25:03,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {18522#true} goto; {18522#true} is VALID [2022-02-20 23:25:03,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {18522#true} havoc main_~_ha_hashv~0#1; {18522#true} is VALID [2022-02-20 23:25:03,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {18522#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {18522#true} is VALID [2022-02-20 23:25:03,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {18522#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {18522#true} is VALID [2022-02-20 23:25:03,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {18522#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {18522#true} is VALID [2022-02-20 23:25:03,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {18522#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18522#true} is VALID [2022-02-20 23:25:03,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {18522#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#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~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#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, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#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~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#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~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#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~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1.base, main_#t~mem189#1.offset, main_#t~mem190#1.base, main_#t~mem190#1.offset, main_#t~short191#1, main_#t~mem192#1.base, main_#t~mem192#1.offset, main_#t~mem193#1.base, main_#t~mem193#1.offset, main_#t~mem194#1.base, main_#t~mem194#1.offset, main_#t~mem195#1.base, main_#t~mem195#1.offset, main_#t~mem196#1.base, main_#t~mem196#1.offset, main_#t~mem197#1.base, main_#t~mem197#1.offset, main_#t~mem198#1.base, main_#t~mem198#1.offset, main_#t~mem199#1.base, main_#t~mem199#1.offset, main_#t~mem200#1, main_#t~mem201#1.base, main_#t~mem201#1.offset, main_#t~mem202#1.base, main_#t~mem202#1.offset, main_#t~mem203#1.base, main_#t~mem203#1.offset, main_#t~mem204#1, main_#t~mem205#1.base, main_#t~mem205#1.offset, main_#t~mem206#1.base, main_#t~mem206#1.offset, 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, main_#t~mem211#1.base, main_#t~mem211#1.offset, main_#t~mem214#1, main_#t~mem212#1.base, main_#t~mem212#1.offset, main_#t~mem213#1, main_#t~mem215#1.base, main_#t~mem215#1.offset, main_#t~mem216#1.base, main_#t~mem216#1.offset, main_#t~mem217#1, main_#t~post218#1, main_#t~mem219#1.base, main_#t~mem219#1.offset, 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.base, main_#t~mem223#1.offset, main_#t~mem224#1.base, main_#t~mem224#1.offset, main_#t~mem225#1.base, main_#t~mem225#1.offset, main_#t~mem226#1.base, main_#t~mem226#1.offset, main_~_hd_head~0#1.base, main_~_hd_head~0#1.offset, main_#t~mem227#1.base, main_#t~mem227#1.offset, main_#t~mem228#1, main_#t~post229#1, main_~_hd_bkt~0#1, main_~_hd_hh_del~0#1.base, main_~_hd_hh_del~0#1.offset, main_#t~mem144#1, main_#t~mem145#1, main_#t~mem231#1, main_#t~mem232#1, main_#t~mem230#1.base, main_#t~mem230#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); {18522#true} is VALID [2022-02-20 23:25:03,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {18522#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);~count_int_int~0 := 0; {18522#true} is VALID [2022-02-20 23:25:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:25:03,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:25:03,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673728576] [2022-02-20 23:25:03,306 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:25:03,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623477049] [2022-02-20 23:25:03,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623477049] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 23:25:03,306 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:25:03,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-02-20 23:25:03,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139390890] [2022-02-20 23:25:03,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:25:03,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 119 [2022-02-20 23:25:03,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:25:03,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:25:03,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:25:03,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:25:03,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:25:03,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:25:03,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:25:03,392 INFO L87 Difference]: Start difference. First operand 412 states and 503 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:25:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:25:04,132 INFO L93 Difference]: Finished difference Result 772 states and 950 transitions. [2022-02-20 23:25:04,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:25:04,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 119 [2022-02-20 23:25:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:25:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:25:04,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-02-20 23:25:04,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:25:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2022-02-20 23:25:04,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 495 transitions. [2022-02-20 23:25:04,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:25:04,497 INFO L225 Difference]: With dead ends: 772 [2022-02-20 23:25:04,498 INFO L226 Difference]: Without dead ends: 416 [2022-02-20 23:25:04,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:25:04,499 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 5 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:25:04,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 728 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:25:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-02-20 23:25:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2022-02-20 23:25:04,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:25:04,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 416 states. Second operand has 416 states, 403 states have (on average 1.2208436724565757) internal successors, (492), 409 states have internal predecessors, (492), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 23:25:04,586 INFO L74 IsIncluded]: Start isIncluded. First operand 416 states. Second operand has 416 states, 403 states have (on average 1.2208436724565757) internal successors, (492), 409 states have internal predecessors, (492), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 23:25:04,586 INFO L87 Difference]: Start difference. First operand 416 states. Second operand has 416 states, 403 states have (on average 1.2208436724565757) internal successors, (492), 409 states have internal predecessors, (492), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 23:25:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:25:04,597 INFO L93 Difference]: Finished difference Result 416 states and 509 transitions. [2022-02-20 23:25:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 509 transitions. [2022-02-20 23:25:04,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:25:04,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:25:04,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 416 states, 403 states have (on average 1.2208436724565757) internal successors, (492), 409 states have internal predecessors, (492), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) Second operand 416 states. [2022-02-20 23:25:04,599 INFO L87 Difference]: Start difference. First operand has 416 states, 403 states have (on average 1.2208436724565757) internal successors, (492), 409 states have internal predecessors, (492), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) Second operand 416 states. [2022-02-20 23:25:04,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:25:04,610 INFO L93 Difference]: Finished difference Result 416 states and 509 transitions. [2022-02-20 23:25:04,610 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 509 transitions. [2022-02-20 23:25:04,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:25:04,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:25:04,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:25:04,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:25:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 403 states have (on average 1.2208436724565757) internal successors, (492), 409 states have internal predecessors, (492), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 23:25:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 509 transitions. [2022-02-20 23:25:04,623 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 509 transitions. Word has length 119 [2022-02-20 23:25:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:25:04,623 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 509 transitions. [2022-02-20 23:25:04,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:25:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 509 transitions. [2022-02-20 23:25:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-02-20 23:25:04,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:25:04,625 INFO L514 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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:25:04,655 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:25:04,847 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:25:04,847 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:25:04,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:25:04,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1353137643, now seen corresponding path program 2 times [2022-02-20 23:25:04,848 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:25:04,848 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851487786] [2022-02-20 23:25:04,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:25:04,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:25:04,914 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:25:04,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941531499] [2022-02-20 23:25:04,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:25:04,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:25:04,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:25:04,916 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:25:04,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process