./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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_SFH_test1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 470d7065e9fd450e98d72326ef313763cf0710ea45f0a443b018e8a49bdf7927 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:20:38,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:20:38,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:20:38,427 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:20:38,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:20:38,428 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:20:38,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:20:38,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:20:38,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:20:38,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:20:38,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:20:38,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:20:38,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:20:38,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:20:38,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:20:38,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:20:38,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:20:38,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:20:38,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:20:38,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:20:38,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:20:38,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:20:38,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:20:38,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:20:38,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:20:38,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:20:38,460 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:20:38,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:20:38,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:20:38,461 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:20:38,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:20:38,462 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:20:38,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:20:38,463 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:20:38,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:20:38,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:20:38,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:20:38,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:20:38,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:20:38,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:20:38,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:20:38,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:20:38,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:20:38,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:20:38,486 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:20:38,486 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:20:38,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:20:38,487 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:20:38,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:20:38,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:20:38,488 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:20:38,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:20:38,489 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:20:38,490 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:20:38,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:20:38,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:20:38,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:20:38,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:20:38,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:20:38,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:20:38,491 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:20:38,491 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:20:38,492 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:20:38,492 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:20:38,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:20:38,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:20:38,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:20:38,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:20:38,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:20:38,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:20:38,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:20:38,495 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:20:38,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:20:38,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:20:38,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:20:38,496 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 ! overflow) ) 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 -> 470d7065e9fd450e98d72326ef313763cf0710ea45f0a443b018e8a49bdf7927 [2022-02-21 03:20:38,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:20:38,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:20:38,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:20:38,726 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:20:38,727 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:20:38,728 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i [2022-02-21 03:20:38,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cb67807/98749ba07ad64a81a3d03ebb6e204ddf/FLAGce41772b9 [2022-02-21 03:20:39,300 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:20:39,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test1-1.i [2022-02-21 03:20:39,318 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cb67807/98749ba07ad64a81a3d03ebb6e204ddf/FLAGce41772b9 [2022-02-21 03:20:39,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4cb67807/98749ba07ad64a81a3d03ebb6e204ddf [2022-02-21 03:20:39,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:20:39,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:20:39,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:20:39,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:20:39,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:20:39,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:20:39" (1/1) ... [2022-02-21 03:20:39,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c09b54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:39, skipping insertion in model container [2022-02-21 03:20:39,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:20:39" (1/1) ... [2022-02-21 03:20:39,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:20:39,676 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:20:39,979 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_SFH_test1-1.i[33021,33034] [2022-02-21 03:20:40,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:20:40,098 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:20:40,129 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_SFH_test1-1.i[33021,33034] [2022-02-21 03:20:40,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:20:40,217 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:20:40,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:40 WrapperNode [2022-02-21 03:20:40,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:20:40,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:20:40,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:20:40,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:20:40,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:40" (1/1) ... [2022-02-21 03:20:40,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:40" (1/1) ... [2022-02-21 03:20:40,330 INFO L137 Inliner]: procedures = 177, calls = 186, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 627 [2022-02-21 03:20:40,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:20:40,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:20:40,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:20:40,332 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:20:40,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:40" (1/1) ... [2022-02-21 03:20:40,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:40" (1/1) ... [2022-02-21 03:20:40,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:40" (1/1) ... [2022-02-21 03:20:40,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:40" (1/1) ... [2022-02-21 03:20:40,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:40" (1/1) ... [2022-02-21 03:20:40,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:40" (1/1) ... [2022-02-21 03:20:40,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:40" (1/1) ... [2022-02-21 03:20:40,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:20:40,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:20:40,445 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:20:40,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:20:40,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:40" (1/1) ... [2022-02-21 03:20:40,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:20:40,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:40,489 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-21 03:20:40,532 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-21 03:20:40,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:20:40,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-21 03:20:40,554 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-21 03:20:40,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:20:40,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-21 03:20:40,555 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-21 03:20:40,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:20:40,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:20:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:20:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 03:20:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 03:20:40,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:20:40,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:20:40,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:20:40,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:20:40,674 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:20:40,675 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:20:42,062 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:20:42,072 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:20:42,073 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-02-21 03:20:42,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:20:42 BoogieIcfgContainer [2022-02-21 03:20:42,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:20:42,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:20:42,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:20:42,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:20:42,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:20:39" (1/3) ... [2022-02-21 03:20:42,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a18378d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:20:42, skipping insertion in model container [2022-02-21 03:20:42,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:20:40" (2/3) ... [2022-02-21 03:20:42,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a18378d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:20:42, skipping insertion in model container [2022-02-21 03:20:42,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:20:42" (3/3) ... [2022-02-21 03:20:42,085 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test1-1.i [2022-02-21 03:20:42,090 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:20:42,095 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-21 03:20:42,136 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:20:42,149 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=FINITE_AUTOMATA, 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-21 03:20:42,149 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-21 03:20:42,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 116 states have (on average 1.6810344827586208) internal successors, (195), 132 states have internal predecessors, (195), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:42,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:20:42,177 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:42,178 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:20:42,179 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:42,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:42,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1126635289, now seen corresponding path program 1 times [2022-02-21 03:20:42,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:42,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112110785] [2022-02-21 03:20:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:42,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:42,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#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; {141#true} is VALID [2022-02-21 03:20:42,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {143#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:42,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 10); {142#false} is VALID [2022-02-21 03:20:42,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {142#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {142#false} is VALID [2022-02-21 03:20:42,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {142#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem140#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem141#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~mem140#1, main_#t~mem141#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; {142#false} is VALID [2022-02-21 03:20:42,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#false} assume !(1 + test_int_int_#t~post3#1 <= 2147483647); {142#false} is VALID [2022-02-21 03:20:42,389 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-21 03:20:42,391 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:20:42,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112110785] [2022-02-21 03:20:42,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112110785] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:20:42,393 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:20:42,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:20:42,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074408595] [2022-02-21 03:20:42,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:20:42,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-21 03:20:42,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:20:42,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 03:20:42,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:42,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:20:42,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:20:42,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:20:42,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:20:42,458 INFO L87 Difference]: Start difference. First operand has 138 states, 116 states have (on average 1.6810344827586208) internal successors, (195), 132 states have internal predecessors, (195), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 03:20:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:43,035 INFO L93 Difference]: Finished difference Result 366 states and 607 transitions. [2022-02-21 03:20:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:20:43,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-21 03:20:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:20:43,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 03:20:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2022-02-21 03:20:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 03:20:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 607 transitions. [2022-02-21 03:20:43,073 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 607 transitions. [2022-02-21 03:20:43,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:43,663 INFO L225 Difference]: With dead ends: 366 [2022-02-21 03:20:43,670 INFO L226 Difference]: Without dead ends: 226 [2022-02-21 03:20:43,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-21 03:20:43,677 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 113 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:20:43,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 386 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:20:43,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-02-21 03:20:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 137. [2022-02-21 03:20:43,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:20:43,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:43,735 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:43,736 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:43,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:43,749 INFO L93 Difference]: Finished difference Result 226 states and 300 transitions. [2022-02-21 03:20:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 300 transitions. [2022-02-21 03:20:43,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:43,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:43,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 226 states. [2022-02-21 03:20:43,759 INFO L87 Difference]: Start difference. First operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 226 states. [2022-02-21 03:20:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:43,773 INFO L93 Difference]: Finished difference Result 226 states and 300 transitions. [2022-02-21 03:20:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 300 transitions. [2022-02-21 03:20:43,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:43,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:43,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:20:43,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:20:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 131 states have internal predecessors, (158), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 184 transitions. [2022-02-21 03:20:43,787 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 184 transitions. Word has length 6 [2022-02-21 03:20:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:20:43,788 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 184 transitions. [2022-02-21 03:20:43,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 03:20:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 184 transitions. [2022-02-21 03:20:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-21 03:20:43,792 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:43,792 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:20:43,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:20:43,795 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:43,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:43,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1116651610, now seen corresponding path program 1 times [2022-02-21 03:20:43,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:43,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802162845] [2022-02-21 03:20:43,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:43,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:43,976 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:20:43,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427093695] [2022-02-21 03:20:43,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:43,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:43,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:43,981 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-21 03:20:43,996 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-21 03:20:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:44,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:20:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:44,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:20:44,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {1217#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; {1217#true} is VALID [2022-02-21 03:20:44,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {1217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {1217#true} is VALID [2022-02-21 03:20:44,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {1217#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {1217#true} is VALID [2022-02-21 03:20:44,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {1217#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {1217#true} is VALID [2022-02-21 03:20:44,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {1217#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {1217#true} is VALID [2022-02-21 03:20:44,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {1217#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {1217#true} is VALID [2022-02-21 03:20:44,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {1217#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {1217#true} is VALID [2022-02-21 03:20:44,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {1217#true} havoc main_~_ha_hashv~0#1; {1217#true} is VALID [2022-02-21 03:20:44,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {1217#true} goto; {1217#true} is VALID [2022-02-21 03:20:44,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {1217#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; {1217#true} is VALID [2022-02-21 03:20:44,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {1217#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {1217#true} is VALID [2022-02-21 03:20:44,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {1217#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {1217#true} is VALID [2022-02-21 03:20:44,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {1217#true} assume main_#t~switch19#1;call main_#t~mem20#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~mem20#1 % 256);havoc main_#t~mem20#1; {1217#true} is VALID [2022-02-21 03:20:44,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {1217#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {1217#true} is VALID [2022-02-21 03:20:44,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {1217#true} assume main_#t~switch19#1;call main_#t~mem21#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~mem21#1 % 256);havoc main_#t~mem21#1; {1217#true} is VALID [2022-02-21 03:20:44,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {1217#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {1217#true} is VALID [2022-02-21 03:20:44,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {1217#true} assume main_#t~switch19#1;call main_#t~mem22#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~mem22#1 % 256);havoc main_#t~mem22#1; {1217#true} is VALID [2022-02-21 03:20:44,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {1217#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {1217#true} is VALID [2022-02-21 03:20:44,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {1217#true} assume main_#t~switch19#1;call main_#t~mem23#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~mem23#1 % 256);havoc main_#t~mem23#1; {1217#true} is VALID [2022-02-21 03:20:44,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {1217#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {1217#true} is VALID [2022-02-21 03:20:44,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {1217#true} assume main_#t~switch19#1;call main_#t~mem24#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~mem24#1 % 256);havoc main_#t~mem24#1; {1217#true} is VALID [2022-02-21 03:20:44,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {1217#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {1217#true} is VALID [2022-02-21 03:20:44,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {1217#true} assume main_#t~switch19#1;call main_#t~mem25#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~mem25#1 % 256);havoc main_#t~mem25#1; {1288#|ULTIMATE.start_main_#t~switch19#1|} is VALID [2022-02-21 03:20:44,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {1288#|ULTIMATE.start_main_#t~switch19#1|} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {1288#|ULTIMATE.start_main_#t~switch19#1|} is VALID [2022-02-21 03:20:44,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {1288#|ULTIMATE.start_main_#t~switch19#1|} assume !main_#t~switch19#1; {1218#false} is VALID [2022-02-21 03:20:44,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {1218#false} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {1218#false} is VALID [2022-02-21 03:20:44,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {1218#false} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {1218#false} is VALID [2022-02-21 03:20:44,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {1218#false} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {1218#false} is VALID [2022-02-21 03:20:44,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {1218#false} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {1218#false} is VALID [2022-02-21 03:20:44,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {1218#false} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {1218#false} is VALID [2022-02-21 03:20:44,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {1218#false} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {1218#false} is VALID [2022-02-21 03:20:44,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {1218#false} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {1218#false} is VALID [2022-02-21 03:20:44,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {1218#false} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {1218#false} is VALID [2022-02-21 03:20:44,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {1218#false} havoc main_#t~switch19#1; {1218#false} is VALID [2022-02-21 03:20:44,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {1218#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)))); {1218#false} is VALID [2022-02-21 03:20:44,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:20:44,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:20:44,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:20:44,764 INFO L290 TraceCheckUtils]: 38: Hoare triple {1218#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); {1218#false} is VALID [2022-02-21 03:20:44,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {1218#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {1218#false} is VALID [2022-02-21 03:20:44,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {1218#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;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~mem52#1;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 main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {1218#false} is VALID [2022-02-21 03:20:44,764 INFO L290 TraceCheckUtils]: 41: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:20:44,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {1218#false} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {1218#false} is VALID [2022-02-21 03:20:44,765 INFO L290 TraceCheckUtils]: 43: Hoare triple {1218#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {1218#false} is VALID [2022-02-21 03:20:44,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:20:44,765 INFO L290 TraceCheckUtils]: 45: Hoare triple {1218#false} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {1218#false} is VALID [2022-02-21 03:20:44,766 INFO L290 TraceCheckUtils]: 46: Hoare triple {1218#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {1218#false} is VALID [2022-02-21 03:20:44,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {1218#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {1218#false} is VALID [2022-02-21 03:20:44,766 INFO L290 TraceCheckUtils]: 48: Hoare triple {1218#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {1218#false} is VALID [2022-02-21 03:20:44,766 INFO L290 TraceCheckUtils]: 49: Hoare triple {1218#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {1218#false} is VALID [2022-02-21 03:20:44,766 INFO L290 TraceCheckUtils]: 50: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:20:44,767 INFO L290 TraceCheckUtils]: 51: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:20:44,767 INFO L290 TraceCheckUtils]: 52: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:20:44,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {1218#false} goto; {1218#false} is VALID [2022-02-21 03:20:44,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {1218#false} main_#t~post5#1 := main_~i~0#1; {1218#false} is VALID [2022-02-21 03:20:44,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {1218#false} assume !(1 + main_#t~post5#1 <= 2147483647); {1218#false} is VALID [2022-02-21 03:20:44,768 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-21 03:20:44,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:20:44,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:20:44,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802162845] [2022-02-21 03:20:44,768 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:20:44,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427093695] [2022-02-21 03:20:44,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427093695] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:20:44,769 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:20:44,769 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:20:44,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109996580] [2022-02-21 03:20:44,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:20:44,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2022-02-21 03:20:44,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:20:44,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-21 03:20:44,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:44,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:20:44,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:20:44,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:20:44,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:20:44,817 INFO L87 Difference]: Start difference. First operand 137 states and 184 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-21 03:20:45,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:45,421 INFO L93 Difference]: Finished difference Result 289 states and 393 transitions. [2022-02-21 03:20:45,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:20:45,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2022-02-21 03:20:45,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:20:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-21 03:20:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-02-21 03:20:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-21 03:20:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-02-21 03:20:45,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 389 transitions. [2022-02-21 03:20:45,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:45,781 INFO L225 Difference]: With dead ends: 289 [2022-02-21 03:20:45,781 INFO L226 Difference]: Without dead ends: 158 [2022-02-21 03:20:45,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-21 03:20:45,783 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 9 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 305 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-21 03:20:45,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 305 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:20:45,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-21 03:20:45,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2022-02-21 03:20:45,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:20:45,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:45,815 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:45,815 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:45,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:45,820 INFO L93 Difference]: Finished difference Result 158 states and 205 transitions. [2022-02-21 03:20:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2022-02-21 03:20:45,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:45,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:45,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 158 states. [2022-02-21 03:20:45,822 INFO L87 Difference]: Start difference. First operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 158 states. [2022-02-21 03:20:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:45,827 INFO L93 Difference]: Finished difference Result 158 states and 205 transitions. [2022-02-21 03:20:45,827 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 205 transitions. [2022-02-21 03:20:45,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:45,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:45,828 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:20:45,828 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:20:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 151 states have internal predecessors, (178), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 204 transitions. [2022-02-21 03:20:45,833 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 204 transitions. Word has length 56 [2022-02-21 03:20:45,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:20:45,833 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 204 transitions. [2022-02-21 03:20:45,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-21 03:20:45,834 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 204 transitions. [2022-02-21 03:20:45,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-21 03:20:45,835 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:45,835 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:20:45,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:20:46,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:46,061 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:46,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:46,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1391411224, now seen corresponding path program 1 times [2022-02-21 03:20:46,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:46,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319226977] [2022-02-21 03:20:46,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:46,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:46,178 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:20:46,179 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [762021243] [2022-02-21 03:20:46,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:46,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:46,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:46,182 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-21 03:20:46,186 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-21 03:20:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:46,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:20:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:46,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:20:46,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {2247#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; {2247#true} is VALID [2022-02-21 03:20:46,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {2247#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {2247#true} is VALID [2022-02-21 03:20:46,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {2247#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {2247#true} is VALID [2022-02-21 03:20:46,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {2247#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {2247#true} is VALID [2022-02-21 03:20:46,891 INFO L290 TraceCheckUtils]: 4: Hoare triple {2247#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {2247#true} is VALID [2022-02-21 03:20:46,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {2247#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {2247#true} is VALID [2022-02-21 03:20:46,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {2247#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {2247#true} is VALID [2022-02-21 03:20:46,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {2247#true} havoc main_~_ha_hashv~0#1; {2247#true} is VALID [2022-02-21 03:20:46,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {2247#true} goto; {2247#true} is VALID [2022-02-21 03:20:46,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {2247#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; {2279#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-21 03:20:46,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {2279#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {2279#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-21 03:20:46,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {2279#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {2286#(not |ULTIMATE.start_main_#t~switch19#1|)} is VALID [2022-02-21 03:20:46,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {2286#(not |ULTIMATE.start_main_#t~switch19#1|)} assume main_#t~switch19#1;call main_#t~mem20#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~mem20#1 % 256);havoc main_#t~mem20#1; {2248#false} is VALID [2022-02-21 03:20:46,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:20:46,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem21#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~mem21#1 % 256);havoc main_#t~mem21#1; {2248#false} is VALID [2022-02-21 03:20:46,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:20:46,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem22#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~mem22#1 % 256);havoc main_#t~mem22#1; {2248#false} is VALID [2022-02-21 03:20:46,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:20:46,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem23#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~mem23#1 % 256);havoc main_#t~mem23#1; {2248#false} is VALID [2022-02-21 03:20:46,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:20:46,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem24#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~mem24#1 % 256);havoc main_#t~mem24#1; {2248#false} is VALID [2022-02-21 03:20:46,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:20:46,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem25#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~mem25#1 % 256);havoc main_#t~mem25#1; {2248#false} is VALID [2022-02-21 03:20:46,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:20:46,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem26#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~mem26#1 % 256;havoc main_#t~mem26#1; {2248#false} is VALID [2022-02-21 03:20:46,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:20:46,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {2248#false} is VALID [2022-02-21 03:20:46,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:20:46,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {2248#false} is VALID [2022-02-21 03:20:46,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:20:46,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {2248#false} is VALID [2022-02-21 03:20:46,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {2248#false} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {2248#false} is VALID [2022-02-21 03:20:46,897 INFO L290 TraceCheckUtils]: 32: Hoare triple {2248#false} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {2248#false} is VALID [2022-02-21 03:20:46,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {2248#false} havoc main_#t~switch19#1; {2248#false} is VALID [2022-02-21 03:20:46,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {2248#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)))); {2248#false} is VALID [2022-02-21 03:20:46,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:20:46,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:20:46,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:20:46,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {2248#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); {2248#false} is VALID [2022-02-21 03:20:46,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {2248#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {2248#false} is VALID [2022-02-21 03:20:46,899 INFO L290 TraceCheckUtils]: 40: Hoare triple {2248#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;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~mem52#1;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 main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {2248#false} is VALID [2022-02-21 03:20:46,899 INFO L290 TraceCheckUtils]: 41: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:20:46,899 INFO L290 TraceCheckUtils]: 42: Hoare triple {2248#false} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {2248#false} is VALID [2022-02-21 03:20:46,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {2248#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {2248#false} is VALID [2022-02-21 03:20:46,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:20:46,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {2248#false} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {2248#false} is VALID [2022-02-21 03:20:46,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {2248#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {2248#false} is VALID [2022-02-21 03:20:46,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {2248#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {2248#false} is VALID [2022-02-21 03:20:46,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {2248#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {2248#false} is VALID [2022-02-21 03:20:46,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {2248#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {2248#false} is VALID [2022-02-21 03:20:46,908 INFO L290 TraceCheckUtils]: 50: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:20:46,908 INFO L290 TraceCheckUtils]: 51: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:20:46,908 INFO L290 TraceCheckUtils]: 52: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:20:46,908 INFO L290 TraceCheckUtils]: 53: Hoare triple {2248#false} goto; {2248#false} is VALID [2022-02-21 03:20:46,908 INFO L290 TraceCheckUtils]: 54: Hoare triple {2248#false} main_#t~post5#1 := main_~i~0#1; {2248#false} is VALID [2022-02-21 03:20:46,908 INFO L290 TraceCheckUtils]: 55: Hoare triple {2248#false} assume !(1 + main_#t~post5#1 <= 2147483647); {2248#false} is VALID [2022-02-21 03:20:46,909 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-21 03:20:46,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:20:46,909 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:20:46,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319226977] [2022-02-21 03:20:46,909 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:20:46,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762021243] [2022-02-21 03:20:46,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762021243] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:20:46,910 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:20:46,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:20:46,910 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166901363] [2022-02-21 03:20:46,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:20:46,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2022-02-21 03:20:46,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:20:46,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-21 03:20:47,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:47,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:20:47,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:20:47,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:20:47,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:20:47,030 INFO L87 Difference]: Start difference. First operand 157 states and 204 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-21 03:20:47,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:47,780 INFO L93 Difference]: Finished difference Result 299 states and 393 transitions. [2022-02-21 03:20:47,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:20:47,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2022-02-21 03:20:47,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:20:47,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-21 03:20:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 370 transitions. [2022-02-21 03:20:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-21 03:20:47,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 370 transitions. [2022-02-21 03:20:47,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 370 transitions. [2022-02-21 03:20:48,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:48,126 INFO L225 Difference]: With dead ends: 299 [2022-02-21 03:20:48,126 INFO L226 Difference]: Without dead ends: 148 [2022-02-21 03:20:48,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-21 03:20:48,128 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 135 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 339 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-21 03:20:48,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 339 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:20:48,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-02-21 03:20:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2022-02-21 03:20:48,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:20:48,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:48,167 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:48,168 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:48,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:48,172 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions. [2022-02-21 03:20:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions. [2022-02-21 03:20:48,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:48,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:48,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 148 states. [2022-02-21 03:20:48,175 INFO L87 Difference]: Start difference. First operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand 148 states. [2022-02-21 03:20:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:48,179 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions. [2022-02-21 03:20:48,179 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions. [2022-02-21 03:20:48,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:48,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:48,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:20:48,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:20:48,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 137 states have internal predecessors, (157), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-21 03:20:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2022-02-21 03:20:48,185 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 56 [2022-02-21 03:20:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:20:48,186 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2022-02-21 03:20:48,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-21 03:20:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2022-02-21 03:20:48,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-02-21 03:20:48,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:48,187 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:20:48,220 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-21 03:20:48,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-21 03:20:48,401 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:48,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:48,402 INFO L85 PathProgramCache]: Analyzing trace with hash 632524954, now seen corresponding path program 1 times [2022-02-21 03:20:48,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:48,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980313103] [2022-02-21 03:20:48,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:48,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:48,488 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:20:48,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246632117] [2022-02-21 03:20:48,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:48,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:48,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:48,490 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-21 03:20:48,492 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-21 03:20:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:49,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:20:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:49,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:20:49,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {3259#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; {3259#true} is VALID [2022-02-21 03:20:49,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {3259#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,375 INFO L290 TraceCheckUtils]: 4: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_hashv~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 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; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,385 INFO L290 TraceCheckUtils]: 20: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~switch19#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,390 INFO L290 TraceCheckUtils]: 34: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 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)))); {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,390 INFO L290 TraceCheckUtils]: 35: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 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); {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;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~mem52#1;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 main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,394 INFO L290 TraceCheckUtils]: 41: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,397 INFO L290 TraceCheckUtils]: 47: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,413 INFO L290 TraceCheckUtils]: 50: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,413 INFO L290 TraceCheckUtils]: 51: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,445 INFO L290 TraceCheckUtils]: 52: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,446 INFO L290 TraceCheckUtils]: 53: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:49,446 INFO L290 TraceCheckUtils]: 54: Hoare triple {3267#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post5#1 := main_~i~0#1; {3427#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:20:49,447 INFO L290 TraceCheckUtils]: 55: Hoare triple {3427#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(1 + main_#t~post5#1 <= 2147483647); {3260#false} is VALID [2022-02-21 03:20:49,447 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-21 03:20:49,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:20:49,448 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:20:49,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980313103] [2022-02-21 03:20:49,448 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:20:49,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246632117] [2022-02-21 03:20:49,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246632117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:20:49,449 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:20:49,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:20:49,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705271727] [2022-02-21 03:20:49,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:20:49,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2022-02-21 03:20:49,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:20:49,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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-21 03:20:49,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:49,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:20:49,497 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:20:49,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:20:49,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:20:49,498 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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-21 03:20:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:50,044 INFO L93 Difference]: Finished difference Result 238 states and 298 transitions. [2022-02-21 03:20:50,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:20:50,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2022-02-21 03:20:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:20:50,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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-21 03:20:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 286 transitions. [2022-02-21 03:20:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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-21 03:20:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 286 transitions. [2022-02-21 03:20:50,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 286 transitions. [2022-02-21 03:20:50,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:50,307 INFO L225 Difference]: With dead ends: 238 [2022-02-21 03:20:50,308 INFO L226 Difference]: Without dead ends: 237 [2022-02-21 03:20:50,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 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-21 03:20:50,309 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 55 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:20:50,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 498 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:20:50,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-02-21 03:20:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2022-02-21 03:20:50,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:20:50,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:50,372 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:50,372 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:50,378 INFO L93 Difference]: Finished difference Result 237 states and 297 transitions. [2022-02-21 03:20:50,378 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 297 transitions. [2022-02-21 03:20:50,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:50,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:50,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand 237 states. [2022-02-21 03:20:50,380 INFO L87 Difference]: Start difference. First operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand 237 states. [2022-02-21 03:20:50,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:50,385 INFO L93 Difference]: Finished difference Result 237 states and 297 transitions. [2022-02-21 03:20:50,385 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 297 transitions. [2022-02-21 03:20:50,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:50,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:50,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:20:50,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:20:50,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 212 states have (on average 1.240566037735849) internal successors, (263), 226 states have internal predecessors, (263), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 295 transitions. [2022-02-21 03:20:50,393 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 295 transitions. Word has length 56 [2022-02-21 03:20:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:20:50,393 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 295 transitions. [2022-02-21 03:20:50,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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-21 03:20:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 295 transitions. [2022-02-21 03:20:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 03:20:50,395 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:50,395 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:20:50,419 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-21 03:20:50,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:50,615 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:50,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:50,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1866562491, now seen corresponding path program 1 times [2022-02-21 03:20:50,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:50,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841730734] [2022-02-21 03:20:50,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:50,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:50,774 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:20:50,775 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [572454913] [2022-02-21 03:20:50,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:50,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:50,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:50,782 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-21 03:20:50,783 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-21 03:20:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:51,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:20:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:51,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:20:51,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {4477#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; {4477#true} is VALID [2022-02-21 03:20:51,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {4477#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_~_ha_hashv~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#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; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,698 INFO L290 TraceCheckUtils]: 28: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_#t~switch19#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#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)))); {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,704 INFO L290 TraceCheckUtils]: 37: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#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); {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;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~mem52#1;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 main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,705 INFO L290 TraceCheckUtils]: 41: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,705 INFO L290 TraceCheckUtils]: 42: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,706 INFO L290 TraceCheckUtils]: 43: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,706 INFO L290 TraceCheckUtils]: 44: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,706 INFO L290 TraceCheckUtils]: 45: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,707 INFO L290 TraceCheckUtils]: 46: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,707 INFO L290 TraceCheckUtils]: 47: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,707 INFO L290 TraceCheckUtils]: 48: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,708 INFO L290 TraceCheckUtils]: 49: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,708 INFO L290 TraceCheckUtils]: 50: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,709 INFO L290 TraceCheckUtils]: 51: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,709 INFO L290 TraceCheckUtils]: 52: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,709 INFO L290 TraceCheckUtils]: 53: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:20:51,710 INFO L290 TraceCheckUtils]: 54: Hoare triple {4485#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post5#1 := main_~i~0#1; {4645#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} is VALID [2022-02-21 03:20:51,710 INFO L290 TraceCheckUtils]: 55: Hoare triple {4645#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} assume 1 + main_#t~post5#1 <= 2147483647; {4645#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} is VALID [2022-02-21 03:20:51,710 INFO L290 TraceCheckUtils]: 56: Hoare triple {4645#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} assume !(1 + main_#t~post5#1 >= -2147483648); {4478#false} is VALID [2022-02-21 03:20:51,711 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-21 03:20:51,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:20:51,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:20:51,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841730734] [2022-02-21 03:20:51,711 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:20:51,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572454913] [2022-02-21 03:20:51,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572454913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:20:51,712 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:20:51,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:20:51,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514835476] [2022-02-21 03:20:51,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:20:51,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 57 [2022-02-21 03:20:51,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:20:51,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-21 03:20:51,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:51,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:20:51,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:20:51,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:20:51,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:20:51,760 INFO L87 Difference]: Start difference. First operand 235 states and 295 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-21 03:20:52,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:52,192 INFO L93 Difference]: Finished difference Result 235 states and 295 transitions. [2022-02-21 03:20:52,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:20:52,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 57 [2022-02-21 03:20:52,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:20:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-21 03:20:52,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2022-02-21 03:20:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-21 03:20:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2022-02-21 03:20:52,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 173 transitions. [2022-02-21 03:20:52,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:52,331 INFO L225 Difference]: With dead ends: 235 [2022-02-21 03:20:52,332 INFO L226 Difference]: Without dead ends: 234 [2022-02-21 03:20:52,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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-21 03:20:52,332 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 85 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:20:52,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 344 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:20:52,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-02-21 03:20:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-02-21 03:20:52,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:20:52,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:52,414 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:52,414 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:52,420 INFO L93 Difference]: Finished difference Result 234 states and 294 transitions. [2022-02-21 03:20:52,420 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2022-02-21 03:20:52,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:52,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:52,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand 234 states. [2022-02-21 03:20:52,423 INFO L87 Difference]: Start difference. First operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand 234 states. [2022-02-21 03:20:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:52,428 INFO L93 Difference]: Finished difference Result 234 states and 294 transitions. [2022-02-21 03:20:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2022-02-21 03:20:52,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:52,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:52,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:20:52,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:20:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 212 states have (on average 1.2358490566037736) internal successors, (262), 225 states have internal predecessors, (262), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-21 03:20:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 294 transitions. [2022-02-21 03:20:52,436 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 294 transitions. Word has length 57 [2022-02-21 03:20:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:20:52,436 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 294 transitions. [2022-02-21 03:20:52,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-21 03:20:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 294 transitions. [2022-02-21 03:20:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-21 03:20:52,437 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:52,438 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:20:52,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-21 03:20:52,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:52,650 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:52,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:52,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1237589276, now seen corresponding path program 1 times [2022-02-21 03:20:52,652 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:52,652 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339636448] [2022-02-21 03:20:52,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:52,729 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:20:52,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [130694372] [2022-02-21 03:20:52,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:52,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:52,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:52,731 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-21 03:20:52,733 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-21 03:20:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:53,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:20:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:53,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:20:53,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {5688#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; {5688#true} is VALID [2022-02-21 03:20:53,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {5688#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,831 INFO L290 TraceCheckUtils]: 3: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_hashv~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 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; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~switch19#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 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)))); {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 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); {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;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~mem52#1;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 main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,858 INFO L290 TraceCheckUtils]: 41: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,859 INFO L290 TraceCheckUtils]: 44: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,860 INFO L290 TraceCheckUtils]: 47: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,861 INFO L290 TraceCheckUtils]: 48: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,861 INFO L290 TraceCheckUtils]: 50: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,862 INFO L290 TraceCheckUtils]: 52: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,862 INFO L290 TraceCheckUtils]: 53: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:20:53,862 INFO L290 TraceCheckUtils]: 54: Hoare triple {5696#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post5#1 := main_~i~0#1; {5856#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:20:53,863 INFO L290 TraceCheckUtils]: 55: Hoare triple {5856#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume 1 + main_#t~post5#1 <= 2147483647; {5856#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:20:53,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {5856#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5863#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:20:53,864 INFO L290 TraceCheckUtils]: 57: Hoare triple {5863#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 10); {5689#false} is VALID [2022-02-21 03:20:53,864 INFO L290 TraceCheckUtils]: 58: Hoare triple {5689#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {5689#false} is VALID [2022-02-21 03:20:53,864 INFO L290 TraceCheckUtils]: 59: Hoare triple {5689#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem140#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem141#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~mem140#1, main_#t~mem141#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; {5689#false} is VALID [2022-02-21 03:20:53,865 INFO L290 TraceCheckUtils]: 60: Hoare triple {5689#false} assume !(1 + test_int_int_#t~post3#1 <= 2147483647); {5689#false} is VALID [2022-02-21 03:20:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:20:53,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:20:54,098 INFO L290 TraceCheckUtils]: 60: Hoare triple {5689#false} assume !(1 + test_int_int_#t~post3#1 <= 2147483647); {5689#false} is VALID [2022-02-21 03:20:54,099 INFO L290 TraceCheckUtils]: 59: Hoare triple {5689#false} assume !!(main_~user~0#1.base != 0 || main_~user~0#1.offset != 0);call main_#t~mem140#1 := read~int(main_~user~0#1.base, main_~user~0#1.offset, 4);call main_#t~mem141#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~mem140#1, main_#t~mem141#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; {5689#false} is VALID [2022-02-21 03:20:54,099 INFO L290 TraceCheckUtils]: 58: Hoare triple {5689#false} main_~user~0#1.base, main_~user~0#1.offset := main_~users~0#1.base, main_~users~0#1.offset; {5689#false} is VALID [2022-02-21 03:20:54,099 INFO L290 TraceCheckUtils]: 57: Hoare triple {5885#(< |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 10); {5689#false} is VALID [2022-02-21 03:20:54,100 INFO L290 TraceCheckUtils]: 56: Hoare triple {5889#(< |ULTIMATE.start_main_#t~post5#1| 9)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {5885#(< |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-21 03:20:54,100 INFO L290 TraceCheckUtils]: 55: Hoare triple {5889#(< |ULTIMATE.start_main_#t~post5#1| 9)} assume 1 + main_#t~post5#1 <= 2147483647; {5889#(< |ULTIMATE.start_main_#t~post5#1| 9)} is VALID [2022-02-21 03:20:54,101 INFO L290 TraceCheckUtils]: 54: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post5#1 := main_~i~0#1; {5889#(< |ULTIMATE.start_main_#t~post5#1| 9)} is VALID [2022-02-21 03:20:54,101 INFO L290 TraceCheckUtils]: 53: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,101 INFO L290 TraceCheckUtils]: 52: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,102 INFO L290 TraceCheckUtils]: 50: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,103 INFO L290 TraceCheckUtils]: 47: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;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~mem52#1;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 main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} 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); {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,108 INFO L290 TraceCheckUtils]: 36: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,109 INFO L290 TraceCheckUtils]: 35: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,109 INFO L290 TraceCheckUtils]: 34: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} 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)))); {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,112 INFO L290 TraceCheckUtils]: 29: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,113 INFO L290 TraceCheckUtils]: 26: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !main_#t~switch19#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} 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; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} goto; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} havoc main_~_ha_hashv~0#1; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {5688#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {5896#(< |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-21 03:20:54,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {5688#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; {5688#true} is VALID [2022-02-21 03:20:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:20:54,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:20:54,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339636448] [2022-02-21 03:20:54,124 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:20:54,125 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130694372] [2022-02-21 03:20:54,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130694372] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:20:54,125 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:20:54,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-21 03:20:54,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340381020] [2022-02-21 03:20:54,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:20:54,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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 61 [2022-02-21 03:20:54,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:20:54,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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-21 03:20:54,216 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-21 03:20:54,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:20:54,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:20:54,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:20:54,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:20:54,217 INFO L87 Difference]: Start difference. First operand 234 states and 294 transitions. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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-21 03:20:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:55,537 INFO L93 Difference]: Finished difference Result 367 states and 469 transitions. [2022-02-21 03:20:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:20:55,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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 61 [2022-02-21 03:20:55,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:20:55,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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-21 03:20:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 451 transitions. [2022-02-21 03:20:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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-21 03:20:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 451 transitions. [2022-02-21 03:20:55,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 451 transitions. [2022-02-21 03:20:55,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:55,944 INFO L225 Difference]: With dead ends: 367 [2022-02-21 03:20:55,944 INFO L226 Difference]: Without dead ends: 333 [2022-02-21 03:20:55,945 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:20:55,945 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 466 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:20:55,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 760 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:20:55,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-02-21 03:20:56,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2022-02-21 03:20:56,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:20:56,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:20:56,075 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:20:56,076 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:20:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:56,081 INFO L93 Difference]: Finished difference Result 333 states and 414 transitions. [2022-02-21 03:20:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 414 transitions. [2022-02-21 03:20:56,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:56,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:56,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) Second operand 333 states. [2022-02-21 03:20:56,083 INFO L87 Difference]: Start difference. First operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) Second operand 333 states. [2022-02-21 03:20:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:56,101 INFO L93 Difference]: Finished difference Result 333 states and 414 transitions. [2022-02-21 03:20:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 414 transitions. [2022-02-21 03:20:56,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:56,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:56,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:20:56,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:20:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 321 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:20:56,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 414 transitions. [2022-02-21 03:20:56,125 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 414 transitions. Word has length 61 [2022-02-21 03:20:56,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:20:56,126 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 414 transitions. [2022-02-21 03:20:56,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 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-21 03:20:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 414 transitions. [2022-02-21 03:20:56,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-21 03:20:56,126 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:56,126 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-21 03:20:56,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:20:56,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:56,348 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:56,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:56,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1237285228, now seen corresponding path program 1 times [2022-02-21 03:20:56,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:56,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625896556] [2022-02-21 03:20:56,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:56,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:56,441 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:20:56,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1847781079] [2022-02-21 03:20:56,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:56,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:56,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:56,443 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-21 03:20:56,444 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-21 03:20:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:57,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 1535 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:20:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:20:57,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:20:57,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {7575#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; {7575#true} is VALID [2022-02-21 03:20:57,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {7575#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {7583#(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); {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {7583#(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; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {7583#(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); {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {7583#(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~switch19#1 := 11 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,645 INFO L290 TraceCheckUtils]: 23: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,648 INFO L290 TraceCheckUtils]: 27: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,648 INFO L290 TraceCheckUtils]: 28: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,651 INFO L290 TraceCheckUtils]: 33: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch19#1; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {7583#(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)))); {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,655 INFO L290 TraceCheckUtils]: 37: Hoare triple {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {7583#(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); {7583#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:20:57,656 INFO L290 TraceCheckUtils]: 39: Hoare triple {7583#(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~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {7576#false} is VALID [2022-02-21 03:20:57,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {7576#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;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~mem52#1;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 main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {7576#false} is VALID [2022-02-21 03:20:57,657 INFO L290 TraceCheckUtils]: 41: Hoare triple {7576#false} goto; {7576#false} is VALID [2022-02-21 03:20:57,657 INFO L290 TraceCheckUtils]: 42: Hoare triple {7576#false} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {7576#false} is VALID [2022-02-21 03:20:57,657 INFO L290 TraceCheckUtils]: 43: Hoare triple {7576#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {7576#false} is VALID [2022-02-21 03:20:57,657 INFO L290 TraceCheckUtils]: 44: Hoare triple {7576#false} goto; {7576#false} is VALID [2022-02-21 03:20:57,657 INFO L290 TraceCheckUtils]: 45: Hoare triple {7576#false} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {7576#false} is VALID [2022-02-21 03:20:57,658 INFO L290 TraceCheckUtils]: 46: Hoare triple {7576#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {7576#false} is VALID [2022-02-21 03:20:57,658 INFO L290 TraceCheckUtils]: 47: Hoare triple {7576#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {7576#false} is VALID [2022-02-21 03:20:57,658 INFO L290 TraceCheckUtils]: 48: Hoare triple {7576#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {7576#false} is VALID [2022-02-21 03:20:57,658 INFO L290 TraceCheckUtils]: 49: Hoare triple {7576#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {7576#false} is VALID [2022-02-21 03:20:57,658 INFO L290 TraceCheckUtils]: 50: Hoare triple {7576#false} goto; {7576#false} is VALID [2022-02-21 03:20:57,658 INFO L290 TraceCheckUtils]: 51: Hoare triple {7576#false} goto; {7576#false} is VALID [2022-02-21 03:20:57,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {7576#false} goto; {7576#false} is VALID [2022-02-21 03:20:57,659 INFO L290 TraceCheckUtils]: 53: Hoare triple {7576#false} goto; {7576#false} is VALID [2022-02-21 03:20:57,659 INFO L290 TraceCheckUtils]: 54: Hoare triple {7576#false} main_#t~post5#1 := main_~i~0#1; {7576#false} is VALID [2022-02-21 03:20:57,659 INFO L290 TraceCheckUtils]: 55: Hoare triple {7576#false} assume 1 + main_#t~post5#1 <= 2147483647; {7576#false} is VALID [2022-02-21 03:20:57,659 INFO L290 TraceCheckUtils]: 56: Hoare triple {7576#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {7576#false} is VALID [2022-02-21 03:20:57,659 INFO L290 TraceCheckUtils]: 57: Hoare triple {7576#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {7576#false} is VALID [2022-02-21 03:20:57,659 INFO L290 TraceCheckUtils]: 58: Hoare triple {7576#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {7576#false} is VALID [2022-02-21 03:20:57,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {7576#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {7576#false} is VALID [2022-02-21 03:20:57,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {7576#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {7576#false} is VALID [2022-02-21 03:20:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:20:57,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:20:57,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:20:57,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625896556] [2022-02-21 03:20:57,662 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:20:57,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847781079] [2022-02-21 03:20:57,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847781079] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:20:57,663 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:20:57,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:20:57,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894211528] [2022-02-21 03:20:57,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:20:57,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-02-21 03:20:57,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:20:57,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-21 03:20:57,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:57,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:20:57,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:20:57,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:20:57,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:20:57,724 INFO L87 Difference]: Start difference. First operand 333 states and 414 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-21 03:20:58,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:58,244 INFO L93 Difference]: Finished difference Result 606 states and 760 transitions. [2022-02-21 03:20:58,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:20:58,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-02-21 03:20:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:20:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-21 03:20:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-02-21 03:20:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-21 03:20:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2022-02-21 03:20:58,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 389 transitions. [2022-02-21 03:20:58,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:20:58,654 INFO L225 Difference]: With dead ends: 606 [2022-02-21 03:20:58,654 INFO L226 Difference]: Without dead ends: 331 [2022-02-21 03:20:58,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 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-21 03:20:58,657 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 15 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:20:58,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 326 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:20:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-02-21 03:20:58,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2022-02-21 03:20:58,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:20:58,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:20:58,790 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:20:58,790 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:20:58,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:58,796 INFO L93 Difference]: Finished difference Result 331 states and 411 transitions. [2022-02-21 03:20:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 411 transitions. [2022-02-21 03:20:58,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:58,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:58,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) Second operand 331 states. [2022-02-21 03:20:58,798 INFO L87 Difference]: Start difference. First operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) Second operand 331 states. [2022-02-21 03:20:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:20:58,814 INFO L93 Difference]: Finished difference Result 331 states and 411 transitions. [2022-02-21 03:20:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 411 transitions. [2022-02-21 03:20:58,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:20:58,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:20:58,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:20:58,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:20:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 306 states have (on average 1.2189542483660132) internal successors, (373), 319 states have internal predecessors, (373), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-21 03:20:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 411 transitions. [2022-02-21 03:20:58,822 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 411 transitions. Word has length 61 [2022-02-21 03:20:58,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:20:58,822 INFO L470 AbstractCegarLoop]: Abstraction has 331 states and 411 transitions. [2022-02-21 03:20:58,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-21 03:20:58,823 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 411 transitions. [2022-02-21 03:20:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-21 03:20:58,823 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:20:58,823 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:20:58,859 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-21 03:20:59,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:59,045 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:20:59,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:20:59,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1438130325, now seen corresponding path program 1 times [2022-02-21 03:20:59,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:20:59,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930061354] [2022-02-21 03:20:59,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:59,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:20:59,086 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:20:59,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1994111512] [2022-02-21 03:20:59,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:20:59,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:20:59,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:20:59,096 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-21 03:20:59,098 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-21 03:21:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:21:24,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:21:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:21:24,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:21:24,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {9548#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; {9548#true} is VALID [2022-02-21 03:21:24,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {9548#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {9548#true} is VALID [2022-02-21 03:21:24,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {9548#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {9548#true} is VALID [2022-02-21 03:21:24,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {9548#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {9548#true} is VALID [2022-02-21 03:21:24,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {9548#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {9548#true} is VALID [2022-02-21 03:21:24,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {9548#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {9548#true} is VALID [2022-02-21 03:21:24,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {9548#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {9548#true} is VALID [2022-02-21 03:21:24,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {9548#true} havoc main_~_ha_hashv~0#1; {9548#true} is VALID [2022-02-21 03:21:24,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {9548#true} goto; {9548#true} is VALID [2022-02-21 03:21:24,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {9548#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; {9548#true} is VALID [2022-02-21 03:21:24,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {9548#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {9548#true} is VALID [2022-02-21 03:21:24,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {9548#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:21:24,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {9548#true} assume !main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:21:24,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:21:24,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {9548#true} assume !main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:21:24,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:21:24,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {9548#true} assume !main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:21:24,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:21:24,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {9548#true} assume !main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:21:24,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:21:24,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {9548#true} assume !main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:21:24,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:21:24,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {9548#true} assume !main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:21:24,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:21:24,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {9548#true} assume !main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:21:24,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:21:24,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {9548#true} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {9548#true} is VALID [2022-02-21 03:21:24,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:21:24,775 INFO L290 TraceCheckUtils]: 28: Hoare triple {9548#true} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {9548#true} is VALID [2022-02-21 03:21:24,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:21:24,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {9548#true} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {9548#true} is VALID [2022-02-21 03:21:24,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {9548#true} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {9548#true} is VALID [2022-02-21 03:21:24,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {9548#true} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {9548#true} is VALID [2022-02-21 03:21:24,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {9548#true} havoc main_#t~switch19#1; {9548#true} is VALID [2022-02-21 03:21:24,776 INFO L290 TraceCheckUtils]: 34: Hoare triple {9548#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)))); {9548#true} is VALID [2022-02-21 03:21:24,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {9548#true} goto; {9548#true} is VALID [2022-02-21 03:21:24,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {9548#true} goto; {9548#true} is VALID [2022-02-21 03:21:24,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {9548#true} goto; {9548#true} is VALID [2022-02-21 03:21:24,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {9548#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); {9548#true} is VALID [2022-02-21 03:21:24,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {9548#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); {9548#true} is VALID [2022-02-21 03:21:24,776 INFO L290 TraceCheckUtils]: 40: Hoare triple {9548#true} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {9548#true} is VALID [2022-02-21 03:21:24,777 INFO L290 TraceCheckUtils]: 41: Hoare triple {9548#true} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {9548#true} is VALID [2022-02-21 03:21:24,777 INFO L272 TraceCheckUtils]: 42: Hoare triple {9548#true} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {9548#true} is VALID [2022-02-21 03:21:24,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {9548#true} #t~loopctr143 := 0; {9682#(= |#Ultimate.C_memset_#t~loopctr143| 0)} is VALID [2022-02-21 03:21:24,778 INFO L290 TraceCheckUtils]: 44: Hoare triple {9682#(= |#Ultimate.C_memset_#t~loopctr143| 0)} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {9686#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:21:24,778 INFO L290 TraceCheckUtils]: 45: Hoare triple {9686#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9686#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:21:24,779 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {9686#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} {9548#true} #484#return; {9549#false} is VALID [2022-02-21 03:21:24,780 INFO L290 TraceCheckUtils]: 47: Hoare triple {9549#false} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#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);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);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);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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#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(2685476833, main_#t~mem41#1.base, 40 + 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 main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {9549#false} is VALID [2022-02-21 03:21:24,780 INFO L290 TraceCheckUtils]: 48: Hoare triple {9549#false} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {9549#false} is VALID [2022-02-21 03:21:24,780 INFO L272 TraceCheckUtils]: 49: Hoare triple {9549#false} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {9549#false} is VALID [2022-02-21 03:21:24,780 INFO L290 TraceCheckUtils]: 50: Hoare triple {9549#false} #t~loopctr143 := 0; {9549#false} is VALID [2022-02-21 03:21:24,780 INFO L290 TraceCheckUtils]: 51: Hoare triple {9549#false} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {9549#false} is VALID [2022-02-21 03:21:24,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {9549#false} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9549#false} is VALID [2022-02-21 03:21:24,780 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9549#false} {9549#false} #486#return; {9549#false} is VALID [2022-02-21 03:21:24,781 INFO L290 TraceCheckUtils]: 54: Hoare triple {9549#false} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {9549#false} is VALID [2022-02-21 03:21:24,781 INFO L290 TraceCheckUtils]: 55: Hoare triple {9549#false} goto; {9549#false} is VALID [2022-02-21 03:21:24,781 INFO L290 TraceCheckUtils]: 56: Hoare triple {9549#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {9549#false} is VALID [2022-02-21 03:21:24,781 INFO L290 TraceCheckUtils]: 57: Hoare triple {9549#false} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {9549#false} is VALID [2022-02-21 03:21:24,781 INFO L290 TraceCheckUtils]: 58: Hoare triple {9549#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {9549#false} is VALID [2022-02-21 03:21:24,781 INFO L290 TraceCheckUtils]: 59: Hoare triple {9549#false} goto; {9549#false} is VALID [2022-02-21 03:21:24,781 INFO L290 TraceCheckUtils]: 60: Hoare triple {9549#false} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {9549#false} is VALID [2022-02-21 03:21:24,781 INFO L290 TraceCheckUtils]: 61: Hoare triple {9549#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {9549#false} is VALID [2022-02-21 03:21:24,782 INFO L290 TraceCheckUtils]: 62: Hoare triple {9549#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {9549#false} is VALID [2022-02-21 03:21:24,782 INFO L290 TraceCheckUtils]: 63: Hoare triple {9549#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {9549#false} is VALID [2022-02-21 03:21:24,782 INFO L290 TraceCheckUtils]: 64: Hoare triple {9549#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {9549#false} is VALID [2022-02-21 03:21:24,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {9549#false} goto; {9549#false} is VALID [2022-02-21 03:21:24,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {9549#false} goto; {9549#false} is VALID [2022-02-21 03:21:24,782 INFO L290 TraceCheckUtils]: 67: Hoare triple {9549#false} goto; {9549#false} is VALID [2022-02-21 03:21:24,782 INFO L290 TraceCheckUtils]: 68: Hoare triple {9549#false} goto; {9549#false} is VALID [2022-02-21 03:21:24,782 INFO L290 TraceCheckUtils]: 69: Hoare triple {9549#false} main_#t~post5#1 := main_~i~0#1; {9549#false} is VALID [2022-02-21 03:21:24,783 INFO L290 TraceCheckUtils]: 70: Hoare triple {9549#false} assume 1 + main_#t~post5#1 <= 2147483647; {9549#false} is VALID [2022-02-21 03:21:24,783 INFO L290 TraceCheckUtils]: 71: Hoare triple {9549#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {9549#false} is VALID [2022-02-21 03:21:24,783 INFO L290 TraceCheckUtils]: 72: Hoare triple {9549#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {9549#false} is VALID [2022-02-21 03:21:24,783 INFO L290 TraceCheckUtils]: 73: Hoare triple {9549#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {9549#false} is VALID [2022-02-21 03:21:24,783 INFO L290 TraceCheckUtils]: 74: Hoare triple {9549#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {9549#false} is VALID [2022-02-21 03:21:24,783 INFO L290 TraceCheckUtils]: 75: Hoare triple {9549#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {9549#false} is VALID [2022-02-21 03:21:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:21:24,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:21:24,784 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:21:24,784 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930061354] [2022-02-21 03:21:24,784 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:21:24,784 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994111512] [2022-02-21 03:21:24,784 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994111512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:21:24,784 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:21:24,784 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:21:24,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228343429] [2022-02-21 03:21:24,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:21:24,785 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, (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 76 [2022-02-21 03:21:24,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:21:24,786 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, (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-21 03:21:24,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:24,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:21:24,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:21:24,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:21:24,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:21:24,845 INFO L87 Difference]: Start difference. First operand 331 states and 411 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, (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-21 03:21:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:25,579 INFO L93 Difference]: Finished difference Result 613 states and 776 transitions. [2022-02-21 03:21:25,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:21:25,580 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, (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 76 [2022-02-21 03:21:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:21:25,580 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, (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-21 03:21:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2022-02-21 03:21:25,582 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, (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-21 03:21:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 348 transitions. [2022-02-21 03:21:25,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 348 transitions. [2022-02-21 03:21:25,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 348 edges. 348 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:25,883 INFO L225 Difference]: With dead ends: 613 [2022-02-21 03:21:25,883 INFO L226 Difference]: Without dead ends: 334 [2022-02-21 03:21:25,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 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-21 03:21:25,884 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 2 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:21:25,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 503 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:21:25,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-02-21 03:21:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2022-02-21 03:21:25,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:21:25,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 334 states. Second operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:25,990 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:25,991 INFO L87 Difference]: Start difference. First operand 334 states. Second operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:25,997 INFO L93 Difference]: Finished difference Result 334 states and 417 transitions. [2022-02-21 03:21:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 417 transitions. [2022-02-21 03:21:25,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:25,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:25,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 334 states. [2022-02-21 03:21:25,999 INFO L87 Difference]: Start difference. First operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 334 states. [2022-02-21 03:21:26,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:26,004 INFO L93 Difference]: Finished difference Result 334 states and 417 transitions. [2022-02-21 03:21:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 417 transitions. [2022-02-21 03:21:26,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:26,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:26,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:21:26,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:21:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 308 states have (on average 1.2207792207792207) internal successors, (376), 322 states have internal predecessors, (376), 19 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 417 transitions. [2022-02-21 03:21:26,012 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 417 transitions. Word has length 76 [2022-02-21 03:21:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:21:26,012 INFO L470 AbstractCegarLoop]: Abstraction has 334 states and 417 transitions. [2022-02-21 03:21:26,013 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, (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-21 03:21:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 417 transitions. [2022-02-21 03:21:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-21 03:21:26,014 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:21:26,014 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:21:26,061 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-21 03:21:26,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:21:26,227 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:21:26,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:21:26,228 INFO L85 PathProgramCache]: Analyzing trace with hash 766935497, now seen corresponding path program 1 times [2022-02-21 03:21:26,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:21:26,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904269548] [2022-02-21 03:21:26,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:21:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:21:26,292 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:21:26,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1697125300] [2022-02-21 03:21:26,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:21:26,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:21:26,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:21:26,296 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-21 03:21:26,297 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-21 03:21:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:21:27,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:21:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:21:27,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:21:27,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {11587#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; {11587#true} is VALID [2022-02-21 03:21:27,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {11587#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {11587#true} is VALID [2022-02-21 03:21:27,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {11587#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {11587#true} is VALID [2022-02-21 03:21:27,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {11587#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {11587#true} is VALID [2022-02-21 03:21:27,873 INFO L290 TraceCheckUtils]: 4: Hoare triple {11587#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:21:27,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {11587#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {11587#true} is VALID [2022-02-21 03:21:27,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {11587#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:21:27,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {11587#true} havoc main_~_ha_hashv~0#1; {11587#true} is VALID [2022-02-21 03:21:27,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:21:27,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {11587#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; {11587#true} is VALID [2022-02-21 03:21:27,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {11587#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {11587#true} is VALID [2022-02-21 03:21:27,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {11587#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:27,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:27,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:27,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:27,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:27,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:27,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:27,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:27,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:27,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:27,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:27,875 INFO L290 TraceCheckUtils]: 22: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:27,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:27,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:27,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:27,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {11587#true} is VALID [2022-02-21 03:21:27,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:27,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {11587#true} is VALID [2022-02-21 03:21:27,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:27,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {11587#true} is VALID [2022-02-21 03:21:27,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:27,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {11587#true} is VALID [2022-02-21 03:21:27,876 INFO L290 TraceCheckUtils]: 33: Hoare triple {11587#true} havoc main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:27,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {11587#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)))); {11587#true} is VALID [2022-02-21 03:21:27,877 INFO L290 TraceCheckUtils]: 35: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:21:27,877 INFO L290 TraceCheckUtils]: 36: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:21:27,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:21:27,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {11587#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); {11587#true} is VALID [2022-02-21 03:21:27,877 INFO L290 TraceCheckUtils]: 39: Hoare triple {11587#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); {11587#true} is VALID [2022-02-21 03:21:27,877 INFO L290 TraceCheckUtils]: 40: Hoare triple {11587#true} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:21:27,877 INFO L290 TraceCheckUtils]: 41: Hoare triple {11587#true} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:21:27,878 INFO L272 TraceCheckUtils]: 42: Hoare triple {11587#true} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {11587#true} is VALID [2022-02-21 03:21:27,878 INFO L290 TraceCheckUtils]: 43: Hoare triple {11587#true} #t~loopctr143 := 0; {11721#(= |#Ultimate.C_memset_#t~loopctr143| 0)} is VALID [2022-02-21 03:21:27,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {11721#(= |#Ultimate.C_memset_#t~loopctr143| 0)} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {11725#(= |#Ultimate.C_memset_#t~loopctr143| 1)} is VALID [2022-02-21 03:21:27,879 INFO L290 TraceCheckUtils]: 45: Hoare triple {11725#(= |#Ultimate.C_memset_#t~loopctr143| 1)} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {11729#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:21:27,879 INFO L290 TraceCheckUtils]: 46: Hoare triple {11729#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11729#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:21:27,880 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11729#(not (< 1 (mod |#Ultimate.C_memset_#amount| 4294967296)))} {11587#true} #484#return; {11588#false} is VALID [2022-02-21 03:21:27,880 INFO L290 TraceCheckUtils]: 48: Hoare triple {11588#false} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#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);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);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);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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#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(2685476833, main_#t~mem41#1.base, 40 + 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 main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {11588#false} is VALID [2022-02-21 03:21:27,881 INFO L290 TraceCheckUtils]: 49: Hoare triple {11588#false} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {11588#false} is VALID [2022-02-21 03:21:27,881 INFO L272 TraceCheckUtils]: 50: Hoare triple {11588#false} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {11588#false} is VALID [2022-02-21 03:21:27,881 INFO L290 TraceCheckUtils]: 51: Hoare triple {11588#false} #t~loopctr143 := 0; {11588#false} is VALID [2022-02-21 03:21:27,881 INFO L290 TraceCheckUtils]: 52: Hoare triple {11588#false} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {11588#false} is VALID [2022-02-21 03:21:27,881 INFO L290 TraceCheckUtils]: 53: Hoare triple {11588#false} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {11588#false} is VALID [2022-02-21 03:21:27,881 INFO L290 TraceCheckUtils]: 54: Hoare triple {11588#false} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11588#false} is VALID [2022-02-21 03:21:27,881 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11588#false} {11588#false} #486#return; {11588#false} is VALID [2022-02-21 03:21:27,881 INFO L290 TraceCheckUtils]: 56: Hoare triple {11588#false} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {11588#false} is VALID [2022-02-21 03:21:27,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:21:27,882 INFO L290 TraceCheckUtils]: 58: Hoare triple {11588#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {11588#false} is VALID [2022-02-21 03:21:27,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {11588#false} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {11588#false} is VALID [2022-02-21 03:21:27,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {11588#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {11588#false} is VALID [2022-02-21 03:21:27,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:21:27,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {11588#false} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {11588#false} is VALID [2022-02-21 03:21:27,882 INFO L290 TraceCheckUtils]: 63: Hoare triple {11588#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {11588#false} is VALID [2022-02-21 03:21:27,882 INFO L290 TraceCheckUtils]: 64: Hoare triple {11588#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {11588#false} is VALID [2022-02-21 03:21:27,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {11588#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {11588#false} is VALID [2022-02-21 03:21:27,883 INFO L290 TraceCheckUtils]: 66: Hoare triple {11588#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {11588#false} is VALID [2022-02-21 03:21:27,883 INFO L290 TraceCheckUtils]: 67: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:21:27,883 INFO L290 TraceCheckUtils]: 68: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:21:27,883 INFO L290 TraceCheckUtils]: 69: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:21:27,883 INFO L290 TraceCheckUtils]: 70: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:21:27,883 INFO L290 TraceCheckUtils]: 71: Hoare triple {11588#false} main_#t~post5#1 := main_~i~0#1; {11588#false} is VALID [2022-02-21 03:21:27,883 INFO L290 TraceCheckUtils]: 72: Hoare triple {11588#false} assume 1 + main_#t~post5#1 <= 2147483647; {11588#false} is VALID [2022-02-21 03:21:27,884 INFO L290 TraceCheckUtils]: 73: Hoare triple {11588#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {11588#false} is VALID [2022-02-21 03:21:27,884 INFO L290 TraceCheckUtils]: 74: Hoare triple {11588#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {11588#false} is VALID [2022-02-21 03:21:27,884 INFO L290 TraceCheckUtils]: 75: Hoare triple {11588#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {11588#false} is VALID [2022-02-21 03:21:27,884 INFO L290 TraceCheckUtils]: 76: Hoare triple {11588#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {11588#false} is VALID [2022-02-21 03:21:27,884 INFO L290 TraceCheckUtils]: 77: Hoare triple {11588#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {11588#false} is VALID [2022-02-21 03:21:27,884 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:21:27,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:21:28,086 INFO L290 TraceCheckUtils]: 77: Hoare triple {11588#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {11588#false} is VALID [2022-02-21 03:21:28,087 INFO L290 TraceCheckUtils]: 76: Hoare triple {11588#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {11588#false} is VALID [2022-02-21 03:21:28,087 INFO L290 TraceCheckUtils]: 75: Hoare triple {11588#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {11588#false} is VALID [2022-02-21 03:21:28,087 INFO L290 TraceCheckUtils]: 74: Hoare triple {11588#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {11588#false} is VALID [2022-02-21 03:21:28,087 INFO L290 TraceCheckUtils]: 73: Hoare triple {11588#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {11588#false} is VALID [2022-02-21 03:21:28,087 INFO L290 TraceCheckUtils]: 72: Hoare triple {11588#false} assume 1 + main_#t~post5#1 <= 2147483647; {11588#false} is VALID [2022-02-21 03:21:28,087 INFO L290 TraceCheckUtils]: 71: Hoare triple {11588#false} main_#t~post5#1 := main_~i~0#1; {11588#false} is VALID [2022-02-21 03:21:28,087 INFO L290 TraceCheckUtils]: 70: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:21:28,087 INFO L290 TraceCheckUtils]: 69: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:21:28,088 INFO L290 TraceCheckUtils]: 68: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:21:28,088 INFO L290 TraceCheckUtils]: 67: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:21:28,088 INFO L290 TraceCheckUtils]: 66: Hoare triple {11588#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {11588#false} is VALID [2022-02-21 03:21:28,088 INFO L290 TraceCheckUtils]: 65: Hoare triple {11588#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {11588#false} is VALID [2022-02-21 03:21:28,088 INFO L290 TraceCheckUtils]: 64: Hoare triple {11588#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {11588#false} is VALID [2022-02-21 03:21:28,088 INFO L290 TraceCheckUtils]: 63: Hoare triple {11588#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {11588#false} is VALID [2022-02-21 03:21:28,088 INFO L290 TraceCheckUtils]: 62: Hoare triple {11588#false} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {11588#false} is VALID [2022-02-21 03:21:28,088 INFO L290 TraceCheckUtils]: 61: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:21:28,089 INFO L290 TraceCheckUtils]: 60: Hoare triple {11588#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {11588#false} is VALID [2022-02-21 03:21:28,089 INFO L290 TraceCheckUtils]: 59: Hoare triple {11588#false} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {11588#false} is VALID [2022-02-21 03:21:28,089 INFO L290 TraceCheckUtils]: 58: Hoare triple {11588#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {11588#false} is VALID [2022-02-21 03:21:28,089 INFO L290 TraceCheckUtils]: 57: Hoare triple {11588#false} goto; {11588#false} is VALID [2022-02-21 03:21:28,089 INFO L290 TraceCheckUtils]: 56: Hoare triple {11588#false} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {11588#false} is VALID [2022-02-21 03:21:28,089 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11587#true} {11588#false} #486#return; {11588#false} is VALID [2022-02-21 03:21:28,089 INFO L290 TraceCheckUtils]: 54: Hoare triple {11587#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11587#true} is VALID [2022-02-21 03:21:28,089 INFO L290 TraceCheckUtils]: 53: Hoare triple {11587#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {11587#true} is VALID [2022-02-21 03:21:28,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {11587#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {11587#true} is VALID [2022-02-21 03:21:28,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {11587#true} #t~loopctr143 := 0; {11587#true} is VALID [2022-02-21 03:21:28,090 INFO L272 TraceCheckUtils]: 50: Hoare triple {11588#false} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {11587#true} is VALID [2022-02-21 03:21:28,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {11588#false} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {11588#false} is VALID [2022-02-21 03:21:28,090 INFO L290 TraceCheckUtils]: 48: Hoare triple {11588#false} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#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);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);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);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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#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(2685476833, main_#t~mem41#1.base, 40 + 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 main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {11588#false} is VALID [2022-02-21 03:21:28,091 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11919#(not (= 44 |#Ultimate.C_memset_#amount|))} {11587#true} #484#return; {11588#false} is VALID [2022-02-21 03:21:28,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {11919#(not (= 44 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11919#(not (= 44 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-21 03:21:28,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {11926#(or (< (mod |#Ultimate.C_memset_#t~loopctr143| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {11919#(not (= 44 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-21 03:21:28,093 INFO L290 TraceCheckUtils]: 44: Hoare triple {11930#(or (not (= 44 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {11926#(or (< (mod |#Ultimate.C_memset_#t~loopctr143| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} is VALID [2022-02-21 03:21:28,094 INFO L290 TraceCheckUtils]: 43: Hoare triple {11587#true} #t~loopctr143 := 0; {11930#(or (not (= 44 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:21:28,094 INFO L272 TraceCheckUtils]: 42: Hoare triple {11587#true} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {11587#true} is VALID [2022-02-21 03:21:28,094 INFO L290 TraceCheckUtils]: 41: Hoare triple {11587#true} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:21:28,094 INFO L290 TraceCheckUtils]: 40: Hoare triple {11587#true} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:21:28,094 INFO L290 TraceCheckUtils]: 39: Hoare triple {11587#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); {11587#true} is VALID [2022-02-21 03:21:28,094 INFO L290 TraceCheckUtils]: 38: Hoare triple {11587#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); {11587#true} is VALID [2022-02-21 03:21:28,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:21:28,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:21:28,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:21:28,095 INFO L290 TraceCheckUtils]: 34: Hoare triple {11587#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)))); {11587#true} is VALID [2022-02-21 03:21:28,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {11587#true} havoc main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:28,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {11587#true} is VALID [2022-02-21 03:21:28,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:28,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {11587#true} is VALID [2022-02-21 03:21:28,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:28,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {11587#true} is VALID [2022-02-21 03:21:28,096 INFO L290 TraceCheckUtils]: 27: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:28,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {11587#true} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {11587#true} is VALID [2022-02-21 03:21:28,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:28,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:28,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:28,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:28,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:28,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:28,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:28,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:28,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:28,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:28,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:28,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:28,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {11587#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:28,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {11587#true} assume !main_#t~switch19#1; {11587#true} is VALID [2022-02-21 03:21:28,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {11587#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {11587#true} is VALID [2022-02-21 03:21:28,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {11587#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {11587#true} is VALID [2022-02-21 03:21:28,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {11587#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; {11587#true} is VALID [2022-02-21 03:21:28,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {11587#true} goto; {11587#true} is VALID [2022-02-21 03:21:28,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {11587#true} havoc main_~_ha_hashv~0#1; {11587#true} is VALID [2022-02-21 03:21:28,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {11587#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:21:28,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {11587#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {11587#true} is VALID [2022-02-21 03:21:28,099 INFO L290 TraceCheckUtils]: 4: Hoare triple {11587#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {11587#true} is VALID [2022-02-21 03:21:28,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {11587#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {11587#true} is VALID [2022-02-21 03:21:28,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {11587#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {11587#true} is VALID [2022-02-21 03:21:28,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {11587#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {11587#true} is VALID [2022-02-21 03:21:28,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {11587#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; {11587#true} is VALID [2022-02-21 03:21:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:21:28,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:21:28,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904269548] [2022-02-21 03:21:28,100 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:21:28,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697125300] [2022-02-21 03:21:28,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697125300] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:21:28,100 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:21:28,100 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-21 03:21:28,100 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564685623] [2022-02-21 03:21:28,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:21:28,101 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 78 [2022-02-21 03:21:28,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:21:28,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:28,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:28,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:21:28,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:21:28,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:21:28,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:21:28,200 INFO L87 Difference]: Start difference. First operand 334 states and 417 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:29,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:29,295 INFO L93 Difference]: Finished difference Result 627 states and 803 transitions. [2022-02-21 03:21:29,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:21:29,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 78 [2022-02-21 03:21:29,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:21:29,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 365 transitions. [2022-02-21 03:21:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 365 transitions. [2022-02-21 03:21:29,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 365 transitions. [2022-02-21 03:21:29,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 365 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:29,603 INFO L225 Difference]: With dead ends: 627 [2022-02-21 03:21:29,603 INFO L226 Difference]: Without dead ends: 345 [2022-02-21 03:21:29,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:21:29,604 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 14 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:21:29,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 671 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:21:29,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-02-21 03:21:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2022-02-21 03:21:29,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:21:29,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:29,692 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:29,692 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:29,698 INFO L93 Difference]: Finished difference Result 345 states and 435 transitions. [2022-02-21 03:21:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 435 transitions. [2022-02-21 03:21:29,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:29,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:29,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 345 states. [2022-02-21 03:21:29,700 INFO L87 Difference]: Start difference. First operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 345 states. [2022-02-21 03:21:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:29,706 INFO L93 Difference]: Finished difference Result 345 states and 435 transitions. [2022-02-21 03:21:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 435 transitions. [2022-02-21 03:21:29,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:29,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:29,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:21:29,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:21:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 431 transitions. [2022-02-21 03:21:29,714 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 431 transitions. Word has length 78 [2022-02-21 03:21:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:21:29,714 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 431 transitions. [2022-02-21 03:21:29,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 431 transitions. [2022-02-21 03:21:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-21 03:21:29,715 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:21:29,715 INFO L514 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:21:29,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:21:29,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-02-21 03:21:29,929 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:21:29,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:21:29,929 INFO L85 PathProgramCache]: Analyzing trace with hash 432269099, now seen corresponding path program 2 times [2022-02-21 03:21:29,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:21:29,930 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627399971] [2022-02-21 03:21:29,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:21:29,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:21:29,982 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:21:29,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542877447] [2022-02-21 03:21:29,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:21:29,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:21:29,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:21:29,984 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-21 03:21:29,985 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-21 03:21:31,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:21:31,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:21:31,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:21:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:21:31,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:21:31,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {13935#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; {13935#true} is VALID [2022-02-21 03:21:31,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {13935#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {13935#true} is VALID [2022-02-21 03:21:31,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {13935#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {13935#true} is VALID [2022-02-21 03:21:31,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {13935#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {13935#true} is VALID [2022-02-21 03:21:31,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {13935#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:21:31,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {13935#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {13935#true} is VALID [2022-02-21 03:21:31,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {13935#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:21:31,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {13935#true} havoc main_~_ha_hashv~0#1; {13935#true} is VALID [2022-02-21 03:21:31,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:21:31,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {13935#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; {13967#(= 4 |ULTIMATE.start_main_~_hj_k~0#1|)} is VALID [2022-02-21 03:21:31,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {13967#(= 4 |ULTIMATE.start_main_~_hj_k~0#1|)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {13935#true} is VALID [2022-02-21 03:21:31,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {13935#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,438 INFO L290 TraceCheckUtils]: 20: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,438 INFO L290 TraceCheckUtils]: 23: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {13935#true} is VALID [2022-02-21 03:21:31,439 INFO L290 TraceCheckUtils]: 27: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,439 INFO L290 TraceCheckUtils]: 28: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {13935#true} is VALID [2022-02-21 03:21:31,439 INFO L290 TraceCheckUtils]: 29: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {13935#true} is VALID [2022-02-21 03:21:31,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {13935#true} is VALID [2022-02-21 03:21:31,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {13935#true} havoc main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {13935#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)))); {13935#true} is VALID [2022-02-21 03:21:31,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:21:31,440 INFO L290 TraceCheckUtils]: 36: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:21:31,441 INFO L290 TraceCheckUtils]: 37: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:21:31,441 INFO L290 TraceCheckUtils]: 38: Hoare triple {13935#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); {13935#true} is VALID [2022-02-21 03:21:31,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {13935#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); {13935#true} is VALID [2022-02-21 03:21:31,441 INFO L290 TraceCheckUtils]: 40: Hoare triple {13935#true} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:21:31,441 INFO L290 TraceCheckUtils]: 41: Hoare triple {13935#true} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:21:31,441 INFO L272 TraceCheckUtils]: 42: Hoare triple {13935#true} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {13935#true} is VALID [2022-02-21 03:21:31,442 INFO L290 TraceCheckUtils]: 43: Hoare triple {13935#true} #t~loopctr143 := 0; {14070#(= |#Ultimate.C_memset_#t~loopctr143| 0)} is VALID [2022-02-21 03:21:31,443 INFO L290 TraceCheckUtils]: 44: Hoare triple {14070#(= |#Ultimate.C_memset_#t~loopctr143| 0)} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {14074#(= (+ (- 1) |#Ultimate.C_memset_#t~loopctr143|) 0)} is VALID [2022-02-21 03:21:31,443 INFO L290 TraceCheckUtils]: 45: Hoare triple {14074#(= (+ (- 1) |#Ultimate.C_memset_#t~loopctr143|) 0)} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {14078#(= (+ (- 2) |#Ultimate.C_memset_#t~loopctr143|) 0)} is VALID [2022-02-21 03:21:31,444 INFO L290 TraceCheckUtils]: 46: Hoare triple {14078#(= (+ (- 2) |#Ultimate.C_memset_#t~loopctr143|) 0)} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {14082#(= 0 (+ |#Ultimate.C_memset_#t~loopctr143| (- 3)))} is VALID [2022-02-21 03:21:31,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {14082#(= 0 (+ |#Ultimate.C_memset_#t~loopctr143| (- 3)))} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {14086#(= (+ |#Ultimate.C_memset_#t~loopctr143| (- 4)) 0)} is VALID [2022-02-21 03:21:31,445 INFO L290 TraceCheckUtils]: 48: Hoare triple {14086#(= (+ |#Ultimate.C_memset_#t~loopctr143| (- 4)) 0)} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {14090#(not (< 4 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:21:31,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {14090#(not (< 4 (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {14090#(not (< 4 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:21:31,447 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14090#(not (< 4 (mod |#Ultimate.C_memset_#amount| 4294967296)))} {13935#true} #484#return; {13936#false} is VALID [2022-02-21 03:21:31,447 INFO L290 TraceCheckUtils]: 51: Hoare triple {13936#false} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#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);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);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);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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#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(2685476833, main_#t~mem41#1.base, 40 + 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 main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {13936#false} is VALID [2022-02-21 03:21:31,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {13936#false} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {13936#false} is VALID [2022-02-21 03:21:31,447 INFO L272 TraceCheckUtils]: 53: Hoare triple {13936#false} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {13936#false} is VALID [2022-02-21 03:21:31,448 INFO L290 TraceCheckUtils]: 54: Hoare triple {13936#false} #t~loopctr143 := 0; {13936#false} is VALID [2022-02-21 03:21:31,448 INFO L290 TraceCheckUtils]: 55: Hoare triple {13936#false} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {13936#false} is VALID [2022-02-21 03:21:31,448 INFO L290 TraceCheckUtils]: 56: Hoare triple {13936#false} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {13936#false} is VALID [2022-02-21 03:21:31,448 INFO L290 TraceCheckUtils]: 57: Hoare triple {13936#false} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {13936#false} is VALID [2022-02-21 03:21:31,448 INFO L290 TraceCheckUtils]: 58: Hoare triple {13936#false} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {13936#false} is VALID [2022-02-21 03:21:31,448 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13936#false} {13936#false} #486#return; {13936#false} is VALID [2022-02-21 03:21:31,449 INFO L290 TraceCheckUtils]: 60: Hoare triple {13936#false} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {13936#false} is VALID [2022-02-21 03:21:31,449 INFO L290 TraceCheckUtils]: 61: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:21:31,449 INFO L290 TraceCheckUtils]: 62: Hoare triple {13936#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {13936#false} is VALID [2022-02-21 03:21:31,449 INFO L290 TraceCheckUtils]: 63: Hoare triple {13936#false} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {13936#false} is VALID [2022-02-21 03:21:31,449 INFO L290 TraceCheckUtils]: 64: Hoare triple {13936#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {13936#false} is VALID [2022-02-21 03:21:31,449 INFO L290 TraceCheckUtils]: 65: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:21:31,450 INFO L290 TraceCheckUtils]: 66: Hoare triple {13936#false} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {13936#false} is VALID [2022-02-21 03:21:31,450 INFO L290 TraceCheckUtils]: 67: Hoare triple {13936#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {13936#false} is VALID [2022-02-21 03:21:31,450 INFO L290 TraceCheckUtils]: 68: Hoare triple {13936#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {13936#false} is VALID [2022-02-21 03:21:31,450 INFO L290 TraceCheckUtils]: 69: Hoare triple {13936#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {13936#false} is VALID [2022-02-21 03:21:31,450 INFO L290 TraceCheckUtils]: 70: Hoare triple {13936#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {13936#false} is VALID [2022-02-21 03:21:31,450 INFO L290 TraceCheckUtils]: 71: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:21:31,451 INFO L290 TraceCheckUtils]: 72: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:21:31,451 INFO L290 TraceCheckUtils]: 73: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:21:31,451 INFO L290 TraceCheckUtils]: 74: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:21:31,451 INFO L290 TraceCheckUtils]: 75: Hoare triple {13936#false} main_#t~post5#1 := main_~i~0#1; {13936#false} is VALID [2022-02-21 03:21:31,451 INFO L290 TraceCheckUtils]: 76: Hoare triple {13936#false} assume 1 + main_#t~post5#1 <= 2147483647; {13936#false} is VALID [2022-02-21 03:21:31,451 INFO L290 TraceCheckUtils]: 77: Hoare triple {13936#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {13936#false} is VALID [2022-02-21 03:21:31,451 INFO L290 TraceCheckUtils]: 78: Hoare triple {13936#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {13936#false} is VALID [2022-02-21 03:21:31,452 INFO L290 TraceCheckUtils]: 79: Hoare triple {13936#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {13936#false} is VALID [2022-02-21 03:21:31,452 INFO L290 TraceCheckUtils]: 80: Hoare triple {13936#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {13936#false} is VALID [2022-02-21 03:21:31,452 INFO L290 TraceCheckUtils]: 81: Hoare triple {13936#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {13936#false} is VALID [2022-02-21 03:21:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:21:31,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:21:31,821 INFO L290 TraceCheckUtils]: 81: Hoare triple {13936#false} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {13936#false} is VALID [2022-02-21 03:21:31,821 INFO L290 TraceCheckUtils]: 80: Hoare triple {13936#false} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {13936#false} is VALID [2022-02-21 03:21:31,821 INFO L290 TraceCheckUtils]: 79: Hoare triple {13936#false} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {13936#false} is VALID [2022-02-21 03:21:31,821 INFO L290 TraceCheckUtils]: 78: Hoare triple {13936#false} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {13936#false} is VALID [2022-02-21 03:21:31,822 INFO L290 TraceCheckUtils]: 77: Hoare triple {13936#false} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {13936#false} is VALID [2022-02-21 03:21:31,822 INFO L290 TraceCheckUtils]: 76: Hoare triple {13936#false} assume 1 + main_#t~post5#1 <= 2147483647; {13936#false} is VALID [2022-02-21 03:21:31,822 INFO L290 TraceCheckUtils]: 75: Hoare triple {13936#false} main_#t~post5#1 := main_~i~0#1; {13936#false} is VALID [2022-02-21 03:21:31,822 INFO L290 TraceCheckUtils]: 74: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:21:31,822 INFO L290 TraceCheckUtils]: 73: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:21:31,822 INFO L290 TraceCheckUtils]: 72: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:21:31,822 INFO L290 TraceCheckUtils]: 71: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:21:31,822 INFO L290 TraceCheckUtils]: 70: Hoare triple {13936#false} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {13936#false} is VALID [2022-02-21 03:21:31,822 INFO L290 TraceCheckUtils]: 69: Hoare triple {13936#false} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {13936#false} is VALID [2022-02-21 03:21:31,822 INFO L290 TraceCheckUtils]: 68: Hoare triple {13936#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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {13936#false} is VALID [2022-02-21 03:21:31,822 INFO L290 TraceCheckUtils]: 67: Hoare triple {13936#false} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {13936#false} is VALID [2022-02-21 03:21:31,823 INFO L290 TraceCheckUtils]: 66: Hoare triple {13936#false} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {13936#false} is VALID [2022-02-21 03:21:31,823 INFO L290 TraceCheckUtils]: 65: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:21:31,823 INFO L290 TraceCheckUtils]: 64: Hoare triple {13936#false} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {13936#false} is VALID [2022-02-21 03:21:31,823 INFO L290 TraceCheckUtils]: 63: Hoare triple {13936#false} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {13936#false} is VALID [2022-02-21 03:21:31,823 INFO L290 TraceCheckUtils]: 62: Hoare triple {13936#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {13936#false} is VALID [2022-02-21 03:21:31,823 INFO L290 TraceCheckUtils]: 61: Hoare triple {13936#false} goto; {13936#false} is VALID [2022-02-21 03:21:31,823 INFO L290 TraceCheckUtils]: 60: Hoare triple {13936#false} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {13936#false} is VALID [2022-02-21 03:21:31,824 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13935#true} {13936#false} #486#return; {13936#false} is VALID [2022-02-21 03:21:31,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {13935#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {13935#true} is VALID [2022-02-21 03:21:31,824 INFO L290 TraceCheckUtils]: 57: Hoare triple {13935#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {13935#true} is VALID [2022-02-21 03:21:31,824 INFO L290 TraceCheckUtils]: 56: Hoare triple {13935#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {13935#true} is VALID [2022-02-21 03:21:31,824 INFO L290 TraceCheckUtils]: 55: Hoare triple {13935#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {13935#true} is VALID [2022-02-21 03:21:31,824 INFO L290 TraceCheckUtils]: 54: Hoare triple {13935#true} #t~loopctr143 := 0; {13935#true} is VALID [2022-02-21 03:21:31,824 INFO L272 TraceCheckUtils]: 53: Hoare triple {13936#false} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {13935#true} is VALID [2022-02-21 03:21:31,824 INFO L290 TraceCheckUtils]: 52: Hoare triple {13936#false} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {13936#false} is VALID [2022-02-21 03:21:31,825 INFO L290 TraceCheckUtils]: 51: Hoare triple {13936#false} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#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);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);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);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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#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(2685476833, main_#t~mem41#1.base, 40 + 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 main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {13936#false} is VALID [2022-02-21 03:21:31,826 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14286#(not (= 44 |#Ultimate.C_memset_#amount|))} {13935#true} #484#return; {13936#false} is VALID [2022-02-21 03:21:31,826 INFO L290 TraceCheckUtils]: 49: Hoare triple {14286#(not (= 44 |#Ultimate.C_memset_#amount|))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {14286#(not (= 44 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-21 03:21:31,827 INFO L290 TraceCheckUtils]: 48: Hoare triple {14293#(or (< (mod |#Ultimate.C_memset_#t~loopctr143| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {14286#(not (= 44 |#Ultimate.C_memset_#amount|))} is VALID [2022-02-21 03:21:31,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {14297#(or (not (= 44 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {14293#(or (< (mod |#Ultimate.C_memset_#t~loopctr143| 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} is VALID [2022-02-21 03:21:31,830 INFO L290 TraceCheckUtils]: 46: Hoare triple {14301#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 2) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {14297#(or (not (= 44 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 1) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:21:31,831 INFO L290 TraceCheckUtils]: 45: Hoare triple {14305#(or (not (= 44 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 3) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {14301#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 2) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} is VALID [2022-02-21 03:21:31,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {14309#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 4) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {14305#(or (not (= 44 |#Ultimate.C_memset_#amount|)) (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 3) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-21 03:21:31,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {13935#true} #t~loopctr143 := 0; {14309#(or (< (mod (+ |#Ultimate.C_memset_#t~loopctr143| 4) 4294967296) (mod |#Ultimate.C_memset_#amount| 4294967296)) (not (= 44 |#Ultimate.C_memset_#amount|)))} is VALID [2022-02-21 03:21:31,833 INFO L272 TraceCheckUtils]: 42: Hoare triple {13935#true} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {13935#true} is VALID [2022-02-21 03:21:31,833 INFO L290 TraceCheckUtils]: 41: Hoare triple {13935#true} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:21:31,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {13935#true} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:21:31,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {13935#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); {13935#true} is VALID [2022-02-21 03:21:31,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {13935#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); {13935#true} is VALID [2022-02-21 03:21:31,834 INFO L290 TraceCheckUtils]: 37: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:21:31,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:21:31,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:21:31,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {13935#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)))); {13935#true} is VALID [2022-02-21 03:21:31,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {13935#true} havoc main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {13935#true} is VALID [2022-02-21 03:21:31,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {13935#true} is VALID [2022-02-21 03:21:31,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {13935#true} is VALID [2022-02-21 03:21:31,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {13935#true} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {13935#true} is VALID [2022-02-21 03:21:31,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {13935#true} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {13935#true} assume !main_#t~switch19#1; {13935#true} is VALID [2022-02-21 03:21:31,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {13935#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {13935#true} is VALID [2022-02-21 03:21:31,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {13935#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {13935#true} is VALID [2022-02-21 03:21:31,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {13935#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; {13935#true} is VALID [2022-02-21 03:21:31,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {13935#true} goto; {13935#true} is VALID [2022-02-21 03:21:31,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {13935#true} havoc main_~_ha_hashv~0#1; {13935#true} is VALID [2022-02-21 03:21:31,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {13935#true} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:21:31,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {13935#true} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {13935#true} is VALID [2022-02-21 03:21:31,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {13935#true} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {13935#true} is VALID [2022-02-21 03:21:31,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {13935#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {13935#true} is VALID [2022-02-21 03:21:31,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {13935#true} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {13935#true} is VALID [2022-02-21 03:21:31,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {13935#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {13935#true} is VALID [2022-02-21 03:21:31,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {13935#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; {13935#true} is VALID [2022-02-21 03:21:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:21:31,839 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:21:31,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627399971] [2022-02-21 03:21:31,839 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:21:31,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542877447] [2022-02-21 03:21:31,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542877447] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:21:31,839 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:21:31,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2022-02-21 03:21:31,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171236587] [2022-02-21 03:21:31,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:21:31,841 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2022-02-21 03:21:31,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:21:31,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:31,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:31,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-21 03:21:31,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:21:31,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:21:31,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:21:31,936 INFO L87 Difference]: Start difference. First operand 343 states and 431 transitions. Second operand has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:34,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:34,614 INFO L93 Difference]: Finished difference Result 688 states and 894 transitions. [2022-02-21 03:21:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:21:34,615 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 82 [2022-02-21 03:21:34,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:21:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 396 transitions. [2022-02-21 03:21:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:34,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 396 transitions. [2022-02-21 03:21:34,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 396 transitions. [2022-02-21 03:21:34,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:34,971 INFO L225 Difference]: With dead ends: 688 [2022-02-21 03:21:34,971 INFO L226 Difference]: Without dead ends: 351 [2022-02-21 03:21:34,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=553, Unknown=0, NotChecked=0, Total=812 [2022-02-21 03:21:34,974 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 198 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-21 03:21:34,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 1009 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-21 03:21:34,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-02-21 03:21:35,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 343. [2022-02-21 03:21:35,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:21:35,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:35,030 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:35,046 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:35,067 INFO L93 Difference]: Finished difference Result 351 states and 447 transitions. [2022-02-21 03:21:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 447 transitions. [2022-02-21 03:21:35,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:35,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:35,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 351 states. [2022-02-21 03:21:35,069 INFO L87 Difference]: Start difference. First operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 351 states. [2022-02-21 03:21:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:35,075 INFO L93 Difference]: Finished difference Result 351 states and 447 transitions. [2022-02-21 03:21:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 447 transitions. [2022-02-21 03:21:35,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:35,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:35,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:21:35,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:21:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 316 states have (on average 1.2341772151898733) internal successors, (390), 330 states have internal predecessors, (390), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 431 transitions. [2022-02-21 03:21:35,082 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 431 transitions. Word has length 82 [2022-02-21 03:21:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:21:35,082 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 431 transitions. [2022-02-21 03:21:35,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 431 transitions. [2022-02-21 03:21:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-21 03:21:35,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:21:35,084 INFO L514 BasicCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:21:35,108 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-21 03:21:35,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-21 03:21:35,297 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:21:35,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:21:35,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1367817495, now seen corresponding path program 3 times [2022-02-21 03:21:35,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:21:35,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962549514] [2022-02-21 03:21:35,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:21:35,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:21:35,372 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:21:35,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454680558] [2022-02-21 03:21:35,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:21:35,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:21:35,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:21:35,376 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-21 03:21:35,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:21:38,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-21 03:21:38,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:21:38,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:21:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:21:38,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:21:38,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {16429#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; {16429#true} is VALID [2022-02-21 03:21:38,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {16429#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,722 INFO L290 TraceCheckUtils]: 4: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_~_ha_hashv~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#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; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,730 INFO L290 TraceCheckUtils]: 27: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,730 INFO L290 TraceCheckUtils]: 28: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_#t~switch19#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#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)))); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#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); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#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); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,735 INFO L272 TraceCheckUtils]: 42: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {16429#true} is VALID [2022-02-21 03:21:38,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {16429#true} #t~loopctr143 := 0; {16429#true} is VALID [2022-02-21 03:21:38,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,736 INFO L290 TraceCheckUtils]: 51: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,736 INFO L290 TraceCheckUtils]: 52: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {16429#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {16429#true} is VALID [2022-02-21 03:21:38,736 INFO L290 TraceCheckUtils]: 55: Hoare triple {16429#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {16429#true} is VALID [2022-02-21 03:21:38,737 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {16429#true} {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} #484#return; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,737 INFO L290 TraceCheckUtils]: 57: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#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);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);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);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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#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(2685476833, main_#t~mem41#1.base, 40 + 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 main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,738 INFO L272 TraceCheckUtils]: 59: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {16429#true} is VALID [2022-02-21 03:21:38,738 INFO L290 TraceCheckUtils]: 60: Hoare triple {16429#true} #t~loopctr143 := 0; {16429#true} is VALID [2022-02-21 03:21:38,738 INFO L290 TraceCheckUtils]: 61: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,738 INFO L290 TraceCheckUtils]: 62: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,738 INFO L290 TraceCheckUtils]: 63: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,739 INFO L290 TraceCheckUtils]: 64: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,739 INFO L290 TraceCheckUtils]: 65: Hoare triple {16429#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {16429#true} is VALID [2022-02-21 03:21:38,739 INFO L290 TraceCheckUtils]: 66: Hoare triple {16429#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {16429#true} is VALID [2022-02-21 03:21:38,739 INFO L290 TraceCheckUtils]: 67: Hoare triple {16429#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {16429#true} is VALID [2022-02-21 03:21:38,740 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16429#true} {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} #486#return; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,740 INFO L290 TraceCheckUtils]: 69: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,740 INFO L290 TraceCheckUtils]: 70: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,741 INFO L290 TraceCheckUtils]: 71: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,741 INFO L290 TraceCheckUtils]: 72: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,741 INFO L290 TraceCheckUtils]: 73: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,742 INFO L290 TraceCheckUtils]: 74: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,742 INFO L290 TraceCheckUtils]: 75: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,742 INFO L290 TraceCheckUtils]: 76: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,743 INFO L290 TraceCheckUtils]: 77: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,743 INFO L290 TraceCheckUtils]: 78: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,743 INFO L290 TraceCheckUtils]: 79: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,744 INFO L290 TraceCheckUtils]: 80: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,744 INFO L290 TraceCheckUtils]: 81: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,744 INFO L290 TraceCheckUtils]: 82: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,745 INFO L290 TraceCheckUtils]: 83: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} goto; {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,745 INFO L290 TraceCheckUtils]: 84: Hoare triple {16437#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post5#1 := main_~i~0#1; {16687#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} is VALID [2022-02-21 03:21:38,745 INFO L290 TraceCheckUtils]: 85: Hoare triple {16687#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} assume 1 + main_#t~post5#1 <= 2147483647; {16687#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} is VALID [2022-02-21 03:21:38,746 INFO L290 TraceCheckUtils]: 86: Hoare triple {16687#(<= 0 |ULTIMATE.start_main_#t~post5#1|)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {16694#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:21:38,746 INFO L290 TraceCheckUtils]: 87: Hoare triple {16694#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {16698#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:21:38,747 INFO L290 TraceCheckUtils]: 88: Hoare triple {16698#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| 10))} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {16698#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:21:38,747 INFO L290 TraceCheckUtils]: 89: Hoare triple {16698#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| 10))} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {16698#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| 10))} is VALID [2022-02-21 03:21:38,748 INFO L290 TraceCheckUtils]: 90: Hoare triple {16698#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (< |ULTIMATE.start_main_~i~0#1| 10))} assume !(main_~i~0#1 * main_~i~0#1 <= 2147483647); {16430#false} is VALID [2022-02-21 03:21:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-02-21 03:21:38,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:21:38,749 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:21:38,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962549514] [2022-02-21 03:21:38,749 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:21:38,749 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454680558] [2022-02-21 03:21:38,749 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454680558] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:21:38,749 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:21:38,749 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:21:38,749 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865553451] [2022-02-21 03:21:38,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:21:38,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 91 [2022-02-21 03:21:38,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:21:38,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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-21 03:21:38,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:38,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:21:38,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:21:38,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:21:38,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:21:38,810 INFO L87 Difference]: Start difference. First operand 343 states and 431 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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-21 03:21:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:40,154 INFO L93 Difference]: Finished difference Result 343 states and 431 transitions. [2022-02-21 03:21:40,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:21:40,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 91 [2022-02-21 03:21:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:21:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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-21 03:21:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 272 transitions. [2022-02-21 03:21:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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-21 03:21:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 272 transitions. [2022-02-21 03:21:40,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 272 transitions. [2022-02-21 03:21:40,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:40,414 INFO L225 Difference]: With dead ends: 343 [2022-02-21 03:21:40,414 INFO L226 Difference]: Without dead ends: 342 [2022-02-21 03:21:40,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:21:40,415 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 172 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:21:40,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 792 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:21:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-02-21 03:21:40,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-02-21 03:21:40,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:21:40,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 342 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 329 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:40,536 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 342 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 329 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:40,537 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 342 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 329 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:40,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:40,545 INFO L93 Difference]: Finished difference Result 342 states and 429 transitions. [2022-02-21 03:21:40,546 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 429 transitions. [2022-02-21 03:21:40,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:40,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:40,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 342 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 329 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 342 states. [2022-02-21 03:21:40,548 INFO L87 Difference]: Start difference. First operand has 342 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 329 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 342 states. [2022-02-21 03:21:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:40,556 INFO L93 Difference]: Finished difference Result 342 states and 429 transitions. [2022-02-21 03:21:40,556 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 429 transitions. [2022-02-21 03:21:40,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:40,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:40,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:21:40,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:21:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 316 states have (on average 1.2278481012658229) internal successors, (388), 329 states have internal predecessors, (388), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 429 transitions. [2022-02-21 03:21:40,568 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 429 transitions. Word has length 91 [2022-02-21 03:21:40,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:21:40,569 INFO L470 AbstractCegarLoop]: Abstraction has 342 states and 429 transitions. [2022-02-21 03:21:40,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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-21 03:21:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 429 transitions. [2022-02-21 03:21:40,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-02-21 03:21:40,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:21:40,572 INFO L514 BasicCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:21:40,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:21:40,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-21 03:21:40,785 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:21:40,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:21:40,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1165389731, now seen corresponding path program 1 times [2022-02-21 03:21:40,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:21:40,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86634970] [2022-02-21 03:21:40,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:21:40,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:21:40,965 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:21:40,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606178392] [2022-02-21 03:21:40,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:21:40,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:21:40,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:21:40,967 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:21:40,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:21:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:21:42,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 3825 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:21:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:21:42,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:21:43,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {18240#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; {18240#true} is VALID [2022-02-21 03:21:43,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {18240#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,333 INFO L290 TraceCheckUtils]: 4: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_hashv~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 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; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,346 INFO L290 TraceCheckUtils]: 31: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~switch19#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 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)))); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,347 INFO L290 TraceCheckUtils]: 35: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,347 INFO L290 TraceCheckUtils]: 36: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 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); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 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); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,349 INFO L290 TraceCheckUtils]: 41: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,349 INFO L272 TraceCheckUtils]: 42: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {18240#true} is VALID [2022-02-21 03:21:43,349 INFO L290 TraceCheckUtils]: 43: Hoare triple {18240#true} #t~loopctr143 := 0; {18240#true} is VALID [2022-02-21 03:21:43,349 INFO L290 TraceCheckUtils]: 44: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,349 INFO L290 TraceCheckUtils]: 45: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,349 INFO L290 TraceCheckUtils]: 46: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,350 INFO L290 TraceCheckUtils]: 48: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,350 INFO L290 TraceCheckUtils]: 49: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,350 INFO L290 TraceCheckUtils]: 50: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,350 INFO L290 TraceCheckUtils]: 51: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,350 INFO L290 TraceCheckUtils]: 53: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,350 INFO L290 TraceCheckUtils]: 54: Hoare triple {18240#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {18240#true} is VALID [2022-02-21 03:21:43,350 INFO L290 TraceCheckUtils]: 55: Hoare triple {18240#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18240#true} is VALID [2022-02-21 03:21:43,351 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {18240#true} {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} #484#return; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,351 INFO L290 TraceCheckUtils]: 57: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#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);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);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);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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#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(2685476833, main_#t~mem41#1.base, 40 + 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 main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,352 INFO L290 TraceCheckUtils]: 58: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,352 INFO L272 TraceCheckUtils]: 59: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {18240#true} is VALID [2022-02-21 03:21:43,352 INFO L290 TraceCheckUtils]: 60: Hoare triple {18240#true} #t~loopctr143 := 0; {18240#true} is VALID [2022-02-21 03:21:43,352 INFO L290 TraceCheckUtils]: 61: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,352 INFO L290 TraceCheckUtils]: 62: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,352 INFO L290 TraceCheckUtils]: 63: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,352 INFO L290 TraceCheckUtils]: 64: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:43,353 INFO L290 TraceCheckUtils]: 66: Hoare triple {18240#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {18240#true} is VALID [2022-02-21 03:21:43,353 INFO L290 TraceCheckUtils]: 67: Hoare triple {18240#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18240#true} is VALID [2022-02-21 03:21:43,354 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18240#true} {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} #486#return; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,354 INFO L290 TraceCheckUtils]: 69: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,354 INFO L290 TraceCheckUtils]: 70: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,354 INFO L290 TraceCheckUtils]: 71: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,355 INFO L290 TraceCheckUtils]: 72: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,355 INFO L290 TraceCheckUtils]: 73: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,355 INFO L290 TraceCheckUtils]: 74: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,356 INFO L290 TraceCheckUtils]: 75: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,356 INFO L290 TraceCheckUtils]: 76: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,356 INFO L290 TraceCheckUtils]: 77: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,356 INFO L290 TraceCheckUtils]: 78: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,357 INFO L290 TraceCheckUtils]: 79: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,357 INFO L290 TraceCheckUtils]: 80: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,357 INFO L290 TraceCheckUtils]: 81: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,358 INFO L290 TraceCheckUtils]: 82: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,358 INFO L290 TraceCheckUtils]: 83: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} goto; {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:21:43,358 INFO L290 TraceCheckUtils]: 84: Hoare triple {18248#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post5#1 := main_~i~0#1; {18498#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:21:43,358 INFO L290 TraceCheckUtils]: 85: Hoare triple {18498#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume 1 + main_#t~post5#1 <= 2147483647; {18498#(<= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-21 03:21:43,359 INFO L290 TraceCheckUtils]: 86: Hoare triple {18498#(<= |ULTIMATE.start_main_#t~post5#1| 0)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,359 INFO L290 TraceCheckUtils]: 87: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,360 INFO L290 TraceCheckUtils]: 88: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,360 INFO L290 TraceCheckUtils]: 89: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,360 INFO L290 TraceCheckUtils]: 90: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,360 INFO L290 TraceCheckUtils]: 91: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,361 INFO L290 TraceCheckUtils]: 92: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_~_ha_hashv~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,361 INFO L290 TraceCheckUtils]: 93: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,361 INFO L290 TraceCheckUtils]: 94: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 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; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,361 INFO L290 TraceCheckUtils]: 95: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,361 INFO L290 TraceCheckUtils]: 96: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,362 INFO L290 TraceCheckUtils]: 97: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,362 INFO L290 TraceCheckUtils]: 98: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,362 INFO L290 TraceCheckUtils]: 99: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,362 INFO L290 TraceCheckUtils]: 100: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,363 INFO L290 TraceCheckUtils]: 101: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,363 INFO L290 TraceCheckUtils]: 102: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,363 INFO L290 TraceCheckUtils]: 103: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,363 INFO L290 TraceCheckUtils]: 104: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,364 INFO L290 TraceCheckUtils]: 105: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,364 INFO L290 TraceCheckUtils]: 106: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,364 INFO L290 TraceCheckUtils]: 107: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,364 INFO L290 TraceCheckUtils]: 108: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,365 INFO L290 TraceCheckUtils]: 109: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,365 INFO L290 TraceCheckUtils]: 110: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,365 INFO L290 TraceCheckUtils]: 111: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,365 INFO L290 TraceCheckUtils]: 112: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,366 INFO L290 TraceCheckUtils]: 113: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,366 INFO L290 TraceCheckUtils]: 114: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,366 INFO L290 TraceCheckUtils]: 115: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,366 INFO L290 TraceCheckUtils]: 116: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,366 INFO L290 TraceCheckUtils]: 117: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,367 INFO L290 TraceCheckUtils]: 118: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_#t~switch19#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,367 INFO L290 TraceCheckUtils]: 119: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 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)))); {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,367 INFO L290 TraceCheckUtils]: 120: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,367 INFO L290 TraceCheckUtils]: 121: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,368 INFO L290 TraceCheckUtils]: 122: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,368 INFO L290 TraceCheckUtils]: 123: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 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); {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,368 INFO L290 TraceCheckUtils]: 124: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,369 INFO L290 TraceCheckUtils]: 125: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;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~mem52#1;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 main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,369 INFO L290 TraceCheckUtils]: 126: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,369 INFO L290 TraceCheckUtils]: 127: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,369 INFO L290 TraceCheckUtils]: 128: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,370 INFO L290 TraceCheckUtils]: 129: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,370 INFO L290 TraceCheckUtils]: 130: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,370 INFO L290 TraceCheckUtils]: 131: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,370 INFO L290 TraceCheckUtils]: 132: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,371 INFO L290 TraceCheckUtils]: 133: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,371 INFO L290 TraceCheckUtils]: 134: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,371 INFO L290 TraceCheckUtils]: 135: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,371 INFO L290 TraceCheckUtils]: 136: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,372 INFO L290 TraceCheckUtils]: 137: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,372 INFO L290 TraceCheckUtils]: 138: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} goto; {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-21 03:21:43,372 INFO L290 TraceCheckUtils]: 139: Hoare triple {18505#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post5#1 := main_~i~0#1; {18665#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-21 03:21:43,372 INFO L290 TraceCheckUtils]: 140: Hoare triple {18665#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume 1 + main_#t~post5#1 <= 2147483647; {18665#(<= |ULTIMATE.start_main_#t~post5#1| 1)} is VALID [2022-02-21 03:21:43,373 INFO L290 TraceCheckUtils]: 141: Hoare triple {18665#(<= |ULTIMATE.start_main_#t~post5#1| 1)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,373 INFO L290 TraceCheckUtils]: 142: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,374 INFO L290 TraceCheckUtils]: 143: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,374 INFO L290 TraceCheckUtils]: 144: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,375 INFO L290 TraceCheckUtils]: 145: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,375 INFO L290 TraceCheckUtils]: 146: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,377 INFO L290 TraceCheckUtils]: 147: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_~_ha_hashv~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,378 INFO L290 TraceCheckUtils]: 148: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,378 INFO L290 TraceCheckUtils]: 149: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} 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; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,378 INFO L290 TraceCheckUtils]: 150: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,379 INFO L290 TraceCheckUtils]: 151: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,379 INFO L290 TraceCheckUtils]: 152: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,379 INFO L290 TraceCheckUtils]: 153: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,379 INFO L290 TraceCheckUtils]: 154: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,380 INFO L290 TraceCheckUtils]: 155: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,380 INFO L290 TraceCheckUtils]: 156: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,380 INFO L290 TraceCheckUtils]: 157: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,380 INFO L290 TraceCheckUtils]: 158: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,381 INFO L290 TraceCheckUtils]: 159: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,381 INFO L290 TraceCheckUtils]: 160: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,381 INFO L290 TraceCheckUtils]: 161: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,381 INFO L290 TraceCheckUtils]: 162: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,382 INFO L290 TraceCheckUtils]: 163: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,382 INFO L290 TraceCheckUtils]: 164: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,383 INFO L290 TraceCheckUtils]: 165: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,383 INFO L290 TraceCheckUtils]: 166: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,383 INFO L290 TraceCheckUtils]: 167: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,383 INFO L290 TraceCheckUtils]: 168: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,383 INFO L290 TraceCheckUtils]: 169: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,384 INFO L290 TraceCheckUtils]: 170: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,384 INFO L290 TraceCheckUtils]: 171: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,384 INFO L290 TraceCheckUtils]: 172: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,384 INFO L290 TraceCheckUtils]: 173: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_#t~switch19#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,385 INFO L290 TraceCheckUtils]: 174: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} 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)))); {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,385 INFO L290 TraceCheckUtils]: 175: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,385 INFO L290 TraceCheckUtils]: 176: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,385 INFO L290 TraceCheckUtils]: 177: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,386 INFO L290 TraceCheckUtils]: 178: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} 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); {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,386 INFO L290 TraceCheckUtils]: 179: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,386 INFO L290 TraceCheckUtils]: 180: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;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~mem52#1;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 main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,386 INFO L290 TraceCheckUtils]: 181: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,387 INFO L290 TraceCheckUtils]: 182: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,387 INFO L290 TraceCheckUtils]: 183: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,387 INFO L290 TraceCheckUtils]: 184: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,387 INFO L290 TraceCheckUtils]: 185: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,388 INFO L290 TraceCheckUtils]: 186: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,388 INFO L290 TraceCheckUtils]: 187: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,388 INFO L290 TraceCheckUtils]: 188: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,388 INFO L290 TraceCheckUtils]: 189: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,389 INFO L290 TraceCheckUtils]: 190: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,389 INFO L290 TraceCheckUtils]: 191: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,389 INFO L290 TraceCheckUtils]: 192: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,389 INFO L290 TraceCheckUtils]: 193: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} goto; {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-21 03:21:43,390 INFO L290 TraceCheckUtils]: 194: Hoare triple {18672#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post5#1 := main_~i~0#1; {18832#(<= |ULTIMATE.start_main_#t~post5#1| 2)} is VALID [2022-02-21 03:21:43,390 INFO L290 TraceCheckUtils]: 195: Hoare triple {18832#(<= |ULTIMATE.start_main_#t~post5#1| 2)} assume !(1 + main_#t~post5#1 <= 2147483647); {18241#false} is VALID [2022-02-21 03:21:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-02-21 03:21:43,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:21:44,117 INFO L290 TraceCheckUtils]: 195: Hoare triple {18836#(<= |ULTIMATE.start_main_#t~post5#1| 2147483646)} assume !(1 + main_#t~post5#1 <= 2147483647); {18241#false} is VALID [2022-02-21 03:21:44,117 INFO L290 TraceCheckUtils]: 194: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~post5#1 := main_~i~0#1; {18836#(<= |ULTIMATE.start_main_#t~post5#1| 2147483646)} is VALID [2022-02-21 03:21:44,118 INFO L290 TraceCheckUtils]: 193: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,118 INFO L290 TraceCheckUtils]: 192: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,118 INFO L290 TraceCheckUtils]: 191: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,119 INFO L290 TraceCheckUtils]: 190: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,119 INFO L290 TraceCheckUtils]: 189: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,120 INFO L290 TraceCheckUtils]: 188: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,120 INFO L290 TraceCheckUtils]: 187: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,120 INFO L290 TraceCheckUtils]: 186: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,121 INFO L290 TraceCheckUtils]: 185: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,121 INFO L290 TraceCheckUtils]: 184: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,122 INFO L290 TraceCheckUtils]: 183: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,122 INFO L290 TraceCheckUtils]: 182: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,122 INFO L290 TraceCheckUtils]: 181: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,123 INFO L290 TraceCheckUtils]: 180: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;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~mem52#1;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 main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,123 INFO L290 TraceCheckUtils]: 179: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,124 INFO L290 TraceCheckUtils]: 178: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} 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); {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,124 INFO L290 TraceCheckUtils]: 177: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,124 INFO L290 TraceCheckUtils]: 176: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,125 INFO L290 TraceCheckUtils]: 175: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,125 INFO L290 TraceCheckUtils]: 174: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} 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)))); {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,126 INFO L290 TraceCheckUtils]: 173: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} havoc main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,126 INFO L290 TraceCheckUtils]: 172: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,126 INFO L290 TraceCheckUtils]: 171: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,127 INFO L290 TraceCheckUtils]: 170: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,136 INFO L290 TraceCheckUtils]: 169: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,136 INFO L290 TraceCheckUtils]: 168: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,137 INFO L290 TraceCheckUtils]: 167: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,137 INFO L290 TraceCheckUtils]: 166: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,138 INFO L290 TraceCheckUtils]: 165: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,138 INFO L290 TraceCheckUtils]: 164: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,138 INFO L290 TraceCheckUtils]: 163: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,139 INFO L290 TraceCheckUtils]: 162: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,139 INFO L290 TraceCheckUtils]: 161: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,140 INFO L290 TraceCheckUtils]: 160: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,140 INFO L290 TraceCheckUtils]: 159: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,140 INFO L290 TraceCheckUtils]: 158: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,141 INFO L290 TraceCheckUtils]: 157: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,141 INFO L290 TraceCheckUtils]: 156: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,142 INFO L290 TraceCheckUtils]: 155: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,142 INFO L290 TraceCheckUtils]: 154: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,143 INFO L290 TraceCheckUtils]: 153: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,143 INFO L290 TraceCheckUtils]: 152: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !main_#t~switch19#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,143 INFO L290 TraceCheckUtils]: 151: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,144 INFO L290 TraceCheckUtils]: 150: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,144 INFO L290 TraceCheckUtils]: 149: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} 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; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,145 INFO L290 TraceCheckUtils]: 148: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} goto; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,145 INFO L290 TraceCheckUtils]: 147: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} havoc main_~_ha_hashv~0#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,145 INFO L290 TraceCheckUtils]: 146: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,146 INFO L290 TraceCheckUtils]: 145: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,146 INFO L290 TraceCheckUtils]: 144: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,146 INFO L290 TraceCheckUtils]: 143: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,147 INFO L290 TraceCheckUtils]: 142: Hoare triple {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,148 INFO L290 TraceCheckUtils]: 141: Hoare triple {19000#(<= |ULTIMATE.start_main_#t~post5#1| 2147483645)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {18840#(<= |ULTIMATE.start_main_~i~0#1| 2147483646)} is VALID [2022-02-21 03:21:44,148 INFO L290 TraceCheckUtils]: 140: Hoare triple {19000#(<= |ULTIMATE.start_main_#t~post5#1| 2147483645)} assume 1 + main_#t~post5#1 <= 2147483647; {19000#(<= |ULTIMATE.start_main_#t~post5#1| 2147483645)} is VALID [2022-02-21 03:21:44,149 INFO L290 TraceCheckUtils]: 139: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~post5#1 := main_~i~0#1; {19000#(<= |ULTIMATE.start_main_#t~post5#1| 2147483645)} is VALID [2022-02-21 03:21:44,149 INFO L290 TraceCheckUtils]: 138: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,149 INFO L290 TraceCheckUtils]: 137: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,150 INFO L290 TraceCheckUtils]: 136: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,150 INFO L290 TraceCheckUtils]: 135: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,151 INFO L290 TraceCheckUtils]: 134: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,151 INFO L290 TraceCheckUtils]: 133: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,151 INFO L290 TraceCheckUtils]: 132: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,152 INFO L290 TraceCheckUtils]: 131: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,152 INFO L290 TraceCheckUtils]: 130: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,153 INFO L290 TraceCheckUtils]: 129: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,153 INFO L290 TraceCheckUtils]: 128: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,154 INFO L290 TraceCheckUtils]: 127: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,154 INFO L290 TraceCheckUtils]: 126: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,154 INFO L290 TraceCheckUtils]: 125: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem49#1.base, main_#t~mem49#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_#t~mem49#1.base, 16 + main_#t~mem49#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem52#1 := read~int(main_#t~mem51#1.base, 20 + main_#t~mem51#1.offset, 4);call write~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset - main_#t~mem52#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem49#1.base, main_#t~mem49#1.offset;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~mem52#1;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 main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_#t~mem53#1.base, 16 + main_#t~mem53#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem54#1.base, 8 + main_#t~mem54#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset;havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;call main_#t~mem55#1.base, main_#t~mem55#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~mem55#1.base, 16 + main_#t~mem55#1.offset, 4);havoc main_#t~mem55#1.base, main_#t~mem55#1.offset; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,155 INFO L290 TraceCheckUtils]: 124: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem48#1.base, main_#t~mem48#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem48#1.base, main_#t~mem48#1.offset; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,155 INFO L290 TraceCheckUtils]: 123: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} 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); {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,156 INFO L290 TraceCheckUtils]: 122: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,156 INFO L290 TraceCheckUtils]: 121: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,157 INFO L290 TraceCheckUtils]: 120: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,157 INFO L290 TraceCheckUtils]: 119: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} 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)))); {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,158 INFO L290 TraceCheckUtils]: 118: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} havoc main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,158 INFO L290 TraceCheckUtils]: 117: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,158 INFO L290 TraceCheckUtils]: 116: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,159 INFO L290 TraceCheckUtils]: 115: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,159 INFO L290 TraceCheckUtils]: 114: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,160 INFO L290 TraceCheckUtils]: 113: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,160 INFO L290 TraceCheckUtils]: 112: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,161 INFO L290 TraceCheckUtils]: 111: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,161 INFO L290 TraceCheckUtils]: 110: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,161 INFO L290 TraceCheckUtils]: 109: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,162 INFO L290 TraceCheckUtils]: 108: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,162 INFO L290 TraceCheckUtils]: 107: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,163 INFO L290 TraceCheckUtils]: 106: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,163 INFO L290 TraceCheckUtils]: 105: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,164 INFO L290 TraceCheckUtils]: 104: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,164 INFO L290 TraceCheckUtils]: 103: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,164 INFO L290 TraceCheckUtils]: 102: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,165 INFO L290 TraceCheckUtils]: 101: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,165 INFO L290 TraceCheckUtils]: 100: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,166 INFO L290 TraceCheckUtils]: 99: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,166 INFO L290 TraceCheckUtils]: 98: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,167 INFO L290 TraceCheckUtils]: 97: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !main_#t~switch19#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,167 INFO L290 TraceCheckUtils]: 96: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,167 INFO L290 TraceCheckUtils]: 95: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,168 INFO L290 TraceCheckUtils]: 94: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} 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; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,168 INFO L290 TraceCheckUtils]: 93: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} goto; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,168 INFO L290 TraceCheckUtils]: 92: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} havoc main_~_ha_hashv~0#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,169 INFO L290 TraceCheckUtils]: 91: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,169 INFO L290 TraceCheckUtils]: 90: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,170 INFO L290 TraceCheckUtils]: 89: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,170 INFO L290 TraceCheckUtils]: 88: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,170 INFO L290 TraceCheckUtils]: 87: Hoare triple {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,171 INFO L290 TraceCheckUtils]: 86: Hoare triple {19167#(<= |ULTIMATE.start_main_#t~post5#1| 2147483644)} assume 1 + main_#t~post5#1 >= -2147483648;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {19007#(<= |ULTIMATE.start_main_~i~0#1| 2147483645)} is VALID [2022-02-21 03:21:44,172 INFO L290 TraceCheckUtils]: 85: Hoare triple {19167#(<= |ULTIMATE.start_main_#t~post5#1| 2147483644)} assume 1 + main_#t~post5#1 <= 2147483647; {19167#(<= |ULTIMATE.start_main_#t~post5#1| 2147483644)} is VALID [2022-02-21 03:21:44,172 INFO L290 TraceCheckUtils]: 84: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~post5#1 := main_~i~0#1; {19167#(<= |ULTIMATE.start_main_#t~post5#1| 2147483644)} is VALID [2022-02-21 03:21:44,172 INFO L290 TraceCheckUtils]: 83: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,173 INFO L290 TraceCheckUtils]: 82: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,173 INFO L290 TraceCheckUtils]: 81: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,174 INFO L290 TraceCheckUtils]: 80: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,174 INFO L290 TraceCheckUtils]: 79: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~short72#1;havoc main_#t~mem69#1;havoc main_#t~mem68#1;havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;havoc main_#t~mem71#1;havoc main_#t~short72#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,174 INFO L290 TraceCheckUtils]: 78: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_#t~short72#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem71#1 := read~int(main_#t~mem70#1.base, 36 + main_#t~mem70#1.offset, 4);main_#t~short72#1 := 0 == main_#t~mem71#1 % 4294967296; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,175 INFO L290 TraceCheckUtils]: 77: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} 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~mem69#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short72#1 := main_#t~mem69#1 % 4294967296 >= 10 * (1 + main_#t~mem68#1) % 4294967296; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,175 INFO L290 TraceCheckUtils]: 76: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_#t~mem66#1.base != 0 || main_#t~mem66#1.offset != 0;havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;call main_#t~mem67#1.base, main_#t~mem67#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~mem67#1.base, 12 + main_#t~mem67#1.offset, 4);havoc main_#t~mem67#1.base, main_#t~mem67#1.offset; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,176 INFO L290 TraceCheckUtils]: 75: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} 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.base, main_#t~mem62#1.offset := read~$Pointer$(main_#t~mem61#1.base, main_#t~mem61#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem62#1.base, main_#t~mem62#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~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1.base, main_#t~mem62#1.offset;call main_#t~mem63#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post64#1 := main_#t~mem63#1;call write~int(1 + main_#t~post64#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem63#1;havoc main_#t~post64#1;call main_#t~mem65#1.base, main_#t~mem65#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem65#1.base, main_#t~mem65#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem65#1.base, main_#t~mem65#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,176 INFO L290 TraceCheckUtils]: 74: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,177 INFO L290 TraceCheckUtils]: 73: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem60#1 := read~int(main_#t~mem59#1.base, 4 + main_#t~mem59#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem60#1 - 1 then 0 else (if 1 == main_#t~mem60#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~mem60#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem60#1 - 1 || 0 == main_#t~mem60#1 - 1 then main_#t~mem60#1 - 1 else (if main_#t~mem60#1 - 1 >= 0 then (main_#t~mem60#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem60#1 - 1))));havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;havoc main_#t~mem60#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,178 INFO L290 TraceCheckUtils]: 72: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} havoc main_~_ha_bkt~0#1;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, 12 + main_#t~mem56#1.offset, 4);main_#t~post58#1 := main_#t~mem57#1;call write~int(1 + main_#t~post58#1, main_#t~mem56#1.base, 12 + main_#t~mem56#1.offset, 4);havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;havoc main_#t~post58#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,178 INFO L290 TraceCheckUtils]: 71: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,178 INFO L290 TraceCheckUtils]: 70: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,179 INFO L290 TraceCheckUtils]: 69: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} havoc main_#t~mem45#1.base, main_#t~mem45#1.offset;havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;havoc main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,180 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {18240#true} {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} #486#return; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,180 INFO L290 TraceCheckUtils]: 67: Hoare triple {18240#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18240#true} is VALID [2022-02-21 03:21:44,180 INFO L290 TraceCheckUtils]: 66: Hoare triple {18240#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {18240#true} is VALID [2022-02-21 03:21:44,180 INFO L290 TraceCheckUtils]: 65: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,180 INFO L290 TraceCheckUtils]: 64: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,181 INFO L290 TraceCheckUtils]: 63: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,181 INFO L290 TraceCheckUtils]: 62: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {18240#true} #t~loopctr143 := 0; {18240#true} is VALID [2022-02-21 03:21:44,181 INFO L272 TraceCheckUtils]: 59: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} call main_#t~memset~res47#1.base, main_#t~memset~res47#1.offset := #Ultimate.C_memset(main_#t~mem46#1.base, main_#t~mem46#1.offset, 0, 384); {18240#true} is VALID [2022-02-21 03:21:44,182 INFO L290 TraceCheckUtils]: 58: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !(main_#t~mem43#1.base == 0 && main_#t~mem43#1.offset == 0);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem45#1.base, main_#t~mem45#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_#t~mem45#1.base, main_#t~mem45#1.offset, 4); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} havoc main_#t~mem33#1.base, main_#t~mem33#1.offset;havoc main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset;call main_#t~mem35#1.base, main_#t~mem35#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~mem35#1.base, 16 + main_#t~mem35#1.offset, 4);havoc main_#t~mem35#1.base, main_#t~mem35#1.offset;call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem36#1.base, 4 + main_#t~mem36#1.offset, 4);havoc main_#t~mem36#1.base, main_#t~mem36#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);call write~int(5, main_#t~mem37#1.base, 8 + main_#t~mem37#1.offset, 4);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);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~mem38#1.base, 20 + main_#t~mem38#1.offset, 4);havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;call main_#t~mem39#1.base, main_#t~mem39#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, 4);havoc main_#t~mem39#1.base, main_#t~mem39#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#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(2685476833, main_#t~mem41#1.base, 40 + 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 main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_#t~mem42#1.base, main_#t~mem42#1.offset, 4); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,183 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {18240#true} {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} #484#return; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,183 INFO L290 TraceCheckUtils]: 55: Hoare triple {18240#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {18240#true} is VALID [2022-02-21 03:21:44,183 INFO L290 TraceCheckUtils]: 54: Hoare triple {18240#true} assume !(#t~loopctr143 % 4294967296 < #amount % 4294967296); {18240#true} is VALID [2022-02-21 03:21:44,183 INFO L290 TraceCheckUtils]: 53: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,184 INFO L290 TraceCheckUtils]: 51: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,184 INFO L290 TraceCheckUtils]: 50: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,184 INFO L290 TraceCheckUtils]: 49: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,184 INFO L290 TraceCheckUtils]: 48: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,184 INFO L290 TraceCheckUtils]: 47: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,184 INFO L290 TraceCheckUtils]: 46: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,185 INFO L290 TraceCheckUtils]: 45: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,185 INFO L290 TraceCheckUtils]: 44: Hoare triple {18240#true} assume #t~loopctr143 % 4294967296 < #amount % 4294967296;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr143 := #value];#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr143 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr143 := #value % 256];#t~loopctr143 := 1 + #t~loopctr143; {18240#true} is VALID [2022-02-21 03:21:44,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {18240#true} #t~loopctr143 := 0; {18240#true} is VALID [2022-02-21 03:21:44,185 INFO L272 TraceCheckUtils]: 42: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} call main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset := #Ultimate.C_memset(main_#t~mem33#1.base, main_#t~mem33#1.offset, 0, 44); {18240#true} is VALID [2022-02-21 03:21:44,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !(main_#t~mem32#1.base == 0 && main_#t~mem32#1.offset == 0);havoc main_#t~mem32#1.base, main_#t~mem32#1.offset;call main_#t~mem33#1.base, main_#t~mem33#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,186 INFO L290 TraceCheckUtils]: 40: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} call main_#t~malloc31#1.base, main_#t~malloc31#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc31#1.base, main_#t~malloc31#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc31#1.base, main_#t~malloc31#1.offset;call main_#t~mem32#1.base, main_#t~mem32#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,186 INFO L290 TraceCheckUtils]: 39: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} 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); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,186 INFO L290 TraceCheckUtils]: 38: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} 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); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,187 INFO L290 TraceCheckUtils]: 37: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,188 INFO L290 TraceCheckUtils]: 34: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} 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)))); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} havoc main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_#t~switch19#1;call main_#t~mem30#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~mem30#1 % 256;havoc main_#t~mem30#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,189 INFO L290 TraceCheckUtils]: 31: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 1 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_#t~switch19#1;call main_#t~mem29#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~mem29#1 % 256);havoc main_#t~mem29#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 2 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_#t~switch19#1;call main_#t~mem28#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~mem28#1 % 256);havoc main_#t~mem28#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 3 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_#t~switch19#1;call main_#t~mem27#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~mem27#1 % 256);havoc main_#t~mem27#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 4 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 5 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 6 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 7 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 8 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 9 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_#t~switch19#1 := main_#t~switch19#1 || 10 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !main_#t~switch19#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch19#1 := 11 == main_~_hj_k~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} 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; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} goto; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} havoc main_~_ha_hashv~0#1; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_~i~0#1 * main_~i~0#1 >= -2147483648;call write~int(main_~i~0#1 * main_~i~0#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume main_~i~0#1 * main_~i~0#1 <= 2147483647; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} call write~int(main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, 4); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} assume !!(main_~i~0#1 < 10);call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {18240#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~mem7#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem14#1, main_#t~mem16#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem18#1, main_#t~switch19#1, main_#t~mem20#1, main_#t~mem21#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#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_~_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~malloc31#1.base, main_#t~malloc31#1.offset, main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~memset~res34#1.base, main_#t~memset~res34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~malloc40#1.base, main_#t~malloc40#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~mem45#1.base, main_#t~mem45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~memset~res47#1.base, main_#t~memset~res47#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~mem52#1, 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~post58#1, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1.base, main_#t~mem62#1.offset, main_#t~mem63#1, main_#t~post64#1, main_#t~mem65#1.base, main_#t~mem65#1.offset, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem69#1, main_#t~mem68#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1, main_#t~short72#1, main_#t~mem73#1.base, main_#t~mem73#1.offset, main_#t~mem74#1, main_#t~malloc75#1.base, main_#t~malloc75#1.offset, main_#t~mem76#1.base, main_#t~mem76#1.offset, main_#t~mem77#1.base, main_#t~mem77#1.offset, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~memset~res80#1.base, main_#t~memset~res80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem85#1, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem89#1, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem88#1, main_#t~ite90#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem95#1.base, main_#t~mem95#1.offset, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem97#1.base, main_#t~mem97#1.offset, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem101#1, main_#t~mem99#1.base, main_#t~mem99#1.offset, main_#t~mem100#1, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1, main_#t~pre104#1, main_#t~mem105#1.base, main_#t~mem105#1.offset, main_#t~mem106#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~post109#1, main_#t~mem113#1, main_#t~mem111#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem112#1, main_#t~mem114#1, main_#t~post115#1, main_#t~mem116#1.base, main_#t~mem116#1.offset, main_#t~mem117#1.base, main_#t~mem117#1.offset, main_#t~mem118#1.base, main_#t~mem118#1.offset, main_#t~post92#1, main_#t~mem93#1.base, main_#t~mem93#1.offset, main_#t~mem94#1, main_#t~mem119#1.base, main_#t~mem119#1.offset, main_#t~mem120#1.base, main_#t~mem120#1.offset, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~mem124#1, main_#t~post125#1, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1.base, main_#t~mem127#1.offset, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1.base, main_#t~mem129#1.offset, main_#t~mem132#1, main_#t~mem130#1.base, main_#t~mem130#1.offset, main_#t~mem131#1, main_#t~ite135#1, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1, main_#t~mem136#1.base, main_#t~mem136#1.offset, main_#t~mem137#1, main_#t~mem138#1.base, main_#t~mem138#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~post5#1, main_#t~mem140#1, main_#t~mem141#1, main_#t~mem139#1.base, main_#t~mem139#1.offset, main_~i~0#1, main_~user~0#1.base, main_~user~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;havoc main_~i~0#1;havoc main_~user~0#1.base, main_~user~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;main_~i~0#1 := 0; {19174#(<= |ULTIMATE.start_main_~i~0#1| 2147483644)} is VALID [2022-02-21 03:21:44,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {18240#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; {18240#true} is VALID [2022-02-21 03:21:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-02-21 03:21:44,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:21:44,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86634970] [2022-02-21 03:21:44,201 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:21:44,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606178392] [2022-02-21 03:21:44,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606178392] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:21:44,201 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:21:44,201 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-02-21 03:21:44,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851185123] [2022-02-21 03:21:44,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:21:44,202 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 26.53846153846154) internal successors, (345), 14 states have internal predecessors, (345), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 196 [2022-02-21 03:21:44,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:21:44,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 26.53846153846154) internal successors, (345), 14 states have internal predecessors, (345), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:44,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:44,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:21:44,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:21:44,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:21:44,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:21:44,470 INFO L87 Difference]: Start difference. First operand 342 states and 429 transitions. Second operand has 14 states, 13 states have (on average 26.53846153846154) internal successors, (345), 14 states have internal predecessors, (345), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:47,208 INFO L93 Difference]: Finished difference Result 465 states and 594 transitions. [2022-02-21 03:21:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:21:47,208 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 26.53846153846154) internal successors, (345), 14 states have internal predecessors, (345), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 196 [2022-02-21 03:21:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:21:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 26.53846153846154) internal successors, (345), 14 states have internal predecessors, (345), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 537 transitions. [2022-02-21 03:21:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 26.53846153846154) internal successors, (345), 14 states have internal predecessors, (345), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 537 transitions. [2022-02-21 03:21:47,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 537 transitions. [2022-02-21 03:21:47,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 537 edges. 537 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:21:47,712 INFO L225 Difference]: With dead ends: 465 [2022-02-21 03:21:47,712 INFO L226 Difference]: Without dead ends: 464 [2022-02-21 03:21:47,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2022-02-21 03:21:47,713 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 293 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:21:47,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 1676 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:21:47,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-02-21 03:21:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 341. [2022-02-21 03:21:47,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:21:47,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 464 states. Second operand has 341 states, 316 states have (on average 1.2246835443037976) internal successors, (387), 328 states have internal predecessors, (387), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:47,877 INFO L74 IsIncluded]: Start isIncluded. First operand 464 states. Second operand has 341 states, 316 states have (on average 1.2246835443037976) internal successors, (387), 328 states have internal predecessors, (387), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:47,877 INFO L87 Difference]: Start difference. First operand 464 states. Second operand has 341 states, 316 states have (on average 1.2246835443037976) internal successors, (387), 328 states have internal predecessors, (387), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:47,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:47,900 INFO L93 Difference]: Finished difference Result 464 states and 592 transitions. [2022-02-21 03:21:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 592 transitions. [2022-02-21 03:21:47,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:47,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:47,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 341 states, 316 states have (on average 1.2246835443037976) internal successors, (387), 328 states have internal predecessors, (387), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 464 states. [2022-02-21 03:21:47,902 INFO L87 Difference]: Start difference. First operand has 341 states, 316 states have (on average 1.2246835443037976) internal successors, (387), 328 states have internal predecessors, (387), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) Second operand 464 states. [2022-02-21 03:21:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:21:47,912 INFO L93 Difference]: Finished difference Result 464 states and 592 transitions. [2022-02-21 03:21:47,912 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 592 transitions. [2022-02-21 03:21:47,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:21:47,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:21:47,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:21:47,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:21:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 316 states have (on average 1.2246835443037976) internal successors, (387), 328 states have internal predecessors, (387), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2022-02-21 03:21:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 428 transitions. [2022-02-21 03:21:47,919 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 428 transitions. Word has length 196 [2022-02-21 03:21:47,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:21:47,920 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 428 transitions. [2022-02-21 03:21:47,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 26.53846153846154) internal successors, (345), 14 states have internal predecessors, (345), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-21 03:21:47,920 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 428 transitions. [2022-02-21 03:21:47,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-02-21 03:21:47,921 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:21:47,922 INFO L514 BasicCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:21:47,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:21:48,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-21 03:21:48,148 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:21:48,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:21:48,148 INFO L85 PathProgramCache]: Analyzing trace with hash -493453511, now seen corresponding path program 1 times [2022-02-21 03:21:48,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:21:48,149 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929583258] [2022-02-21 03:21:48,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:21:48,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:21:48,358 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:21:48,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [663953042] [2022-02-21 03:21:48,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:21:48,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:21:48,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:21:48,360 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:21:48,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process