./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:24:00,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:24:00,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:24:00,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:24:00,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:24:00,674 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:24:00,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:24:00,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:24:00,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:24:00,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:24:00,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:24:00,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:24:00,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:24:00,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:24:00,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:24:00,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:24:00,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:24:00,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:24:00,694 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:24:00,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:24:00,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:24:00,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:24:00,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:24:00,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:24:00,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:24:00,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:24:00,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:24:00,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:24:00,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:24:00,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:24:00,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:24:00,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:24:00,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:24:00,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:24:00,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:24:00,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:24:00,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:24:00,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:24:00,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:24:00,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:24:00,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:24:00,714 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 23:24:00,736 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:24:00,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:24:00,736 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:24:00,737 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:24:00,737 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:24:00,737 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:24:00,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:24:00,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:24:00,738 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:24:00,738 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:24:00,739 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:24:00,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:24:00,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:24:00,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:24:00,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 23:24:00,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:24:00,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 23:24:00,740 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:24:00,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 23:24:00,740 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:24:00,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 23:24:00,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:24:00,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:24:00,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:24:00,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:24:00,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:24:00,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:24:00,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 23:24:00,742 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:24:00,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:24:00,742 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 23:24:00,742 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 23:24:00,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 23:24:00,742 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 [2022-02-20 23:24:00,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:24:00,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:24:00,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:24:00,984 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:24:00,985 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:24:00,986 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2022-02-20 23:24:01,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c291cd08/a8e5ae2d1e5045c993ef10f2ff7233f8/FLAGe613d8458 [2022-02-20 23:24:01,499 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:24:01,502 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2022-02-20 23:24:01,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c291cd08/a8e5ae2d1e5045c993ef10f2ff7233f8/FLAGe613d8458 [2022-02-20 23:24:01,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c291cd08/a8e5ae2d1e5045c993ef10f2ff7233f8 [2022-02-20 23:24:01,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:24:01,538 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:24:01,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:24:01,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:24:01,543 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:24:01,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:24:01" (1/1) ... [2022-02-20 23:24:01,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7d3dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:01, skipping insertion in model container [2022-02-20 23:24:01,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:24:01" (1/1) ... [2022-02-20 23:24:01,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:24:01,593 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:24:01,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i[37019,37032] [2022-02-20 23:24:02,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i[47352,47365] [2022-02-20 23:24:02,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:24:02,081 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:24:02,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i[37019,37032] [2022-02-20 23:24:02,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i[47352,47365] [2022-02-20 23:24:02,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:24:02,338 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:24:02,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:02 WrapperNode [2022-02-20 23:24:02,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:24:02,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:24:02,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:24:02,356 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:24:02,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:02" (1/1) ... [2022-02-20 23:24:02,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:02" (1/1) ... [2022-02-20 23:24:02,529 INFO L137 Inliner]: procedures = 208, calls = 235, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 884 [2022-02-20 23:24:02,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:24:02,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:24:02,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:24:02,531 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:24:02,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:02" (1/1) ... [2022-02-20 23:24:02,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:02" (1/1) ... [2022-02-20 23:24:02,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:02" (1/1) ... [2022-02-20 23:24:02,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:02" (1/1) ... [2022-02-20 23:24:02,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:02" (1/1) ... [2022-02-20 23:24:02,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:02" (1/1) ... [2022-02-20 23:24:02,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:02" (1/1) ... [2022-02-20 23:24:02,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:24:02,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:24:02,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:24:02,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:24:02,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:02" (1/1) ... [2022-02-20 23:24:02,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:24:02,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:02,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:24:02,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:24:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 23:24:02,829 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 23:24:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:24:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-20 23:24:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:24:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:24:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:24:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 23:24:02,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 23:24:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:24:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:24:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:24:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:24:02,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:24:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:24:02,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:24:03,012 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:24:03,014 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:24:04,551 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:24:04,557 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:24:04,557 INFO L299 CfgBuilder]: Removed 54 assume(true) statements. [2022-02-20 23:24:04,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:24:04 BoogieIcfgContainer [2022-02-20 23:24:04,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:24:04,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:24:04,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:24:04,561 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:24:04,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:24:01" (1/3) ... [2022-02-20 23:24:04,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f393702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:24:04, skipping insertion in model container [2022-02-20 23:24:04,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:24:02" (2/3) ... [2022-02-20 23:24:04,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f393702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:24:04, skipping insertion in model container [2022-02-20 23:24:04,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:24:04" (3/3) ... [2022-02-20 23:24:04,563 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test2-1.i [2022-02-20 23:24:04,566 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:24:04,566 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 23:24:04,601 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:24:04,605 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:24:04,605 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 23:24:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 164 states have (on average 1.6890243902439024) internal successors, (277), 171 states have internal predecessors, (277), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:24:04,623 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:04,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:24:04,624 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:04,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:04,627 INFO L85 PathProgramCache]: Analyzing trace with hash -858859523, now seen corresponding path program 1 times [2022-02-20 23:24:04,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:04,633 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147680352] [2022-02-20 23:24:04,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:04,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:04,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#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; {180#true} is VALID [2022-02-20 23:24:04,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {180#true} is VALID [2022-02-20 23:24:04,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume !true; {181#false} is VALID [2022-02-20 23:24:04,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {181#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {181#false} is VALID [2022-02-20 23:24:04,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {181#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {181#false} is VALID [2022-02-20 23:24:04,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#false} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {181#false} is VALID [2022-02-20 23:24:04,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {181#false} assume !true; {181#false} is VALID [2022-02-20 23:24:04,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {181#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {181#false} is VALID [2022-02-20 23:24:04,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-02-20 23:24:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:24:04,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:04,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147680352] [2022-02-20 23:24:04,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147680352] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:04,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:04,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:24:04,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814214815] [2022-02-20 23:24:04,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:04,740 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:24:04,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:04,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:04,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:04,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:24:04,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:04,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:24:04,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:24:04,768 INFO L87 Difference]: Start difference. First operand has 177 states, 164 states have (on average 1.6890243902439024) internal successors, (277), 171 states have internal predecessors, (277), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:05,053 INFO L93 Difference]: Finished difference Result 352 states and 589 transitions. [2022-02-20 23:24:05,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:24:05,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 23:24:05,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:05,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 589 transitions. [2022-02-20 23:24:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 589 transitions. [2022-02-20 23:24:05,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 589 transitions. [2022-02-20 23:24:05,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 589 edges. 589 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:05,522 INFO L225 Difference]: With dead ends: 352 [2022-02-20 23:24:05,523 INFO L226 Difference]: Without dead ends: 173 [2022-02-20 23:24:05,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:24:05,531 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:24:05,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:24:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-02-20 23:24:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-02-20 23:24:05,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:05,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 161 states have (on average 1.3229813664596273) internal successors, (213), 167 states have internal predecessors, (213), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:05,564 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 161 states have (on average 1.3229813664596273) internal successors, (213), 167 states have internal predecessors, (213), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:05,564 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 161 states have (on average 1.3229813664596273) internal successors, (213), 167 states have internal predecessors, (213), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:05,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:05,571 INFO L93 Difference]: Finished difference Result 173 states and 229 transitions. [2022-02-20 23:24:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 229 transitions. [2022-02-20 23:24:05,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:05,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:05,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 161 states have (on average 1.3229813664596273) internal successors, (213), 167 states have internal predecessors, (213), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 173 states. [2022-02-20 23:24:05,573 INFO L87 Difference]: Start difference. First operand has 173 states, 161 states have (on average 1.3229813664596273) internal successors, (213), 167 states have internal predecessors, (213), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 173 states. [2022-02-20 23:24:05,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:05,579 INFO L93 Difference]: Finished difference Result 173 states and 229 transitions. [2022-02-20 23:24:05,579 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 229 transitions. [2022-02-20 23:24:05,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:05,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:05,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:05,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 161 states have (on average 1.3229813664596273) internal successors, (213), 167 states have internal predecessors, (213), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:05,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 229 transitions. [2022-02-20 23:24:05,587 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 229 transitions. Word has length 9 [2022-02-20 23:24:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:05,587 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 229 transitions. [2022-02-20 23:24:05,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 229 transitions. [2022-02-20 23:24:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 23:24:05,589 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:05,589 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] [2022-02-20 23:24:05,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:24:05,590 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:05,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:05,590 INFO L85 PathProgramCache]: Analyzing trace with hash -294026559, now seen corresponding path program 1 times [2022-02-20 23:24:05,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:05,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037044667] [2022-02-20 23:24:05,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:05,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:05,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {1168#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; {1168#true} is VALID [2022-02-20 23:24:05,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {1168#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1170#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} is VALID [2022-02-20 23:24:05,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {1170#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1171#(= |ULTIMATE.start_main_#t~mem7#1| 0)} is VALID [2022-02-20 23:24:05,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {1171#(= |ULTIMATE.start_main_#t~mem7#1| 0)} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {1169#false} is VALID [2022-02-20 23:24:05,649 INFO L290 TraceCheckUtils]: 4: Hoare triple {1169#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1169#false} is VALID [2022-02-20 23:24:05,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {1169#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1169#false} is VALID [2022-02-20 23:24:05,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {1169#false} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {1169#false} is VALID [2022-02-20 23:24:05,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {1169#false} havoc main_~_hf_hashv~0#1; {1169#false} is VALID [2022-02-20 23:24:05,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {1169#false} goto; {1169#false} is VALID [2022-02-20 23:24:05,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {1169#false} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {1169#false} is VALID [2022-02-20 23:24:05,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {1169#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {1169#false} is VALID [2022-02-20 23:24:05,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {1169#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {1169#false} is VALID [2022-02-20 23:24:05,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {1169#false} assume !main_#t~switch158#1; {1169#false} is VALID [2022-02-20 23:24:05,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {1169#false} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {1169#false} is VALID [2022-02-20 23:24:05,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {1169#false} assume main_#t~switch158#1;call main_#t~mem160#1 := read~int(main_~_hj_key~1#1.base, 9 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 65536 * (main_#t~mem160#1 % 256);havoc main_#t~mem160#1; {1169#false} is VALID [2022-02-20 23:24:05,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {1169#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {1169#false} is VALID [2022-02-20 23:24:05,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {1169#false} assume main_#t~switch158#1;call main_#t~mem161#1 := read~int(main_~_hj_key~1#1.base, 8 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 256 * (main_#t~mem161#1 % 256);havoc main_#t~mem161#1; {1169#false} is VALID [2022-02-20 23:24:05,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {1169#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {1169#false} is VALID [2022-02-20 23:24:05,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {1169#false} assume main_#t~switch158#1;call main_#t~mem162#1 := read~int(main_~_hj_key~1#1.base, 7 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 16777216 * (main_#t~mem162#1 % 256);havoc main_#t~mem162#1; {1169#false} is VALID [2022-02-20 23:24:05,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {1169#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {1169#false} is VALID [2022-02-20 23:24:05,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {1169#false} assume main_#t~switch158#1;call main_#t~mem163#1 := read~int(main_~_hj_key~1#1.base, 6 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 65536 * (main_#t~mem163#1 % 256);havoc main_#t~mem163#1; {1169#false} is VALID [2022-02-20 23:24:05,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {1169#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {1169#false} is VALID [2022-02-20 23:24:05,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {1169#false} assume main_#t~switch158#1;call main_#t~mem164#1 := read~int(main_~_hj_key~1#1.base, 5 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 256 * (main_#t~mem164#1 % 256);havoc main_#t~mem164#1; {1169#false} is VALID [2022-02-20 23:24:05,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {1169#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {1169#false} is VALID [2022-02-20 23:24:05,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {1169#false} assume main_#t~switch158#1;call main_#t~mem165#1 := read~int(main_~_hj_key~1#1.base, 4 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + main_#t~mem165#1 % 256;havoc main_#t~mem165#1; {1169#false} is VALID [2022-02-20 23:24:05,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {1169#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {1169#false} is VALID [2022-02-20 23:24:05,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {1169#false} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {1169#false} is VALID [2022-02-20 23:24:05,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {1169#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {1169#false} is VALID [2022-02-20 23:24:05,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {1169#false} assume main_#t~switch158#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem167#1 % 256);havoc main_#t~mem167#1; {1169#false} is VALID [2022-02-20 23:24:05,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {1169#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {1169#false} is VALID [2022-02-20 23:24:05,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {1169#false} assume !main_#t~switch158#1; {1169#false} is VALID [2022-02-20 23:24:05,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {1169#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {1169#false} is VALID [2022-02-20 23:24:05,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {1169#false} assume main_#t~switch158#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem169#1 % 256;havoc main_#t~mem169#1; {1169#false} is VALID [2022-02-20 23:24:05,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {1169#false} havoc main_#t~switch158#1; {1169#false} is VALID [2022-02-20 23:24:05,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {1169#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {1169#false} is VALID [2022-02-20 23:24:05,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {1169#false} goto; {1169#false} is VALID [2022-02-20 23:24:05,655 INFO L290 TraceCheckUtils]: 36: Hoare triple {1169#false} goto; {1169#false} is VALID [2022-02-20 23:24:05,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {1169#false} goto; {1169#false} is VALID [2022-02-20 23:24:05,656 INFO L290 TraceCheckUtils]: 38: Hoare triple {1169#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {1169#false} is VALID [2022-02-20 23:24:05,656 INFO L290 TraceCheckUtils]: 39: Hoare triple {1169#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {1169#false} is VALID [2022-02-20 23:24:05,656 INFO L290 TraceCheckUtils]: 40: Hoare triple {1169#false} goto; {1169#false} is VALID [2022-02-20 23:24:05,656 INFO L290 TraceCheckUtils]: 41: Hoare triple {1169#false} goto; {1169#false} is VALID [2022-02-20 23:24:05,656 INFO L290 TraceCheckUtils]: 42: Hoare triple {1169#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {1169#false} is VALID [2022-02-20 23:24:05,657 INFO L290 TraceCheckUtils]: 43: Hoare triple {1169#false} assume !false; {1169#false} is VALID [2022-02-20 23:24:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:24:05,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:05,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037044667] [2022-02-20 23:24:05,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037044667] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:05,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:05,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:24:05,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360614043] [2022-02-20 23:24:05,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:05,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2022-02-20 23:24:05,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:05,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:05,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:05,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:24:05,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:05,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:24:05,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:24:05,689 INFO L87 Difference]: Start difference. First operand 173 states and 229 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:06,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:06,773 INFO L93 Difference]: Finished difference Result 363 states and 489 transitions. [2022-02-20 23:24:06,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:24:06,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 44 [2022-02-20 23:24:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-02-20 23:24:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-02-20 23:24:06,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-02-20 23:24:07,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:07,161 INFO L225 Difference]: With dead ends: 363 [2022-02-20 23:24:07,161 INFO L226 Difference]: Without dead ends: 284 [2022-02-20 23:24:07,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:24:07,168 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 138 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:24:07,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 548 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:24:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-02-20 23:24:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 175. [2022-02-20 23:24:07,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:07,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 284 states. Second operand has 175 states, 163 states have (on average 1.3190184049079754) internal successors, (215), 169 states have internal predecessors, (215), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:07,191 INFO L74 IsIncluded]: Start isIncluded. First operand 284 states. Second operand has 175 states, 163 states have (on average 1.3190184049079754) internal successors, (215), 169 states have internal predecessors, (215), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:07,192 INFO L87 Difference]: Start difference. First operand 284 states. Second operand has 175 states, 163 states have (on average 1.3190184049079754) internal successors, (215), 169 states have internal predecessors, (215), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:07,201 INFO L93 Difference]: Finished difference Result 284 states and 381 transitions. [2022-02-20 23:24:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 381 transitions. [2022-02-20 23:24:07,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:07,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:07,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 163 states have (on average 1.3190184049079754) internal successors, (215), 169 states have internal predecessors, (215), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 284 states. [2022-02-20 23:24:07,204 INFO L87 Difference]: Start difference. First operand has 175 states, 163 states have (on average 1.3190184049079754) internal successors, (215), 169 states have internal predecessors, (215), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 284 states. [2022-02-20 23:24:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:07,214 INFO L93 Difference]: Finished difference Result 284 states and 381 transitions. [2022-02-20 23:24:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 381 transitions. [2022-02-20 23:24:07,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:07,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:07,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:07,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 163 states have (on average 1.3190184049079754) internal successors, (215), 169 states have internal predecessors, (215), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 231 transitions. [2022-02-20 23:24:07,219 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 231 transitions. Word has length 44 [2022-02-20 23:24:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:07,220 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 231 transitions. [2022-02-20 23:24:07,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 231 transitions. [2022-02-20 23:24:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 23:24:07,223 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:07,223 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:24:07,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:24:07,223 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:07,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:07,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1509402797, now seen corresponding path program 1 times [2022-02-20 23:24:07,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:07,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594372143] [2022-02-20 23:24:07,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:07,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:07,332 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:07,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449319031] [2022-02-20 23:24:07,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:07,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:07,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:07,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:24:07,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:24:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:07,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 1649 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:24:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:07,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:08,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {2399#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; {2399#true} is VALID [2022-02-20 23:24:08,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {2399#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2399#true} is VALID [2022-02-20 23:24:08,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {2399#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2399#true} is VALID [2022-02-20 23:24:08,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {2399#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {2399#true} is VALID [2022-02-20 23:24:08,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {2399#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {2399#true} is VALID [2022-02-20 23:24:08,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {2399#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {2399#true} is VALID [2022-02-20 23:24:08,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {2399#true} havoc main_~_ha_hashv~0#1; {2399#true} is VALID [2022-02-20 23:24:08,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {2399#true} goto; {2399#true} is VALID [2022-02-20 23:24:08,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {2399#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; {2399#true} is VALID [2022-02-20 23:24:08,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {2399#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {2399#true} is VALID [2022-02-20 23:24:08,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {2399#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {2399#true} is VALID [2022-02-20 23:24:08,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {2399#true} assume main_#t~switch24#1;call main_#t~mem25#1 := read~int(main_~_hj_key~0#1.base, 10 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 16777216 * (main_#t~mem25#1 % 256);havoc main_#t~mem25#1; {2399#true} is VALID [2022-02-20 23:24:08,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {2399#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {2399#true} is VALID [2022-02-20 23:24:08,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {2399#true} assume main_#t~switch24#1;call main_#t~mem26#1 := read~int(main_~_hj_key~0#1.base, 9 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 65536 * (main_#t~mem26#1 % 256);havoc main_#t~mem26#1; {2399#true} is VALID [2022-02-20 23:24:08,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {2399#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {2399#true} is VALID [2022-02-20 23:24:08,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {2399#true} assume main_#t~switch24#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 8 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 256 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {2399#true} is VALID [2022-02-20 23:24:08,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {2399#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {2399#true} is VALID [2022-02-20 23:24:08,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {2399#true} assume main_#t~switch24#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 7 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 16777216 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {2455#|ULTIMATE.start_main_#t~switch24#1|} is VALID [2022-02-20 23:24:08,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {2455#|ULTIMATE.start_main_#t~switch24#1|} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {2455#|ULTIMATE.start_main_#t~switch24#1|} is VALID [2022-02-20 23:24:08,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {2455#|ULTIMATE.start_main_#t~switch24#1|} assume !main_#t~switch24#1; {2400#false} is VALID [2022-02-20 23:24:08,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {2400#false} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {2400#false} is VALID [2022-02-20 23:24:08,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {2400#false} assume main_#t~switch24#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, 5 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 256 * (main_#t~mem30#1 % 256);havoc main_#t~mem30#1; {2400#false} is VALID [2022-02-20 23:24:08,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {2400#false} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {2400#false} is VALID [2022-02-20 23:24:08,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {2400#false} assume main_#t~switch24#1;call main_#t~mem31#1 := read~int(main_~_hj_key~0#1.base, 4 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + main_#t~mem31#1 % 256;havoc main_#t~mem31#1; {2400#false} is VALID [2022-02-20 23:24:08,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {2400#false} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {2400#false} is VALID [2022-02-20 23:24:08,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {2400#false} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {2400#false} is VALID [2022-02-20 23:24:08,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {2400#false} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {2400#false} is VALID [2022-02-20 23:24:08,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {2400#false} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {2400#false} is VALID [2022-02-20 23:24:08,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {2400#false} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {2400#false} is VALID [2022-02-20 23:24:08,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {2400#false} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {2400#false} is VALID [2022-02-20 23:24:08,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {2400#false} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {2400#false} is VALID [2022-02-20 23:24:08,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {2400#false} assume main_#t~switch24#1;call main_#t~mem35#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem35#1 % 256;havoc main_#t~mem35#1; {2400#false} is VALID [2022-02-20 23:24:08,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {2400#false} havoc main_#t~switch24#1; {2400#false} is VALID [2022-02-20 23:24:08,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {2400#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)))); {2400#false} is VALID [2022-02-20 23:24:08,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {2400#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); {2400#false} is VALID [2022-02-20 23:24:08,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {2400#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {2400#false} is VALID [2022-02-20 23:24:08,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {2400#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {2400#false} is VALID [2022-02-20 23:24:08,101 INFO L290 TraceCheckUtils]: 40: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {2400#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {2400#false} is VALID [2022-02-20 23:24:08,102 INFO L290 TraceCheckUtils]: 42: Hoare triple {2400#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {2400#false} is VALID [2022-02-20 23:24:08,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {2400#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {2400#false} is VALID [2022-02-20 23:24:08,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {2400#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {2400#false} is VALID [2022-02-20 23:24:08,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {2400#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {2400#false} is VALID [2022-02-20 23:24:08,115 INFO L290 TraceCheckUtils]: 47: Hoare triple {2400#false} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {2400#false} is VALID [2022-02-20 23:24:08,115 INFO L290 TraceCheckUtils]: 48: Hoare triple {2400#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {2400#false} is VALID [2022-02-20 23:24:08,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,115 INFO L290 TraceCheckUtils]: 50: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,115 INFO L290 TraceCheckUtils]: 51: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,115 INFO L290 TraceCheckUtils]: 52: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,116 INFO L290 TraceCheckUtils]: 53: Hoare triple {2400#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {2400#false} is VALID [2022-02-20 23:24:08,116 INFO L290 TraceCheckUtils]: 54: Hoare triple {2400#false} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2400#false} is VALID [2022-02-20 23:24:08,116 INFO L290 TraceCheckUtils]: 55: Hoare triple {2400#false} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {2400#false} is VALID [2022-02-20 23:24:08,116 INFO L290 TraceCheckUtils]: 56: Hoare triple {2400#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2400#false} is VALID [2022-02-20 23:24:08,116 INFO L290 TraceCheckUtils]: 57: Hoare triple {2400#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2400#false} is VALID [2022-02-20 23:24:08,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {2400#false} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {2400#false} is VALID [2022-02-20 23:24:08,117 INFO L290 TraceCheckUtils]: 59: Hoare triple {2400#false} havoc main_~_hf_hashv~0#1; {2400#false} is VALID [2022-02-20 23:24:08,117 INFO L290 TraceCheckUtils]: 60: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {2400#false} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {2400#false} is VALID [2022-02-20 23:24:08,117 INFO L290 TraceCheckUtils]: 62: Hoare triple {2400#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {2400#false} is VALID [2022-02-20 23:24:08,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {2400#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {2400#false} is VALID [2022-02-20 23:24:08,118 INFO L290 TraceCheckUtils]: 64: Hoare triple {2400#false} assume !main_#t~switch158#1; {2400#false} is VALID [2022-02-20 23:24:08,118 INFO L290 TraceCheckUtils]: 65: Hoare triple {2400#false} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {2400#false} is VALID [2022-02-20 23:24:08,118 INFO L290 TraceCheckUtils]: 66: Hoare triple {2400#false} assume main_#t~switch158#1;call main_#t~mem160#1 := read~int(main_~_hj_key~1#1.base, 9 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 65536 * (main_#t~mem160#1 % 256);havoc main_#t~mem160#1; {2400#false} is VALID [2022-02-20 23:24:08,118 INFO L290 TraceCheckUtils]: 67: Hoare triple {2400#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {2400#false} is VALID [2022-02-20 23:24:08,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {2400#false} assume main_#t~switch158#1;call main_#t~mem161#1 := read~int(main_~_hj_key~1#1.base, 8 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 256 * (main_#t~mem161#1 % 256);havoc main_#t~mem161#1; {2400#false} is VALID [2022-02-20 23:24:08,118 INFO L290 TraceCheckUtils]: 69: Hoare triple {2400#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {2400#false} is VALID [2022-02-20 23:24:08,119 INFO L290 TraceCheckUtils]: 70: Hoare triple {2400#false} assume main_#t~switch158#1;call main_#t~mem162#1 := read~int(main_~_hj_key~1#1.base, 7 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 16777216 * (main_#t~mem162#1 % 256);havoc main_#t~mem162#1; {2400#false} is VALID [2022-02-20 23:24:08,119 INFO L290 TraceCheckUtils]: 71: Hoare triple {2400#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {2400#false} is VALID [2022-02-20 23:24:08,119 INFO L290 TraceCheckUtils]: 72: Hoare triple {2400#false} assume main_#t~switch158#1;call main_#t~mem163#1 := read~int(main_~_hj_key~1#1.base, 6 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 65536 * (main_#t~mem163#1 % 256);havoc main_#t~mem163#1; {2400#false} is VALID [2022-02-20 23:24:08,119 INFO L290 TraceCheckUtils]: 73: Hoare triple {2400#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {2400#false} is VALID [2022-02-20 23:24:08,119 INFO L290 TraceCheckUtils]: 74: Hoare triple {2400#false} assume main_#t~switch158#1;call main_#t~mem164#1 := read~int(main_~_hj_key~1#1.base, 5 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 256 * (main_#t~mem164#1 % 256);havoc main_#t~mem164#1; {2400#false} is VALID [2022-02-20 23:24:08,119 INFO L290 TraceCheckUtils]: 75: Hoare triple {2400#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {2400#false} is VALID [2022-02-20 23:24:08,120 INFO L290 TraceCheckUtils]: 76: Hoare triple {2400#false} assume main_#t~switch158#1;call main_#t~mem165#1 := read~int(main_~_hj_key~1#1.base, 4 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + main_#t~mem165#1 % 256;havoc main_#t~mem165#1; {2400#false} is VALID [2022-02-20 23:24:08,120 INFO L290 TraceCheckUtils]: 77: Hoare triple {2400#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {2400#false} is VALID [2022-02-20 23:24:08,120 INFO L290 TraceCheckUtils]: 78: Hoare triple {2400#false} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {2400#false} is VALID [2022-02-20 23:24:08,120 INFO L290 TraceCheckUtils]: 79: Hoare triple {2400#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {2400#false} is VALID [2022-02-20 23:24:08,120 INFO L290 TraceCheckUtils]: 80: Hoare triple {2400#false} assume main_#t~switch158#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem167#1 % 256);havoc main_#t~mem167#1; {2400#false} is VALID [2022-02-20 23:24:08,120 INFO L290 TraceCheckUtils]: 81: Hoare triple {2400#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {2400#false} is VALID [2022-02-20 23:24:08,121 INFO L290 TraceCheckUtils]: 82: Hoare triple {2400#false} assume !main_#t~switch158#1; {2400#false} is VALID [2022-02-20 23:24:08,121 INFO L290 TraceCheckUtils]: 83: Hoare triple {2400#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {2400#false} is VALID [2022-02-20 23:24:08,121 INFO L290 TraceCheckUtils]: 84: Hoare triple {2400#false} assume main_#t~switch158#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem169#1 % 256;havoc main_#t~mem169#1; {2400#false} is VALID [2022-02-20 23:24:08,121 INFO L290 TraceCheckUtils]: 85: Hoare triple {2400#false} havoc main_#t~switch158#1; {2400#false} is VALID [2022-02-20 23:24:08,121 INFO L290 TraceCheckUtils]: 86: Hoare triple {2400#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {2400#false} is VALID [2022-02-20 23:24:08,122 INFO L290 TraceCheckUtils]: 87: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,122 INFO L290 TraceCheckUtils]: 88: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,122 INFO L290 TraceCheckUtils]: 89: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,122 INFO L290 TraceCheckUtils]: 90: Hoare triple {2400#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {2400#false} is VALID [2022-02-20 23:24:08,122 INFO L290 TraceCheckUtils]: 91: Hoare triple {2400#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {2400#false} is VALID [2022-02-20 23:24:08,122 INFO L290 TraceCheckUtils]: 92: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,123 INFO L290 TraceCheckUtils]: 93: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:24:08,123 INFO L290 TraceCheckUtils]: 94: Hoare triple {2400#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {2400#false} is VALID [2022-02-20 23:24:08,123 INFO L290 TraceCheckUtils]: 95: Hoare triple {2400#false} assume !false; {2400#false} is VALID [2022-02-20 23:24:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:24:08,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:08,124 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:08,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594372143] [2022-02-20 23:24:08,124 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:08,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449319031] [2022-02-20 23:24:08,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449319031] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:08,125 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:08,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:24:08,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480349683] [2022-02-20 23:24:08,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:08,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2022-02-20 23:24:08,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:08,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:08,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:08,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:24:08,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:08,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:24:08,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:24:08,188 INFO L87 Difference]: Start difference. First operand 175 states and 231 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:08,637 INFO L93 Difference]: Finished difference Result 367 states and 489 transitions. [2022-02-20 23:24:08,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:24:08,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2022-02-20 23:24:08,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:08,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2022-02-20 23:24:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:08,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2022-02-20 23:24:08,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 487 transitions. [2022-02-20 23:24:09,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:09,006 INFO L225 Difference]: With dead ends: 367 [2022-02-20 23:24:09,006 INFO L226 Difference]: Without dead ends: 196 [2022-02-20 23:24:09,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:24:09,007 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 9 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:24:09,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 403 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:24:09,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-02-20 23:24:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2022-02-20 23:24:09,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:09,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 195 states, 183 states have (on average 1.284153005464481) internal successors, (235), 189 states have internal predecessors, (235), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:09,014 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 195 states, 183 states have (on average 1.284153005464481) internal successors, (235), 189 states have internal predecessors, (235), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:09,015 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 195 states, 183 states have (on average 1.284153005464481) internal successors, (235), 189 states have internal predecessors, (235), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:09,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:09,019 INFO L93 Difference]: Finished difference Result 196 states and 252 transitions. [2022-02-20 23:24:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 252 transitions. [2022-02-20 23:24:09,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:09,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:09,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 183 states have (on average 1.284153005464481) internal successors, (235), 189 states have internal predecessors, (235), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 196 states. [2022-02-20 23:24:09,021 INFO L87 Difference]: Start difference. First operand has 195 states, 183 states have (on average 1.284153005464481) internal successors, (235), 189 states have internal predecessors, (235), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 196 states. [2022-02-20 23:24:09,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:09,025 INFO L93 Difference]: Finished difference Result 196 states and 252 transitions. [2022-02-20 23:24:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 252 transitions. [2022-02-20 23:24:09,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:09,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:09,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:09,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 183 states have (on average 1.284153005464481) internal successors, (235), 189 states have internal predecessors, (235), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 251 transitions. [2022-02-20 23:24:09,033 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 251 transitions. Word has length 96 [2022-02-20 23:24:09,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:09,033 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 251 transitions. [2022-02-20 23:24:09,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 251 transitions. [2022-02-20 23:24:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 23:24:09,034 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:09,034 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:24:09,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:24:09,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:09,248 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:09,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1482337195, now seen corresponding path program 1 times [2022-02-20 23:24:09,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:09,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878112828] [2022-02-20 23:24:09,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:09,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:09,345 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:09,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1967774406] [2022-02-20 23:24:09,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:09,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:09,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:09,347 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:24:09,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:24:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:09,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:24:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:09,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:10,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {3756#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; {3756#true} is VALID [2022-02-20 23:24:10,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {3756#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3756#true} is VALID [2022-02-20 23:24:10,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {3756#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3756#true} is VALID [2022-02-20 23:24:10,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {3756#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {3756#true} is VALID [2022-02-20 23:24:10,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {3756#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {3756#true} is VALID [2022-02-20 23:24:10,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {3756#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {3756#true} is VALID [2022-02-20 23:24:10,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {3756#true} havoc main_~_ha_hashv~0#1; {3756#true} is VALID [2022-02-20 23:24:10,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:24:10,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {3756#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; {3756#true} is VALID [2022-02-20 23:24:10,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {3756#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {3756#true} is VALID [2022-02-20 23:24:10,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {3756#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {3756#true} is VALID [2022-02-20 23:24:10,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {3756#true} assume main_#t~switch24#1;call main_#t~mem25#1 := read~int(main_~_hj_key~0#1.base, 10 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 16777216 * (main_#t~mem25#1 % 256);havoc main_#t~mem25#1; {3756#true} is VALID [2022-02-20 23:24:10,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {3756#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {3756#true} is VALID [2022-02-20 23:24:10,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {3756#true} assume main_#t~switch24#1;call main_#t~mem26#1 := read~int(main_~_hj_key~0#1.base, 9 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 65536 * (main_#t~mem26#1 % 256);havoc main_#t~mem26#1; {3756#true} is VALID [2022-02-20 23:24:10,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {3756#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {3756#true} is VALID [2022-02-20 23:24:10,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {3756#true} assume main_#t~switch24#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 8 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 256 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {3756#true} is VALID [2022-02-20 23:24:10,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {3756#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {3756#true} is VALID [2022-02-20 23:24:10,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {3756#true} assume main_#t~switch24#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 7 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 16777216 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {3756#true} is VALID [2022-02-20 23:24:10,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {3756#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {3756#true} is VALID [2022-02-20 23:24:10,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {3756#true} assume main_#t~switch24#1;call main_#t~mem29#1 := read~int(main_~_hj_key~0#1.base, 6 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 65536 * (main_#t~mem29#1 % 256);havoc main_#t~mem29#1; {3756#true} is VALID [2022-02-20 23:24:10,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {3756#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {3756#true} is VALID [2022-02-20 23:24:10,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {3756#true} assume main_#t~switch24#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, 5 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 256 * (main_#t~mem30#1 % 256);havoc main_#t~mem30#1; {3756#true} is VALID [2022-02-20 23:24:10,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {3756#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {3756#true} is VALID [2022-02-20 23:24:10,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {3756#true} assume main_#t~switch24#1;call main_#t~mem31#1 := read~int(main_~_hj_key~0#1.base, 4 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + main_#t~mem31#1 % 256;havoc main_#t~mem31#1; {3756#true} is VALID [2022-02-20 23:24:10,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {3756#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {3756#true} is VALID [2022-02-20 23:24:10,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {3756#true} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {3756#true} is VALID [2022-02-20 23:24:10,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {3756#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {3756#true} is VALID [2022-02-20 23:24:10,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {3756#true} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {3756#true} is VALID [2022-02-20 23:24:10,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {3756#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {3756#true} is VALID [2022-02-20 23:24:10,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {3756#true} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {3756#true} is VALID [2022-02-20 23:24:10,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {3756#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {3756#true} is VALID [2022-02-20 23:24:10,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {3756#true} assume main_#t~switch24#1;call main_#t~mem35#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem35#1 % 256;havoc main_#t~mem35#1; {3756#true} is VALID [2022-02-20 23:24:10,134 INFO L290 TraceCheckUtils]: 32: Hoare triple {3756#true} havoc main_#t~switch24#1; {3756#true} is VALID [2022-02-20 23:24:10,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {3756#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)))); {3756#true} is VALID [2022-02-20 23:24:10,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:24:10,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:24:10,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:24:10,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {3756#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); {3756#true} is VALID [2022-02-20 23:24:10,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {3756#true} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {3756#true} is VALID [2022-02-20 23:24:10,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {3756#true} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {3756#true} is VALID [2022-02-20 23:24:10,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:24:10,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {3756#true} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {3756#true} is VALID [2022-02-20 23:24:10,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {3756#true} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {3756#true} is VALID [2022-02-20 23:24:10,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:24:10,135 INFO L290 TraceCheckUtils]: 44: Hoare triple {3756#true} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {3756#true} is VALID [2022-02-20 23:24:10,136 INFO L290 TraceCheckUtils]: 45: Hoare triple {3756#true} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {3756#true} is VALID [2022-02-20 23:24:10,136 INFO L290 TraceCheckUtils]: 46: Hoare triple {3756#true} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {3756#true} is VALID [2022-02-20 23:24:10,136 INFO L290 TraceCheckUtils]: 47: Hoare triple {3756#true} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {3756#true} is VALID [2022-02-20 23:24:10,136 INFO L290 TraceCheckUtils]: 48: Hoare triple {3756#true} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {3756#true} is VALID [2022-02-20 23:24:10,136 INFO L290 TraceCheckUtils]: 49: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:24:10,136 INFO L290 TraceCheckUtils]: 50: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:24:10,137 INFO L290 TraceCheckUtils]: 51: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:24:10,137 INFO L290 TraceCheckUtils]: 52: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:24:10,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {3756#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {3756#true} is VALID [2022-02-20 23:24:10,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {3756#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3756#true} is VALID [2022-02-20 23:24:10,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {3756#true} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {3756#true} is VALID [2022-02-20 23:24:10,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {3756#true} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3756#true} is VALID [2022-02-20 23:24:10,137 INFO L290 TraceCheckUtils]: 57: Hoare triple {3756#true} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3756#true} is VALID [2022-02-20 23:24:10,138 INFO L290 TraceCheckUtils]: 58: Hoare triple {3756#true} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {3756#true} is VALID [2022-02-20 23:24:10,138 INFO L290 TraceCheckUtils]: 59: Hoare triple {3756#true} havoc main_~_hf_hashv~0#1; {3756#true} is VALID [2022-02-20 23:24:10,138 INFO L290 TraceCheckUtils]: 60: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:24:10,138 INFO L290 TraceCheckUtils]: 61: Hoare triple {3756#true} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {3756#true} is VALID [2022-02-20 23:24:10,138 INFO L290 TraceCheckUtils]: 62: Hoare triple {3756#true} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {3756#true} is VALID [2022-02-20 23:24:10,138 INFO L290 TraceCheckUtils]: 63: Hoare triple {3756#true} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {3756#true} is VALID [2022-02-20 23:24:10,138 INFO L290 TraceCheckUtils]: 64: Hoare triple {3756#true} assume !main_#t~switch158#1; {3756#true} is VALID [2022-02-20 23:24:10,139 INFO L290 TraceCheckUtils]: 65: Hoare triple {3756#true} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {3756#true} is VALID [2022-02-20 23:24:10,139 INFO L290 TraceCheckUtils]: 66: Hoare triple {3756#true} assume main_#t~switch158#1;call main_#t~mem160#1 := read~int(main_~_hj_key~1#1.base, 9 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 65536 * (main_#t~mem160#1 % 256);havoc main_#t~mem160#1; {3756#true} is VALID [2022-02-20 23:24:10,139 INFO L290 TraceCheckUtils]: 67: Hoare triple {3756#true} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {3756#true} is VALID [2022-02-20 23:24:10,139 INFO L290 TraceCheckUtils]: 68: Hoare triple {3756#true} assume main_#t~switch158#1;call main_#t~mem161#1 := read~int(main_~_hj_key~1#1.base, 8 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 256 * (main_#t~mem161#1 % 256);havoc main_#t~mem161#1; {3756#true} is VALID [2022-02-20 23:24:10,139 INFO L290 TraceCheckUtils]: 69: Hoare triple {3756#true} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {3756#true} is VALID [2022-02-20 23:24:10,139 INFO L290 TraceCheckUtils]: 70: Hoare triple {3756#true} assume main_#t~switch158#1;call main_#t~mem162#1 := read~int(main_~_hj_key~1#1.base, 7 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 16777216 * (main_#t~mem162#1 % 256);havoc main_#t~mem162#1; {3756#true} is VALID [2022-02-20 23:24:10,139 INFO L290 TraceCheckUtils]: 71: Hoare triple {3756#true} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {3756#true} is VALID [2022-02-20 23:24:10,140 INFO L290 TraceCheckUtils]: 72: Hoare triple {3756#true} assume main_#t~switch158#1;call main_#t~mem163#1 := read~int(main_~_hj_key~1#1.base, 6 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 65536 * (main_#t~mem163#1 % 256);havoc main_#t~mem163#1; {3756#true} is VALID [2022-02-20 23:24:10,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {3756#true} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {3756#true} is VALID [2022-02-20 23:24:10,140 INFO L290 TraceCheckUtils]: 74: Hoare triple {3756#true} assume main_#t~switch158#1;call main_#t~mem164#1 := read~int(main_~_hj_key~1#1.base, 5 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 256 * (main_#t~mem164#1 % 256);havoc main_#t~mem164#1; {3756#true} is VALID [2022-02-20 23:24:10,140 INFO L290 TraceCheckUtils]: 75: Hoare triple {3756#true} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {3756#true} is VALID [2022-02-20 23:24:10,140 INFO L290 TraceCheckUtils]: 76: Hoare triple {3756#true} assume main_#t~switch158#1;call main_#t~mem165#1 := read~int(main_~_hj_key~1#1.base, 4 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + main_#t~mem165#1 % 256;havoc main_#t~mem165#1; {3756#true} is VALID [2022-02-20 23:24:10,140 INFO L290 TraceCheckUtils]: 77: Hoare triple {3756#true} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {3756#true} is VALID [2022-02-20 23:24:10,140 INFO L290 TraceCheckUtils]: 78: Hoare triple {3756#true} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {3756#true} is VALID [2022-02-20 23:24:10,141 INFO L290 TraceCheckUtils]: 79: Hoare triple {3756#true} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {3756#true} is VALID [2022-02-20 23:24:10,141 INFO L290 TraceCheckUtils]: 80: Hoare triple {3756#true} assume main_#t~switch158#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem167#1 % 256);havoc main_#t~mem167#1; {4001#|ULTIMATE.start_main_#t~switch158#1|} is VALID [2022-02-20 23:24:10,142 INFO L290 TraceCheckUtils]: 81: Hoare triple {4001#|ULTIMATE.start_main_#t~switch158#1|} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {4001#|ULTIMATE.start_main_#t~switch158#1|} is VALID [2022-02-20 23:24:10,142 INFO L290 TraceCheckUtils]: 82: Hoare triple {4001#|ULTIMATE.start_main_#t~switch158#1|} assume !main_#t~switch158#1; {3757#false} is VALID [2022-02-20 23:24:10,142 INFO L290 TraceCheckUtils]: 83: Hoare triple {3757#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {3757#false} is VALID [2022-02-20 23:24:10,142 INFO L290 TraceCheckUtils]: 84: Hoare triple {3757#false} assume main_#t~switch158#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem169#1 % 256;havoc main_#t~mem169#1; {3757#false} is VALID [2022-02-20 23:24:10,142 INFO L290 TraceCheckUtils]: 85: Hoare triple {3757#false} havoc main_#t~switch158#1; {3757#false} is VALID [2022-02-20 23:24:10,142 INFO L290 TraceCheckUtils]: 86: Hoare triple {3757#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {3757#false} is VALID [2022-02-20 23:24:10,143 INFO L290 TraceCheckUtils]: 87: Hoare triple {3757#false} goto; {3757#false} is VALID [2022-02-20 23:24:10,143 INFO L290 TraceCheckUtils]: 88: Hoare triple {3757#false} goto; {3757#false} is VALID [2022-02-20 23:24:10,143 INFO L290 TraceCheckUtils]: 89: Hoare triple {3757#false} goto; {3757#false} is VALID [2022-02-20 23:24:10,143 INFO L290 TraceCheckUtils]: 90: Hoare triple {3757#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {3757#false} is VALID [2022-02-20 23:24:10,143 INFO L290 TraceCheckUtils]: 91: Hoare triple {3757#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {3757#false} is VALID [2022-02-20 23:24:10,143 INFO L290 TraceCheckUtils]: 92: Hoare triple {3757#false} goto; {3757#false} is VALID [2022-02-20 23:24:10,144 INFO L290 TraceCheckUtils]: 93: Hoare triple {3757#false} goto; {3757#false} is VALID [2022-02-20 23:24:10,144 INFO L290 TraceCheckUtils]: 94: Hoare triple {3757#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {3757#false} is VALID [2022-02-20 23:24:10,144 INFO L290 TraceCheckUtils]: 95: Hoare triple {3757#false} assume !false; {3757#false} is VALID [2022-02-20 23:24:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:24:10,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:10,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:10,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878112828] [2022-02-20 23:24:10,145 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:10,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967774406] [2022-02-20 23:24:10,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967774406] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:10,145 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:10,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:24:10,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088331273] [2022-02-20 23:24:10,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:10,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 96 [2022-02-20 23:24:10,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:10,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:10,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:10,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:24:10,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:10,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:24:10,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:24:10,212 INFO L87 Difference]: Start difference. First operand 195 states and 251 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:10,708 INFO L93 Difference]: Finished difference Result 294 states and 388 transitions. [2022-02-20 23:24:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:24:10,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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 96 [2022-02-20 23:24:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:10,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-02-20 23:24:10,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:10,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-02-20 23:24:10,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 366 transitions. [2022-02-20 23:24:11,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 366 edges. 366 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:11,036 INFO L225 Difference]: With dead ends: 294 [2022-02-20 23:24:11,036 INFO L226 Difference]: Without dead ends: 216 [2022-02-20 23:24:11,036 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:24:11,037 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 8 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:24:11,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 405 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:24:11,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-02-20 23:24:11,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2022-02-20 23:24:11,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:11,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 215 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 209 states have internal predecessors, (255), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:11,043 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 215 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 209 states have internal predecessors, (255), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:11,043 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 215 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 209 states have internal predecessors, (255), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:11,047 INFO L93 Difference]: Finished difference Result 216 states and 272 transitions. [2022-02-20 23:24:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 272 transitions. [2022-02-20 23:24:11,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:11,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:11,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 215 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 209 states have internal predecessors, (255), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 216 states. [2022-02-20 23:24:11,049 INFO L87 Difference]: Start difference. First operand has 215 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 209 states have internal predecessors, (255), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 216 states. [2022-02-20 23:24:11,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:11,052 INFO L93 Difference]: Finished difference Result 216 states and 272 transitions. [2022-02-20 23:24:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 272 transitions. [2022-02-20 23:24:11,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:11,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:11,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:11,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 209 states have internal predecessors, (255), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 271 transitions. [2022-02-20 23:24:11,057 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 271 transitions. Word has length 96 [2022-02-20 23:24:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:11,057 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 271 transitions. [2022-02-20 23:24:11,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:11,057 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 271 transitions. [2022-02-20 23:24:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 23:24:11,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:11,058 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:24:11,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:24:11,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 23:24:11,281 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:11,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:11,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1801512851, now seen corresponding path program 1 times [2022-02-20 23:24:11,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:11,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515205833] [2022-02-20 23:24:11,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:11,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:11,380 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:11,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417065876] [2022-02-20 23:24:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:11,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:11,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:11,381 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:24:11,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:24:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:11,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:24:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:11,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:12,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {5081#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; {5081#true} is VALID [2022-02-20 23:24:12,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {5081#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5081#true} is VALID [2022-02-20 23:24:12,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {5081#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5081#true} is VALID [2022-02-20 23:24:12,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {5081#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {5081#true} is VALID [2022-02-20 23:24:12,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {5081#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {5081#true} is VALID [2022-02-20 23:24:12,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {5081#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {5081#true} is VALID [2022-02-20 23:24:12,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {5081#true} havoc main_~_ha_hashv~0#1; {5081#true} is VALID [2022-02-20 23:24:12,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {5081#true} goto; {5081#true} is VALID [2022-02-20 23:24:12,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {5081#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; {5110#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-20 23:24:12,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {5110#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {5110#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-20 23:24:12,218 INFO L290 TraceCheckUtils]: 10: Hoare triple {5110#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {5117#(not |ULTIMATE.start_main_#t~switch24#1|)} is VALID [2022-02-20 23:24:12,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {5117#(not |ULTIMATE.start_main_#t~switch24#1|)} assume main_#t~switch24#1;call main_#t~mem25#1 := read~int(main_~_hj_key~0#1.base, 10 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 16777216 * (main_#t~mem25#1 % 256);havoc main_#t~mem25#1; {5082#false} is VALID [2022-02-20 23:24:12,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {5082#false} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {5082#false} is VALID [2022-02-20 23:24:12,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {5082#false} assume main_#t~switch24#1;call main_#t~mem26#1 := read~int(main_~_hj_key~0#1.base, 9 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 65536 * (main_#t~mem26#1 % 256);havoc main_#t~mem26#1; {5082#false} is VALID [2022-02-20 23:24:12,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {5082#false} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {5082#false} is VALID [2022-02-20 23:24:12,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {5082#false} assume main_#t~switch24#1;call main_#t~mem27#1 := read~int(main_~_hj_key~0#1.base, 8 + main_~_hj_key~0#1.offset, 1);main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 + 256 * (main_#t~mem27#1 % 256);havoc main_#t~mem27#1; {5082#false} is VALID [2022-02-20 23:24:12,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {5082#false} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {5082#false} is VALID [2022-02-20 23:24:12,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {5082#false} assume main_#t~switch24#1;call main_#t~mem28#1 := read~int(main_~_hj_key~0#1.base, 7 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 16777216 * (main_#t~mem28#1 % 256);havoc main_#t~mem28#1; {5082#false} is VALID [2022-02-20 23:24:12,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {5082#false} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {5082#false} is VALID [2022-02-20 23:24:12,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {5082#false} assume main_#t~switch24#1;call main_#t~mem29#1 := read~int(main_~_hj_key~0#1.base, 6 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 65536 * (main_#t~mem29#1 % 256);havoc main_#t~mem29#1; {5082#false} is VALID [2022-02-20 23:24:12,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {5082#false} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {5082#false} is VALID [2022-02-20 23:24:12,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {5082#false} assume main_#t~switch24#1;call main_#t~mem30#1 := read~int(main_~_hj_key~0#1.base, 5 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + 256 * (main_#t~mem30#1 % 256);havoc main_#t~mem30#1; {5082#false} is VALID [2022-02-20 23:24:12,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {5082#false} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {5082#false} is VALID [2022-02-20 23:24:12,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {5082#false} assume main_#t~switch24#1;call main_#t~mem31#1 := read~int(main_~_hj_key~0#1.base, 4 + main_~_hj_key~0#1.offset, 1);main_~_hj_j~0#1 := main_~_hj_j~0#1 + main_#t~mem31#1 % 256;havoc main_#t~mem31#1; {5082#false} is VALID [2022-02-20 23:24:12,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {5082#false} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {5082#false} is VALID [2022-02-20 23:24:12,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {5082#false} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {5082#false} is VALID [2022-02-20 23:24:12,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {5082#false} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {5082#false} is VALID [2022-02-20 23:24:12,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {5082#false} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {5082#false} is VALID [2022-02-20 23:24:12,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {5082#false} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {5082#false} is VALID [2022-02-20 23:24:12,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {5082#false} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {5082#false} is VALID [2022-02-20 23:24:12,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {5082#false} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {5082#false} is VALID [2022-02-20 23:24:12,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {5082#false} assume main_#t~switch24#1;call main_#t~mem35#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem35#1 % 256;havoc main_#t~mem35#1; {5082#false} is VALID [2022-02-20 23:24:12,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {5082#false} havoc main_#t~switch24#1; {5082#false} is VALID [2022-02-20 23:24:12,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {5082#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)))); {5082#false} is VALID [2022-02-20 23:24:12,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {5082#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); {5082#false} is VALID [2022-02-20 23:24:12,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {5082#false} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {5082#false} is VALID [2022-02-20 23:24:12,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {5082#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {5082#false} is VALID [2022-02-20 23:24:12,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,223 INFO L290 TraceCheckUtils]: 41: Hoare triple {5082#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {5082#false} is VALID [2022-02-20 23:24:12,223 INFO L290 TraceCheckUtils]: 42: Hoare triple {5082#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {5082#false} is VALID [2022-02-20 23:24:12,223 INFO L290 TraceCheckUtils]: 43: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,223 INFO L290 TraceCheckUtils]: 44: Hoare triple {5082#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {5082#false} is VALID [2022-02-20 23:24:12,224 INFO L290 TraceCheckUtils]: 45: Hoare triple {5082#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {5082#false} is VALID [2022-02-20 23:24:12,224 INFO L290 TraceCheckUtils]: 46: Hoare triple {5082#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {5082#false} is VALID [2022-02-20 23:24:12,224 INFO L290 TraceCheckUtils]: 47: Hoare triple {5082#false} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {5082#false} is VALID [2022-02-20 23:24:12,224 INFO L290 TraceCheckUtils]: 48: Hoare triple {5082#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {5082#false} is VALID [2022-02-20 23:24:12,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,224 INFO L290 TraceCheckUtils]: 50: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,224 INFO L290 TraceCheckUtils]: 51: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,224 INFO L290 TraceCheckUtils]: 52: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,225 INFO L290 TraceCheckUtils]: 53: Hoare triple {5082#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {5082#false} is VALID [2022-02-20 23:24:12,225 INFO L290 TraceCheckUtils]: 54: Hoare triple {5082#false} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5082#false} is VALID [2022-02-20 23:24:12,225 INFO L290 TraceCheckUtils]: 55: Hoare triple {5082#false} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {5082#false} is VALID [2022-02-20 23:24:12,225 INFO L290 TraceCheckUtils]: 56: Hoare triple {5082#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5082#false} is VALID [2022-02-20 23:24:12,225 INFO L290 TraceCheckUtils]: 57: Hoare triple {5082#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5082#false} is VALID [2022-02-20 23:24:12,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {5082#false} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {5082#false} is VALID [2022-02-20 23:24:12,225 INFO L290 TraceCheckUtils]: 59: Hoare triple {5082#false} havoc main_~_hf_hashv~0#1; {5082#false} is VALID [2022-02-20 23:24:12,226 INFO L290 TraceCheckUtils]: 60: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,226 INFO L290 TraceCheckUtils]: 61: Hoare triple {5082#false} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {5082#false} is VALID [2022-02-20 23:24:12,226 INFO L290 TraceCheckUtils]: 62: Hoare triple {5082#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {5082#false} is VALID [2022-02-20 23:24:12,239 INFO L290 TraceCheckUtils]: 63: Hoare triple {5082#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {5082#false} is VALID [2022-02-20 23:24:12,239 INFO L290 TraceCheckUtils]: 64: Hoare triple {5082#false} assume !main_#t~switch158#1; {5082#false} is VALID [2022-02-20 23:24:12,240 INFO L290 TraceCheckUtils]: 65: Hoare triple {5082#false} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {5082#false} is VALID [2022-02-20 23:24:12,240 INFO L290 TraceCheckUtils]: 66: Hoare triple {5082#false} assume main_#t~switch158#1;call main_#t~mem160#1 := read~int(main_~_hj_key~1#1.base, 9 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 65536 * (main_#t~mem160#1 % 256);havoc main_#t~mem160#1; {5082#false} is VALID [2022-02-20 23:24:12,240 INFO L290 TraceCheckUtils]: 67: Hoare triple {5082#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {5082#false} is VALID [2022-02-20 23:24:12,240 INFO L290 TraceCheckUtils]: 68: Hoare triple {5082#false} assume main_#t~switch158#1;call main_#t~mem161#1 := read~int(main_~_hj_key~1#1.base, 8 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 256 * (main_#t~mem161#1 % 256);havoc main_#t~mem161#1; {5082#false} is VALID [2022-02-20 23:24:12,240 INFO L290 TraceCheckUtils]: 69: Hoare triple {5082#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {5082#false} is VALID [2022-02-20 23:24:12,240 INFO L290 TraceCheckUtils]: 70: Hoare triple {5082#false} assume main_#t~switch158#1;call main_#t~mem162#1 := read~int(main_~_hj_key~1#1.base, 7 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 16777216 * (main_#t~mem162#1 % 256);havoc main_#t~mem162#1; {5082#false} is VALID [2022-02-20 23:24:12,240 INFO L290 TraceCheckUtils]: 71: Hoare triple {5082#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {5082#false} is VALID [2022-02-20 23:24:12,241 INFO L290 TraceCheckUtils]: 72: Hoare triple {5082#false} assume main_#t~switch158#1;call main_#t~mem163#1 := read~int(main_~_hj_key~1#1.base, 6 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 65536 * (main_#t~mem163#1 % 256);havoc main_#t~mem163#1; {5082#false} is VALID [2022-02-20 23:24:12,241 INFO L290 TraceCheckUtils]: 73: Hoare triple {5082#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {5082#false} is VALID [2022-02-20 23:24:12,241 INFO L290 TraceCheckUtils]: 74: Hoare triple {5082#false} assume main_#t~switch158#1;call main_#t~mem164#1 := read~int(main_~_hj_key~1#1.base, 5 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 256 * (main_#t~mem164#1 % 256);havoc main_#t~mem164#1; {5082#false} is VALID [2022-02-20 23:24:12,241 INFO L290 TraceCheckUtils]: 75: Hoare triple {5082#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {5082#false} is VALID [2022-02-20 23:24:12,241 INFO L290 TraceCheckUtils]: 76: Hoare triple {5082#false} assume main_#t~switch158#1;call main_#t~mem165#1 := read~int(main_~_hj_key~1#1.base, 4 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + main_#t~mem165#1 % 256;havoc main_#t~mem165#1; {5082#false} is VALID [2022-02-20 23:24:12,241 INFO L290 TraceCheckUtils]: 77: Hoare triple {5082#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {5082#false} is VALID [2022-02-20 23:24:12,241 INFO L290 TraceCheckUtils]: 78: Hoare triple {5082#false} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {5082#false} is VALID [2022-02-20 23:24:12,241 INFO L290 TraceCheckUtils]: 79: Hoare triple {5082#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {5082#false} is VALID [2022-02-20 23:24:12,242 INFO L290 TraceCheckUtils]: 80: Hoare triple {5082#false} assume main_#t~switch158#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem167#1 % 256);havoc main_#t~mem167#1; {5082#false} is VALID [2022-02-20 23:24:12,242 INFO L290 TraceCheckUtils]: 81: Hoare triple {5082#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {5082#false} is VALID [2022-02-20 23:24:12,242 INFO L290 TraceCheckUtils]: 82: Hoare triple {5082#false} assume main_#t~switch158#1;call main_#t~mem168#1 := read~int(main_~_hj_key~1#1.base, 1 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 256 * (main_#t~mem168#1 % 256);havoc main_#t~mem168#1; {5082#false} is VALID [2022-02-20 23:24:12,242 INFO L290 TraceCheckUtils]: 83: Hoare triple {5082#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {5082#false} is VALID [2022-02-20 23:24:12,242 INFO L290 TraceCheckUtils]: 84: Hoare triple {5082#false} assume main_#t~switch158#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem169#1 % 256;havoc main_#t~mem169#1; {5082#false} is VALID [2022-02-20 23:24:12,242 INFO L290 TraceCheckUtils]: 85: Hoare triple {5082#false} havoc main_#t~switch158#1; {5082#false} is VALID [2022-02-20 23:24:12,242 INFO L290 TraceCheckUtils]: 86: Hoare triple {5082#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {5082#false} is VALID [2022-02-20 23:24:12,243 INFO L290 TraceCheckUtils]: 87: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,243 INFO L290 TraceCheckUtils]: 88: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,243 INFO L290 TraceCheckUtils]: 89: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,243 INFO L290 TraceCheckUtils]: 90: Hoare triple {5082#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {5082#false} is VALID [2022-02-20 23:24:12,243 INFO L290 TraceCheckUtils]: 91: Hoare triple {5082#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {5082#false} is VALID [2022-02-20 23:24:12,243 INFO L290 TraceCheckUtils]: 92: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,243 INFO L290 TraceCheckUtils]: 93: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:24:12,244 INFO L290 TraceCheckUtils]: 94: Hoare triple {5082#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {5082#false} is VALID [2022-02-20 23:24:12,244 INFO L290 TraceCheckUtils]: 95: Hoare triple {5082#false} assume !false; {5082#false} is VALID [2022-02-20 23:24:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:24:12,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:12,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:12,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515205833] [2022-02-20 23:24:12,245 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:12,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417065876] [2022-02-20 23:24:12,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417065876] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:12,245 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:12,245 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:24:12,245 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708737418] [2022-02-20 23:24:12,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:12,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 96 [2022-02-20 23:24:12,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:12,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:12,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:12,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:24:12,318 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:12,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:24:12,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:24:12,319 INFO L87 Difference]: Start difference. First operand 215 states and 271 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:13,046 INFO L93 Difference]: Finished difference Result 418 states and 530 transitions. [2022-02-20 23:24:13,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:24:13,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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 96 [2022-02-20 23:24:13,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2022-02-20 23:24:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2022-02-20 23:24:13,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 467 transitions. [2022-02-20 23:24:13,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:13,341 INFO L225 Difference]: With dead ends: 418 [2022-02-20 23:24:13,341 INFO L226 Difference]: Without dead ends: 207 [2022-02-20 23:24:13,342 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:24:13,342 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 192 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:24:13,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 431 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:24:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-02-20 23:24:13,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 201. [2022-02-20 23:24:13,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:13,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 201 states, 189 states have (on average 1.2380952380952381) internal successors, (234), 195 states have internal predecessors, (234), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:13,380 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 201 states, 189 states have (on average 1.2380952380952381) internal successors, (234), 195 states have internal predecessors, (234), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:13,381 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 201 states, 189 states have (on average 1.2380952380952381) internal successors, (234), 195 states have internal predecessors, (234), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:13,385 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2022-02-20 23:24:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 256 transitions. [2022-02-20 23:24:13,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:13,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:13,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 189 states have (on average 1.2380952380952381) internal successors, (234), 195 states have internal predecessors, (234), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 207 states. [2022-02-20 23:24:13,386 INFO L87 Difference]: Start difference. First operand has 201 states, 189 states have (on average 1.2380952380952381) internal successors, (234), 195 states have internal predecessors, (234), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 207 states. [2022-02-20 23:24:13,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:13,389 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2022-02-20 23:24:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 256 transitions. [2022-02-20 23:24:13,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:13,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:13,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:13,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:13,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 189 states have (on average 1.2380952380952381) internal successors, (234), 195 states have internal predecessors, (234), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 250 transitions. [2022-02-20 23:24:13,394 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 250 transitions. Word has length 96 [2022-02-20 23:24:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:13,394 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 250 transitions. [2022-02-20 23:24:13,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 250 transitions. [2022-02-20 23:24:13,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 23:24:13,395 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:13,396 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:24:13,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:24:13,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:13,612 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:13,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:13,612 INFO L85 PathProgramCache]: Analyzing trace with hash 432355323, now seen corresponding path program 1 times [2022-02-20 23:24:13,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:13,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422735486] [2022-02-20 23:24:13,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:13,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:13,692 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:13,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [582140173] [2022-02-20 23:24:13,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:13,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:13,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:13,694 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:24:13,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:24:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:14,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:24:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:14,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:14,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {6523#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; {6523#true} is VALID [2022-02-20 23:24:14,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {6523#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6523#true} is VALID [2022-02-20 23:24:14,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {6523#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6523#true} is VALID [2022-02-20 23:24:14,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {6523#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {6523#true} is VALID [2022-02-20 23:24:14,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {6523#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {6523#true} is VALID [2022-02-20 23:24:14,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {6523#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {6523#true} is VALID [2022-02-20 23:24:14,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {6523#true} havoc main_~_ha_hashv~0#1; {6523#true} is VALID [2022-02-20 23:24:14,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:24:14,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {6523#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; {6523#true} is VALID [2022-02-20 23:24:14,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {6523#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {6523#true} is VALID [2022-02-20 23:24:14,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {6523#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {6523#true} is VALID [2022-02-20 23:24:14,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {6523#true} assume !main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:24:14,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {6523#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {6523#true} is VALID [2022-02-20 23:24:14,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {6523#true} assume !main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:24:14,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {6523#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {6523#true} is VALID [2022-02-20 23:24:14,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {6523#true} assume !main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:24:14,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {6523#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {6523#true} is VALID [2022-02-20 23:24:14,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {6523#true} assume !main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:24:14,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {6523#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {6523#true} is VALID [2022-02-20 23:24:14,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {6523#true} assume !main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:24:14,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {6523#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {6523#true} is VALID [2022-02-20 23:24:14,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {6523#true} assume !main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:24:14,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {6523#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {6523#true} is VALID [2022-02-20 23:24:14,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {6523#true} assume !main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:24:14,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {6523#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {6523#true} is VALID [2022-02-20 23:24:14,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {6523#true} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {6523#true} is VALID [2022-02-20 23:24:14,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {6523#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {6523#true} is VALID [2022-02-20 23:24:14,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {6523#true} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {6523#true} is VALID [2022-02-20 23:24:14,613 INFO L290 TraceCheckUtils]: 28: Hoare triple {6523#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {6523#true} is VALID [2022-02-20 23:24:14,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {6523#true} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {6523#true} is VALID [2022-02-20 23:24:14,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {6523#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {6523#true} is VALID [2022-02-20 23:24:14,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {6523#true} assume main_#t~switch24#1;call main_#t~mem35#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem35#1 % 256;havoc main_#t~mem35#1; {6523#true} is VALID [2022-02-20 23:24:14,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {6523#true} havoc main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:24:14,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {6523#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)))); {6523#true} is VALID [2022-02-20 23:24:14,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:24:14,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:24:14,614 INFO L290 TraceCheckUtils]: 36: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:24:14,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {6523#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); {6523#true} is VALID [2022-02-20 23:24:14,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {6523#true} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {6523#true} is VALID [2022-02-20 23:24:14,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {6523#true} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {6523#true} is VALID [2022-02-20 23:24:14,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:24:14,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {6523#true} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {6523#true} is VALID [2022-02-20 23:24:14,615 INFO L290 TraceCheckUtils]: 42: Hoare triple {6523#true} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {6523#true} is VALID [2022-02-20 23:24:14,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:24:14,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {6523#true} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {6523#true} is VALID [2022-02-20 23:24:14,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {6523#true} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {6523#true} is VALID [2022-02-20 23:24:14,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {6523#true} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {6523#true} is VALID [2022-02-20 23:24:14,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {6523#true} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {6523#true} is VALID [2022-02-20 23:24:14,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {6523#true} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {6523#true} is VALID [2022-02-20 23:24:14,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:24:14,616 INFO L290 TraceCheckUtils]: 50: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:24:14,616 INFO L290 TraceCheckUtils]: 51: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:24:14,616 INFO L290 TraceCheckUtils]: 52: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:24:14,616 INFO L290 TraceCheckUtils]: 53: Hoare triple {6523#true} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {6523#true} is VALID [2022-02-20 23:24:14,616 INFO L290 TraceCheckUtils]: 54: Hoare triple {6523#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6523#true} is VALID [2022-02-20 23:24:14,617 INFO L290 TraceCheckUtils]: 55: Hoare triple {6523#true} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {6523#true} is VALID [2022-02-20 23:24:14,617 INFO L290 TraceCheckUtils]: 56: Hoare triple {6523#true} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6523#true} is VALID [2022-02-20 23:24:14,617 INFO L290 TraceCheckUtils]: 57: Hoare triple {6523#true} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {6523#true} is VALID [2022-02-20 23:24:14,617 INFO L290 TraceCheckUtils]: 58: Hoare triple {6523#true} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {6523#true} is VALID [2022-02-20 23:24:14,617 INFO L290 TraceCheckUtils]: 59: Hoare triple {6523#true} havoc main_~_hf_hashv~0#1; {6523#true} is VALID [2022-02-20 23:24:14,617 INFO L290 TraceCheckUtils]: 60: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:24:14,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {6523#true} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {6711#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} is VALID [2022-02-20 23:24:14,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {6711#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {6711#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} is VALID [2022-02-20 23:24:14,619 INFO L290 TraceCheckUtils]: 63: Hoare triple {6711#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {6711#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} is VALID [2022-02-20 23:24:14,623 INFO L290 TraceCheckUtils]: 64: Hoare triple {6711#(<= |ULTIMATE.start_main_~_hj_k~1#1| 4)} assume !main_#t~switch158#1; {6721#(and (<= |ULTIMATE.start_main_~_hj_k~1#1| 4) (not |ULTIMATE.start_main_#t~switch158#1|))} is VALID [2022-02-20 23:24:14,624 INFO L290 TraceCheckUtils]: 65: Hoare triple {6721#(and (<= |ULTIMATE.start_main_~_hj_k~1#1| 4) (not |ULTIMATE.start_main_#t~switch158#1|))} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {6725#(not |ULTIMATE.start_main_#t~switch158#1|)} is VALID [2022-02-20 23:24:14,624 INFO L290 TraceCheckUtils]: 66: Hoare triple {6725#(not |ULTIMATE.start_main_#t~switch158#1|)} assume main_#t~switch158#1;call main_#t~mem160#1 := read~int(main_~_hj_key~1#1.base, 9 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 65536 * (main_#t~mem160#1 % 256);havoc main_#t~mem160#1; {6524#false} is VALID [2022-02-20 23:24:14,624 INFO L290 TraceCheckUtils]: 67: Hoare triple {6524#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {6524#false} is VALID [2022-02-20 23:24:14,624 INFO L290 TraceCheckUtils]: 68: Hoare triple {6524#false} assume main_#t~switch158#1;call main_#t~mem161#1 := read~int(main_~_hj_key~1#1.base, 8 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 256 * (main_#t~mem161#1 % 256);havoc main_#t~mem161#1; {6524#false} is VALID [2022-02-20 23:24:14,624 INFO L290 TraceCheckUtils]: 69: Hoare triple {6524#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {6524#false} is VALID [2022-02-20 23:24:14,624 INFO L290 TraceCheckUtils]: 70: Hoare triple {6524#false} assume main_#t~switch158#1;call main_#t~mem162#1 := read~int(main_~_hj_key~1#1.base, 7 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 16777216 * (main_#t~mem162#1 % 256);havoc main_#t~mem162#1; {6524#false} is VALID [2022-02-20 23:24:14,625 INFO L290 TraceCheckUtils]: 71: Hoare triple {6524#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {6524#false} is VALID [2022-02-20 23:24:14,625 INFO L290 TraceCheckUtils]: 72: Hoare triple {6524#false} assume main_#t~switch158#1;call main_#t~mem163#1 := read~int(main_~_hj_key~1#1.base, 6 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 65536 * (main_#t~mem163#1 % 256);havoc main_#t~mem163#1; {6524#false} is VALID [2022-02-20 23:24:14,625 INFO L290 TraceCheckUtils]: 73: Hoare triple {6524#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {6524#false} is VALID [2022-02-20 23:24:14,625 INFO L290 TraceCheckUtils]: 74: Hoare triple {6524#false} assume main_#t~switch158#1;call main_#t~mem164#1 := read~int(main_~_hj_key~1#1.base, 5 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + 256 * (main_#t~mem164#1 % 256);havoc main_#t~mem164#1; {6524#false} is VALID [2022-02-20 23:24:14,625 INFO L290 TraceCheckUtils]: 75: Hoare triple {6524#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {6524#false} is VALID [2022-02-20 23:24:14,625 INFO L290 TraceCheckUtils]: 76: Hoare triple {6524#false} assume main_#t~switch158#1;call main_#t~mem165#1 := read~int(main_~_hj_key~1#1.base, 4 + main_~_hj_key~1#1.offset, 1);main_~_hj_j~1#1 := main_~_hj_j~1#1 + main_#t~mem165#1 % 256;havoc main_#t~mem165#1; {6524#false} is VALID [2022-02-20 23:24:14,625 INFO L290 TraceCheckUtils]: 77: Hoare triple {6524#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {6524#false} is VALID [2022-02-20 23:24:14,625 INFO L290 TraceCheckUtils]: 78: Hoare triple {6524#false} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {6524#false} is VALID [2022-02-20 23:24:14,626 INFO L290 TraceCheckUtils]: 79: Hoare triple {6524#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {6524#false} is VALID [2022-02-20 23:24:14,626 INFO L290 TraceCheckUtils]: 80: Hoare triple {6524#false} assume main_#t~switch158#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem167#1 % 256);havoc main_#t~mem167#1; {6524#false} is VALID [2022-02-20 23:24:14,626 INFO L290 TraceCheckUtils]: 81: Hoare triple {6524#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {6524#false} is VALID [2022-02-20 23:24:14,626 INFO L290 TraceCheckUtils]: 82: Hoare triple {6524#false} assume main_#t~switch158#1;call main_#t~mem168#1 := read~int(main_~_hj_key~1#1.base, 1 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 256 * (main_#t~mem168#1 % 256);havoc main_#t~mem168#1; {6524#false} is VALID [2022-02-20 23:24:14,626 INFO L290 TraceCheckUtils]: 83: Hoare triple {6524#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {6524#false} is VALID [2022-02-20 23:24:14,626 INFO L290 TraceCheckUtils]: 84: Hoare triple {6524#false} assume main_#t~switch158#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem169#1 % 256;havoc main_#t~mem169#1; {6524#false} is VALID [2022-02-20 23:24:14,626 INFO L290 TraceCheckUtils]: 85: Hoare triple {6524#false} havoc main_#t~switch158#1; {6524#false} is VALID [2022-02-20 23:24:14,626 INFO L290 TraceCheckUtils]: 86: Hoare triple {6524#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {6524#false} is VALID [2022-02-20 23:24:14,627 INFO L290 TraceCheckUtils]: 87: Hoare triple {6524#false} goto; {6524#false} is VALID [2022-02-20 23:24:14,627 INFO L290 TraceCheckUtils]: 88: Hoare triple {6524#false} goto; {6524#false} is VALID [2022-02-20 23:24:14,627 INFO L290 TraceCheckUtils]: 89: Hoare triple {6524#false} goto; {6524#false} is VALID [2022-02-20 23:24:14,627 INFO L290 TraceCheckUtils]: 90: Hoare triple {6524#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {6524#false} is VALID [2022-02-20 23:24:14,627 INFO L290 TraceCheckUtils]: 91: Hoare triple {6524#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {6524#false} is VALID [2022-02-20 23:24:14,627 INFO L290 TraceCheckUtils]: 92: Hoare triple {6524#false} goto; {6524#false} is VALID [2022-02-20 23:24:14,627 INFO L290 TraceCheckUtils]: 93: Hoare triple {6524#false} goto; {6524#false} is VALID [2022-02-20 23:24:14,627 INFO L290 TraceCheckUtils]: 94: Hoare triple {6524#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {6524#false} is VALID [2022-02-20 23:24:14,628 INFO L290 TraceCheckUtils]: 95: Hoare triple {6524#false} assume !false; {6524#false} is VALID [2022-02-20 23:24:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:24:14,628 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:14,628 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:14,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422735486] [2022-02-20 23:24:14,628 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:14,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582140173] [2022-02-20 23:24:14,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582140173] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:14,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:14,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:24:14,629 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923355519] [2022-02-20 23:24:14,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:14,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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 96 [2022-02-20 23:24:14,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:14,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:14,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:14,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:24:14,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:14,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:24:14,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:24:14,705 INFO L87 Difference]: Start difference. First operand 201 states and 250 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:15,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:15,454 INFO L93 Difference]: Finished difference Result 291 states and 368 transitions. [2022-02-20 23:24:15,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:24:15,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 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 96 [2022-02-20 23:24:15,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2022-02-20 23:24:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:15,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2022-02-20 23:24:15,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 337 transitions. [2022-02-20 23:24:15,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:15,714 INFO L225 Difference]: With dead ends: 291 [2022-02-20 23:24:15,714 INFO L226 Difference]: Without dead ends: 193 [2022-02-20 23:24:15,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:24:15,715 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 70 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:24:15,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 700 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:24:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-02-20 23:24:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2022-02-20 23:24:15,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:15,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand has 187 states, 175 states have (on average 1.217142857142857) internal successors, (213), 181 states have internal predecessors, (213), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:15,743 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand has 187 states, 175 states have (on average 1.217142857142857) internal successors, (213), 181 states have internal predecessors, (213), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:15,743 INFO L87 Difference]: Start difference. First operand 193 states. Second operand has 187 states, 175 states have (on average 1.217142857142857) internal successors, (213), 181 states have internal predecessors, (213), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:15,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:15,747 INFO L93 Difference]: Finished difference Result 193 states and 235 transitions. [2022-02-20 23:24:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 235 transitions. [2022-02-20 23:24:15,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:15,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:15,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 175 states have (on average 1.217142857142857) internal successors, (213), 181 states have internal predecessors, (213), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 193 states. [2022-02-20 23:24:15,748 INFO L87 Difference]: Start difference. First operand has 187 states, 175 states have (on average 1.217142857142857) internal successors, (213), 181 states have internal predecessors, (213), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 193 states. [2022-02-20 23:24:15,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:15,751 INFO L93 Difference]: Finished difference Result 193 states and 235 transitions. [2022-02-20 23:24:15,751 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 235 transitions. [2022-02-20 23:24:15,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:15,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:15,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:15,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 175 states have (on average 1.217142857142857) internal successors, (213), 181 states have internal predecessors, (213), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 229 transitions. [2022-02-20 23:24:15,755 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 229 transitions. Word has length 96 [2022-02-20 23:24:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:15,756 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 229 transitions. [2022-02-20 23:24:15,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 229 transitions. [2022-02-20 23:24:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 23:24:15,756 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:15,757 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:24:15,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:24:15,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:15,978 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:15,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:15,979 INFO L85 PathProgramCache]: Analyzing trace with hash -725253137, now seen corresponding path program 1 times [2022-02-20 23:24:15,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:15,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697681914] [2022-02-20 23:24:15,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:15,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:16,076 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:16,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558158430] [2022-02-20 23:24:16,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:16,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:16,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:16,086 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:24:16,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:24:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:16,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 1627 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:24:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:16,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:17,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {7777#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; {7777#true} is VALID [2022-02-20 23:24:17,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {7777#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {7785#(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); {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {7785#(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; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {7785#(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); {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem35#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem35#1 % 256;havoc main_#t~mem35#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,252 INFO L290 TraceCheckUtils]: 32: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch24#1; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {7785#(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)))); {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {7785#(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); {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:17,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {7785#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~users~0#1.base == 0 && main_~users~0#1.offset == 0);call main_#t~mem53#1.base, main_#t~mem53#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_#t~mem53#1.base, main_#t~mem53#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~mem53#1.base, main_#t~mem53#1.offset; {7778#false} is VALID [2022-02-20 23:24:17,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {7778#false} call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call main_#t~mem54#1.base, main_#t~mem54#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem55#1.base, main_#t~mem55#1.offset := read~$Pointer$(main_#t~mem54#1.base, 16 + main_#t~mem54#1.offset, 4);call main_#t~mem56#1.base, main_#t~mem56#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem57#1 := read~int(main_#t~mem56#1.base, 20 + main_#t~mem56#1.offset, 4);call write~$Pointer$(main_#t~mem55#1.base, main_#t~mem55#1.offset - main_#t~mem57#1, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4);havoc main_#t~mem54#1.base, main_#t~mem54#1.offset;havoc main_#t~mem55#1.base, main_#t~mem55#1.offset;havoc main_#t~mem56#1.base, main_#t~mem56#1.offset;havoc main_#t~mem57#1;call main_#t~mem58#1.base, main_#t~mem58#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem59#1.base, main_#t~mem59#1.offset := read~$Pointer$(main_#t~mem58#1.base, 16 + main_#t~mem58#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_#t~mem59#1.base, 8 + main_#t~mem59#1.offset, 4);havoc main_#t~mem58#1.base, main_#t~mem58#1.offset;havoc main_#t~mem59#1.base, main_#t~mem59#1.offset;call main_#t~mem60#1.base, main_#t~mem60#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem60#1.base, 16 + main_#t~mem60#1.offset, 4);havoc main_#t~mem60#1.base, main_#t~mem60#1.offset; {7778#false} is VALID [2022-02-20 23:24:17,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:24:17,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {7778#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {7778#false} is VALID [2022-02-20 23:24:17,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {7778#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {7778#false} is VALID [2022-02-20 23:24:17,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:24:17,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {7778#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {7778#false} is VALID [2022-02-20 23:24:17,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {7778#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {7778#false} is VALID [2022-02-20 23:24:17,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {7778#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {7778#false} is VALID [2022-02-20 23:24:17,258 INFO L290 TraceCheckUtils]: 47: Hoare triple {7778#false} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {7778#false} is VALID [2022-02-20 23:24:17,258 INFO L290 TraceCheckUtils]: 48: Hoare triple {7778#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {7778#false} is VALID [2022-02-20 23:24:17,258 INFO L290 TraceCheckUtils]: 49: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:24:17,258 INFO L290 TraceCheckUtils]: 50: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:24:17,258 INFO L290 TraceCheckUtils]: 51: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:24:17,258 INFO L290 TraceCheckUtils]: 52: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:24:17,258 INFO L290 TraceCheckUtils]: 53: Hoare triple {7778#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {7778#false} is VALID [2022-02-20 23:24:17,258 INFO L290 TraceCheckUtils]: 54: Hoare triple {7778#false} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7778#false} is VALID [2022-02-20 23:24:17,259 INFO L290 TraceCheckUtils]: 55: Hoare triple {7778#false} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {7778#false} is VALID [2022-02-20 23:24:17,259 INFO L290 TraceCheckUtils]: 56: Hoare triple {7778#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7778#false} is VALID [2022-02-20 23:24:17,259 INFO L290 TraceCheckUtils]: 57: Hoare triple {7778#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {7778#false} is VALID [2022-02-20 23:24:17,259 INFO L290 TraceCheckUtils]: 58: Hoare triple {7778#false} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {7778#false} is VALID [2022-02-20 23:24:17,259 INFO L290 TraceCheckUtils]: 59: Hoare triple {7778#false} havoc main_~_hf_hashv~0#1; {7778#false} is VALID [2022-02-20 23:24:17,259 INFO L290 TraceCheckUtils]: 60: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:24:17,259 INFO L290 TraceCheckUtils]: 61: Hoare triple {7778#false} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {7778#false} is VALID [2022-02-20 23:24:17,261 INFO L290 TraceCheckUtils]: 62: Hoare triple {7778#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {7778#false} is VALID [2022-02-20 23:24:17,262 INFO L290 TraceCheckUtils]: 63: Hoare triple {7778#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {7778#false} is VALID [2022-02-20 23:24:17,262 INFO L290 TraceCheckUtils]: 64: Hoare triple {7778#false} assume !main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:24:17,262 INFO L290 TraceCheckUtils]: 65: Hoare triple {7778#false} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {7778#false} is VALID [2022-02-20 23:24:17,262 INFO L290 TraceCheckUtils]: 66: Hoare triple {7778#false} assume !main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:24:17,262 INFO L290 TraceCheckUtils]: 67: Hoare triple {7778#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {7778#false} is VALID [2022-02-20 23:24:17,262 INFO L290 TraceCheckUtils]: 68: Hoare triple {7778#false} assume !main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:24:17,262 INFO L290 TraceCheckUtils]: 69: Hoare triple {7778#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {7778#false} is VALID [2022-02-20 23:24:17,264 INFO L290 TraceCheckUtils]: 70: Hoare triple {7778#false} assume !main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:24:17,265 INFO L290 TraceCheckUtils]: 71: Hoare triple {7778#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {7778#false} is VALID [2022-02-20 23:24:17,266 INFO L290 TraceCheckUtils]: 72: Hoare triple {7778#false} assume !main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:24:17,266 INFO L290 TraceCheckUtils]: 73: Hoare triple {7778#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {7778#false} is VALID [2022-02-20 23:24:17,266 INFO L290 TraceCheckUtils]: 74: Hoare triple {7778#false} assume !main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:24:17,266 INFO L290 TraceCheckUtils]: 75: Hoare triple {7778#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {7778#false} is VALID [2022-02-20 23:24:17,266 INFO L290 TraceCheckUtils]: 76: Hoare triple {7778#false} assume !main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:24:17,266 INFO L290 TraceCheckUtils]: 77: Hoare triple {7778#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {7778#false} is VALID [2022-02-20 23:24:17,266 INFO L290 TraceCheckUtils]: 78: Hoare triple {7778#false} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {7778#false} is VALID [2022-02-20 23:24:17,266 INFO L290 TraceCheckUtils]: 79: Hoare triple {7778#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {7778#false} is VALID [2022-02-20 23:24:17,267 INFO L290 TraceCheckUtils]: 80: Hoare triple {7778#false} assume main_#t~switch158#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem167#1 % 256);havoc main_#t~mem167#1; {7778#false} is VALID [2022-02-20 23:24:17,267 INFO L290 TraceCheckUtils]: 81: Hoare triple {7778#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {7778#false} is VALID [2022-02-20 23:24:17,267 INFO L290 TraceCheckUtils]: 82: Hoare triple {7778#false} assume main_#t~switch158#1;call main_#t~mem168#1 := read~int(main_~_hj_key~1#1.base, 1 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 256 * (main_#t~mem168#1 % 256);havoc main_#t~mem168#1; {7778#false} is VALID [2022-02-20 23:24:17,267 INFO L290 TraceCheckUtils]: 83: Hoare triple {7778#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {7778#false} is VALID [2022-02-20 23:24:17,267 INFO L290 TraceCheckUtils]: 84: Hoare triple {7778#false} assume main_#t~switch158#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem169#1 % 256;havoc main_#t~mem169#1; {7778#false} is VALID [2022-02-20 23:24:17,267 INFO L290 TraceCheckUtils]: 85: Hoare triple {7778#false} havoc main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:24:17,267 INFO L290 TraceCheckUtils]: 86: Hoare triple {7778#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {7778#false} is VALID [2022-02-20 23:24:17,267 INFO L290 TraceCheckUtils]: 87: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:24:17,268 INFO L290 TraceCheckUtils]: 88: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:24:17,268 INFO L290 TraceCheckUtils]: 89: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:24:17,268 INFO L290 TraceCheckUtils]: 90: Hoare triple {7778#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {7778#false} is VALID [2022-02-20 23:24:17,268 INFO L290 TraceCheckUtils]: 91: Hoare triple {7778#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {7778#false} is VALID [2022-02-20 23:24:17,268 INFO L290 TraceCheckUtils]: 92: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:24:17,268 INFO L290 TraceCheckUtils]: 93: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:24:17,268 INFO L290 TraceCheckUtils]: 94: Hoare triple {7778#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {7778#false} is VALID [2022-02-20 23:24:17,268 INFO L290 TraceCheckUtils]: 95: Hoare triple {7778#false} assume !false; {7778#false} is VALID [2022-02-20 23:24:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:24:17,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:17,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:17,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697681914] [2022-02-20 23:24:17,270 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:17,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558158430] [2022-02-20 23:24:17,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558158430] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:17,271 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:17,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:24:17,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652800352] [2022-02-20 23:24:17,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:17,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2022-02-20 23:24:17,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:17,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:17,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:17,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:24:17,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:17,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:24:17,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:24:17,336 INFO L87 Difference]: Start difference. First operand 187 states and 229 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:17,844 INFO L93 Difference]: Finished difference Result 476 states and 582 transitions. [2022-02-20 23:24:17,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:24:17,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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 96 [2022-02-20 23:24:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2022-02-20 23:24:17,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2022-02-20 23:24:17,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 546 transitions. [2022-02-20 23:24:18,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 546 edges. 546 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:18,300 INFO L225 Difference]: With dead ends: 476 [2022-02-20 23:24:18,300 INFO L226 Difference]: Without dead ends: 293 [2022-02-20 23:24:18,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:24:18,301 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 75 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:24:18,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:24:18,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-02-20 23:24:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2022-02-20 23:24:18,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:18,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand has 291 states, 274 states have (on average 1.197080291970803) internal successors, (328), 285 states have internal predecessors, (328), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:24:18,350 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand has 291 states, 274 states have (on average 1.197080291970803) internal successors, (328), 285 states have internal predecessors, (328), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:24:18,351 INFO L87 Difference]: Start difference. First operand 293 states. Second operand has 291 states, 274 states have (on average 1.197080291970803) internal successors, (328), 285 states have internal predecessors, (328), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:24:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:18,356 INFO L93 Difference]: Finished difference Result 293 states and 355 transitions. [2022-02-20 23:24:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 355 transitions. [2022-02-20 23:24:18,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:18,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:18,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 291 states, 274 states have (on average 1.197080291970803) internal successors, (328), 285 states have internal predecessors, (328), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) Second operand 293 states. [2022-02-20 23:24:18,358 INFO L87 Difference]: Start difference. First operand has 291 states, 274 states have (on average 1.197080291970803) internal successors, (328), 285 states have internal predecessors, (328), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) Second operand 293 states. [2022-02-20 23:24:18,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:18,365 INFO L93 Difference]: Finished difference Result 293 states and 355 transitions. [2022-02-20 23:24:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 355 transitions. [2022-02-20 23:24:18,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:18,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:18,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:18,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:18,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 274 states have (on average 1.197080291970803) internal successors, (328), 285 states have internal predecessors, (328), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 23:24:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 354 transitions. [2022-02-20 23:24:18,373 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 354 transitions. Word has length 96 [2022-02-20 23:24:18,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:18,373 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 354 transitions. [2022-02-20 23:24:18,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:24:18,373 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2022-02-20 23:24:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-20 23:24:18,374 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:18,374 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:24:18,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:24:18,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:18,588 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:18,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:18,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1015837155, now seen corresponding path program 1 times [2022-02-20 23:24:18,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:18,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278175758] [2022-02-20 23:24:18,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:18,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:18,632 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:18,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164331072] [2022-02-20 23:24:18,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:18,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:18,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:18,634 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:24:18,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:24:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:19,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:24:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:19,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:19,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {9571#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; {9571#true} is VALID [2022-02-20 23:24:19,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {9571#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {9571#true} is VALID [2022-02-20 23:24:19,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {9571#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {9571#true} is VALID [2022-02-20 23:24:19,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {9571#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} havoc main_~_hj_i~0#1;havoc main_~_hj_j~0#1;havoc main_~_hj_k~0#1;main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset;main_~_ha_hashv~0#1 := 4276993775;main_~_hj_j~0#1 := 2654435769;main_~_hj_i~0#1 := main_~_hj_j~0#1;main_~_hj_k~0#1 := 4; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch24#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch24#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch24#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch24#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch24#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch24#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,594 INFO L290 TraceCheckUtils]: 23: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !main_#t~switch24#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,596 INFO L290 TraceCheckUtils]: 29: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,597 INFO L290 TraceCheckUtils]: 31: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume main_#t~switch24#1;call main_#t~mem35#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem35#1 % 256;havoc main_#t~mem35#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,597 INFO L290 TraceCheckUtils]: 32: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} havoc main_#t~switch24#1; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8192 || 0 == main_~_ha_hashv~0#1 / 8192) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8192 else (if 0 == main_~_ha_hashv~0#1 / 8192 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8192))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 256 * main_~_hj_i~0#1 || 0 == 256 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 256 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 256 * main_~_hj_i~0#1 else (if 0 == 256 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 256 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 8192 || 0 == main_~_hj_j~0#1 / 8192) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 8192 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 8192 else (if 0 == main_~_hj_j~0#1 / 8192 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 8192))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 4096 || 0 == main_~_ha_hashv~0#1 / 4096) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 4096 else (if 0 == main_~_ha_hashv~0#1 / 4096 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 4096))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 65536 * main_~_hj_i~0#1 || 0 == 65536 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 65536 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 65536 * main_~_hj_i~0#1 else (if 0 == 65536 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 65536 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32 || 0 == main_~_hj_j~0#1 / 32) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32 else (if 0 == main_~_hj_j~0#1 / 32 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32))));main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_hj_j~0#1;main_~_hj_i~0#1 := main_~_hj_i~0#1 - main_~_ha_hashv~0#1;main_~_hj_i~0#1 := (if (1 == main_~_hj_i~0#1 || 0 == main_~_hj_i~0#1) && (1 == main_~_ha_hashv~0#1 / 8 || 0 == main_~_ha_hashv~0#1 / 8) then (if main_~_hj_i~0#1 == main_~_ha_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~0#1 then main_~_ha_hashv~0#1 / 8 else (if 0 == main_~_ha_hashv~0#1 / 8 then main_~_hj_i~0#1 else ~bitwiseXOr(main_~_hj_i~0#1, main_~_ha_hashv~0#1 / 8))));main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_ha_hashv~0#1;main_~_hj_j~0#1 := main_~_hj_j~0#1 - main_~_hj_i~0#1;main_~_hj_j~0#1 := (if (1 == main_~_hj_j~0#1 || 0 == main_~_hj_j~0#1) && (1 == 1024 * main_~_hj_i~0#1 || 0 == 1024 * main_~_hj_i~0#1) then (if main_~_hj_j~0#1 == 1024 * main_~_hj_i~0#1 then 0 else 1) else (if 0 == main_~_hj_j~0#1 then 1024 * main_~_hj_i~0#1 else (if 0 == 1024 * main_~_hj_i~0#1 then main_~_hj_j~0#1 else ~bitwiseXOr(main_~_hj_j~0#1, 1024 * main_~_hj_i~0#1))));main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_i~0#1;main_~_ha_hashv~0#1 := main_~_ha_hashv~0#1 - main_~_hj_j~0#1;main_~_ha_hashv~0#1 := (if (1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1) && (1 == main_~_hj_j~0#1 / 32768 || 0 == main_~_hj_j~0#1 / 32768) then (if main_~_ha_hashv~0#1 == main_~_hj_j~0#1 / 32768 then 0 else 1) else (if 0 == main_~_ha_hashv~0#1 then main_~_hj_j~0#1 / 32768 else (if 0 == main_~_hj_j~0#1 / 32768 then main_~_ha_hashv~0#1 else ~bitwiseXOr(main_~_ha_hashv~0#1, main_~_hj_j~0#1 / 32768)))); {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,599 INFO L290 TraceCheckUtils]: 36: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} call write~int(main_~_ha_hashv~0#1, main_~user~0#1.base, 36 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, main_~user~0#1.offset, main_~user~0#1.base, 28 + main_~user~0#1.offset, 4);call write~int(4, main_~user~0#1.base, 32 + main_~user~0#1.offset, 4); {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume main_~users~0#1.base == 0 && main_~users~0#1.offset == 0;call write~$Pointer$(0, 0, main_~user~0#1.base, 16 + main_~user~0#1.offset, 4);call write~$Pointer$(0, 0, main_~user~0#1.base, 12 + main_~user~0#1.offset, 4); {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,600 INFO L290 TraceCheckUtils]: 40: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,600 INFO L272 TraceCheckUtils]: 41: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {9571#true} is VALID [2022-02-20 23:24:19,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {9571#true} #t~loopctr192 := 0; {9571#true} is VALID [2022-02-20 23:24:19,600 INFO L290 TraceCheckUtils]: 43: Hoare triple {9571#true} assume !(#t~loopctr192 % 4294967296 < #amount % 4294967296); {9571#true} is VALID [2022-02-20 23:24:19,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {9571#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9571#true} is VALID [2022-02-20 23:24:19,602 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9571#true} {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} #709#return; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem41#1.base, 4 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,603 INFO L272 TraceCheckUtils]: 48: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {9571#true} is VALID [2022-02-20 23:24:19,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {9571#true} #t~loopctr192 := 0; {9571#true} is VALID [2022-02-20 23:24:19,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {9571#true} assume !(#t~loopctr192 % 4294967296 < #amount % 4294967296); {9571#true} is VALID [2022-02-20 23:24:19,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {9571#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9571#true} is VALID [2022-02-20 23:24:19,604 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {9571#true} {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} #711#return; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,604 INFO L290 TraceCheckUtils]: 53: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,605 INFO L290 TraceCheckUtils]: 54: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} goto; {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} is VALID [2022-02-20 23:24:19,610 INFO L290 TraceCheckUtils]: 55: Hoare triple {9585#(not (= |ULTIMATE.start_main_~user~0#1.base| 0))} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,610 INFO L290 TraceCheckUtils]: 56: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,611 INFO L290 TraceCheckUtils]: 57: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,611 INFO L290 TraceCheckUtils]: 58: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,611 INFO L290 TraceCheckUtils]: 59: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,612 INFO L290 TraceCheckUtils]: 60: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,612 INFO L290 TraceCheckUtils]: 61: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,612 INFO L290 TraceCheckUtils]: 62: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,613 INFO L290 TraceCheckUtils]: 63: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,613 INFO L290 TraceCheckUtils]: 64: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,613 INFO L290 TraceCheckUtils]: 65: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,614 INFO L290 TraceCheckUtils]: 66: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,614 INFO L290 TraceCheckUtils]: 67: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,614 INFO L290 TraceCheckUtils]: 68: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,615 INFO L290 TraceCheckUtils]: 69: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,619 INFO L290 TraceCheckUtils]: 70: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,620 INFO L290 TraceCheckUtils]: 71: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,620 INFO L290 TraceCheckUtils]: 72: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,621 INFO L290 TraceCheckUtils]: 73: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,621 INFO L290 TraceCheckUtils]: 74: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_hf_hashv~0#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,621 INFO L290 TraceCheckUtils]: 75: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,621 INFO L290 TraceCheckUtils]: 76: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,622 INFO L290 TraceCheckUtils]: 77: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,622 INFO L290 TraceCheckUtils]: 78: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,622 INFO L290 TraceCheckUtils]: 79: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch158#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,623 INFO L290 TraceCheckUtils]: 80: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,623 INFO L290 TraceCheckUtils]: 81: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch158#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,623 INFO L290 TraceCheckUtils]: 82: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,624 INFO L290 TraceCheckUtils]: 83: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch158#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,625 INFO L290 TraceCheckUtils]: 84: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,625 INFO L290 TraceCheckUtils]: 85: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch158#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,625 INFO L290 TraceCheckUtils]: 86: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,626 INFO L290 TraceCheckUtils]: 87: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch158#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,626 INFO L290 TraceCheckUtils]: 88: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,627 INFO L290 TraceCheckUtils]: 89: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch158#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,627 INFO L290 TraceCheckUtils]: 90: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,627 INFO L290 TraceCheckUtils]: 91: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch158#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,628 INFO L290 TraceCheckUtils]: 92: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,628 INFO L290 TraceCheckUtils]: 93: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,628 INFO L290 TraceCheckUtils]: 94: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,628 INFO L290 TraceCheckUtils]: 95: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch158#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem167#1 % 256);havoc main_#t~mem167#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,629 INFO L290 TraceCheckUtils]: 96: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,629 INFO L290 TraceCheckUtils]: 97: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch158#1;call main_#t~mem168#1 := read~int(main_~_hj_key~1#1.base, 1 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 256 * (main_#t~mem168#1 % 256);havoc main_#t~mem168#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,629 INFO L290 TraceCheckUtils]: 98: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,630 INFO L290 TraceCheckUtils]: 99: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~switch158#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem169#1 % 256;havoc main_#t~mem169#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,630 INFO L290 TraceCheckUtils]: 100: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch158#1; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,630 INFO L290 TraceCheckUtils]: 101: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,631 INFO L290 TraceCheckUtils]: 102: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,631 INFO L290 TraceCheckUtils]: 103: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,631 INFO L290 TraceCheckUtils]: 104: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,631 INFO L290 TraceCheckUtils]: 105: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-20 23:24:19,632 INFO L290 TraceCheckUtils]: 106: Hoare triple {9742#(not (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {9572#false} is VALID [2022-02-20 23:24:19,632 INFO L290 TraceCheckUtils]: 107: Hoare triple {9572#false} goto; {9572#false} is VALID [2022-02-20 23:24:19,632 INFO L290 TraceCheckUtils]: 108: Hoare triple {9572#false} goto; {9572#false} is VALID [2022-02-20 23:24:19,632 INFO L290 TraceCheckUtils]: 109: Hoare triple {9572#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {9572#false} is VALID [2022-02-20 23:24:19,632 INFO L290 TraceCheckUtils]: 110: Hoare triple {9572#false} assume !false; {9572#false} is VALID [2022-02-20 23:24:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:24:19,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:19,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:19,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278175758] [2022-02-20 23:24:19,633 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:19,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164331072] [2022-02-20 23:24:19,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164331072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:19,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:19,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:24:19,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007631132] [2022-02-20 23:24:19,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:19,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-02-20 23:24:19,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:19,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:19,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:19,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:24:19,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:19,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:24:19,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:24:19,728 INFO L87 Difference]: Start difference. First operand 291 states and 354 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:20,297 INFO L93 Difference]: Finished difference Result 474 states and 579 transitions. [2022-02-20 23:24:20,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:24:20,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 111 [2022-02-20 23:24:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2022-02-20 23:24:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:20,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2022-02-20 23:24:20,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 473 transitions. [2022-02-20 23:24:20,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 473 edges. 473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:20,689 INFO L225 Difference]: With dead ends: 474 [2022-02-20 23:24:20,689 INFO L226 Difference]: Without dead ends: 231 [2022-02-20 23:24:20,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:24:20,690 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 274 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:24:20,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 299 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:24:20,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-02-20 23:24:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-02-20 23:24:20,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:20,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 231 states, 219 states have (on average 1.187214611872146) internal successors, (260), 225 states have internal predecessors, (260), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:20,721 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 231 states, 219 states have (on average 1.187214611872146) internal successors, (260), 225 states have internal predecessors, (260), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:20,721 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 231 states, 219 states have (on average 1.187214611872146) internal successors, (260), 225 states have internal predecessors, (260), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:20,725 INFO L93 Difference]: Finished difference Result 231 states and 276 transitions. [2022-02-20 23:24:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 276 transitions. [2022-02-20 23:24:20,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:20,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:20,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 219 states have (on average 1.187214611872146) internal successors, (260), 225 states have internal predecessors, (260), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 231 states. [2022-02-20 23:24:20,727 INFO L87 Difference]: Start difference. First operand has 231 states, 219 states have (on average 1.187214611872146) internal successors, (260), 225 states have internal predecessors, (260), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 231 states. [2022-02-20 23:24:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:20,731 INFO L93 Difference]: Finished difference Result 231 states and 276 transitions. [2022-02-20 23:24:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 276 transitions. [2022-02-20 23:24:20,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:20,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:20,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:20,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 219 states have (on average 1.187214611872146) internal successors, (260), 225 states have internal predecessors, (260), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:24:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 276 transitions. [2022-02-20 23:24:20,736 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 276 transitions. Word has length 111 [2022-02-20 23:24:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:20,736 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 276 transitions. [2022-02-20 23:24:20,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:24:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 276 transitions. [2022-02-20 23:24:20,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-20 23:24:20,737 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:20,737 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:24:20,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:24:20,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:20,958 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:24:20,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:24:20,958 INFO L85 PathProgramCache]: Analyzing trace with hash 379973459, now seen corresponding path program 1 times [2022-02-20 23:24:20,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:24:20,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072626215] [2022-02-20 23:24:20,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:20,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:24:21,013 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:24:21,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [211974427] [2022-02-20 23:24:21,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:24:21,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:24:21,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:24:21,027 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:24:21,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 23:24:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:58,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:24:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:24:58,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:24:58,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {11215#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; {11215#true} is VALID [2022-02-20 23:24:58,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {11215#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~mem9#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem13#1, main_#t~mem12#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem17#1, main_#t~mem16#1, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem21#1, main_#t~mem20#1, main_#t~mem22#1, main_#t~mem23#1, main_#t~switch24#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1, main_#t~mem29#1, main_#t~mem30#1, main_#t~mem31#1, main_#t~mem32#1, main_#t~mem33#1, main_#t~mem34#1, main_#t~mem35#1, main_~_hj_i~0#1, main_~_hj_j~0#1, main_~_hj_k~0#1, main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem46#1.base, main_#t~mem46#1.offset, main_#t~mem47#1.base, main_#t~mem47#1.offset, main_#t~mem48#1.base, main_#t~mem48#1.offset, main_#t~mem49#1.base, main_#t~mem49#1.offset, main_#t~mem50#1.base, main_#t~mem50#1.offset, main_#t~mem51#1.base, main_#t~mem51#1.offset, main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset, main_#t~mem53#1.base, main_#t~mem53#1.offset, main_#t~mem54#1.base, main_#t~mem54#1.offset, main_#t~mem55#1.base, main_#t~mem55#1.offset, main_#t~mem56#1.base, main_#t~mem56#1.offset, main_#t~mem57#1, main_#t~mem58#1.base, main_#t~mem58#1.offset, main_#t~mem59#1.base, main_#t~mem59#1.offset, main_#t~mem60#1.base, main_#t~mem60#1.offset, main_#t~mem61#1.base, main_#t~mem61#1.offset, main_#t~mem62#1, main_#t~post63#1, main_#t~mem64#1.base, main_#t~mem64#1.offset, main_#t~mem65#1, main_#t~mem66#1.base, main_#t~mem66#1.offset, main_#t~mem67#1.base, main_#t~mem67#1.offset, main_#t~mem68#1, main_#t~post69#1, main_#t~mem70#1.base, main_#t~mem70#1.offset, main_#t~mem71#1.base, main_#t~mem71#1.offset, main_#t~mem72#1.base, main_#t~mem72#1.offset, main_#t~mem74#1, main_#t~mem73#1, main_#t~mem75#1.base, main_#t~mem75#1.offset, main_#t~mem76#1, main_#t~short77#1, main_#t~mem78#1.base, main_#t~mem78#1.offset, main_#t~mem79#1, main_#t~malloc80#1.base, main_#t~malloc80#1.offset, main_#t~mem81#1.base, main_#t~mem81#1.offset, main_#t~mem82#1.base, main_#t~mem82#1.offset, main_#t~mem83#1.base, main_#t~mem83#1.offset, main_#t~mem84#1, main_#t~memset~res85#1.base, main_#t~memset~res85#1.offset, main_#t~mem86#1.base, main_#t~mem86#1.offset, main_#t~mem87#1.base, main_#t~mem87#1.offset, main_#t~mem90#1, main_#t~mem88#1.base, main_#t~mem88#1.offset, main_#t~mem89#1, main_#t~mem91#1.base, main_#t~mem91#1.offset, main_#t~mem94#1, main_#t~mem92#1.base, main_#t~mem92#1.offset, main_#t~mem93#1, main_#t~ite95#1, main_#t~mem96#1.base, main_#t~mem96#1.offset, main_#t~mem100#1.base, main_#t~mem100#1.offset, main_#t~mem101#1.base, main_#t~mem101#1.offset, main_#t~mem102#1.base, main_#t~mem102#1.offset, main_#t~mem103#1.base, main_#t~mem103#1.offset, main_#t~mem106#1, main_#t~mem104#1.base, main_#t~mem104#1.offset, main_#t~mem105#1, main_#t~mem107#1.base, main_#t~mem107#1.offset, main_#t~mem108#1, main_#t~pre109#1, main_#t~mem110#1.base, main_#t~mem110#1.offset, main_#t~mem111#1, main_#t~mem112#1.base, main_#t~mem112#1.offset, main_#t~mem113#1, main_#t~post114#1, main_#t~mem118#1, main_#t~mem116#1, main_#t~mem115#1.base, main_#t~mem115#1.offset, main_#t~mem117#1, main_#t~mem119#1, main_#t~post120#1, main_#t~mem121#1.base, main_#t~mem121#1.offset, main_#t~mem122#1.base, main_#t~mem122#1.offset, main_#t~mem123#1.base, main_#t~mem123#1.offset, main_#t~post97#1, main_#t~mem98#1.base, main_#t~mem98#1.offset, main_#t~mem99#1, main_#t~mem124#1.base, main_#t~mem124#1.offset, main_#t~mem125#1.base, main_#t~mem125#1.offset, main_#t~mem126#1.base, main_#t~mem126#1.offset, main_#t~mem127#1, main_#t~mem128#1.base, main_#t~mem128#1.offset, main_#t~mem129#1, main_#t~post130#1, main_#t~mem131#1.base, main_#t~mem131#1.offset, main_#t~mem132#1.base, main_#t~mem132#1.offset, main_#t~mem133#1.base, main_#t~mem133#1.offset, main_#t~mem134#1.base, main_#t~mem134#1.offset, main_#t~mem137#1, main_#t~mem135#1.base, main_#t~mem135#1.offset, main_#t~mem136#1, main_#t~ite140#1, main_#t~mem138#1.base, main_#t~mem138#1.offset, main_#t~mem139#1, main_#t~mem141#1.base, main_#t~mem141#1.offset, main_#t~mem142#1, main_#t~mem143#1.base, main_#t~mem143#1.offset, main_~_he_bkt~0#1, main_~_he_bkt_i~0#1, main_~_he_thh~0#1.base, main_~_he_thh~0#1.offset, main_~_he_hh_nxt~0#1.base, main_~_he_hh_nxt~0#1.offset, main_~#_he_new_buckets~0#1.base, main_~#_he_new_buckets~0#1.offset, main_~_he_newbkt~0#1.base, main_~_he_newbkt~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, main_~_ha_bkt~0#1, main_~_ha_hashv~0#1, main_#t~mem5#1, main_#t~post6#1, main_#t~mem7#1, main_#t~mem147#1, main_#t~mem146#1, main_#t~mem148#1, main_#t~mem149#1, main_#t~mem151#1, main_#t~mem150#1, main_#t~mem152#1, main_#t~mem153#1, main_#t~mem155#1, main_#t~mem154#1, main_#t~mem156#1, main_#t~mem157#1, main_#t~switch158#1, main_#t~mem159#1, main_#t~mem160#1, main_#t~mem161#1, main_#t~mem162#1, main_#t~mem163#1, main_#t~mem164#1, main_#t~mem165#1, main_#t~mem166#1, main_#t~mem167#1, main_#t~mem168#1, main_#t~mem169#1, main_~_hj_i~1#1, main_~_hj_j~1#1, main_~_hj_k~1#1, main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, main_#t~mem170#1.base, main_#t~mem170#1.offset, main_#t~mem171#1, main_#t~mem172#1.base, main_#t~mem172#1.offset, main_#t~mem173#1.base, main_#t~mem173#1.offset, main_#t~mem174#1.base, main_#t~mem174#1.offset, main_#t~mem175#1.base, main_#t~mem175#1.offset, main_#t~mem176#1.base, main_#t~mem176#1.offset, main_#t~mem177#1.base, main_#t~mem177#1.offset, main_#t~mem178#1.base, main_#t~mem178#1.offset, main_#t~mem179#1, main_#t~mem180#1, main_#t~mem181#1, main_#t~short182#1, main_#t~mem183#1.base, main_#t~mem183#1.offset, main_#t~ret184#1, main_#t~mem185#1.base, main_#t~mem185#1.offset, main_#t~mem186#1.base, main_#t~mem186#1.offset, main_#t~mem187#1.base, main_#t~mem187#1.offset, main_#t~mem188#1, main_~_hf_bkt~0#1, main_~_hf_hashv~0#1, main_#t~mem189#1, main_#t~mem190#1, main_#t~mem144#1, main_#t~mem145#1, main_~#i~0#1.base, main_~#i~0#1.offset, main_~user~0#1.base, main_~user~0#1.offset, main_~tmp~0#1.base, main_~tmp~0#1.offset, main_~users~0#1.base, main_~users~0#1.offset;call main_~#i~0#1.base, main_~#i~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~user~0#1.base, main_~user~0#1.offset;havoc main_~tmp~0#1.base, main_~tmp~0#1.offset;main_~users~0#1.base, main_~users~0#1.offset := 0, 0;call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11215#true} is VALID [2022-02-20 23:24:58,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {11215#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11215#true} is VALID [2022-02-20 23:24:58,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {11215#true} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {11215#true} is VALID [2022-02-20 23:24:58,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {11215#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {11215#true} is VALID [2022-02-20 23:24:58,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {11215#true} call main_#t~mem9#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem9#1, main_~user~0#1.base, main_~user~0#1.offset, 4);havoc main_#t~mem9#1;call main_#t~mem10#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call main_#t~mem11#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);call write~int(main_#t~mem10#1 * main_#t~mem11#1, main_~user~0#1.base, 4 + main_~user~0#1.offset, 4);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {11215#true} is VALID [2022-02-20 23:24:58,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {11215#true} havoc main_~_ha_hashv~0#1; {11215#true} is VALID [2022-02-20 23:24:58,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {11215#true} goto; {11215#true} is VALID [2022-02-20 23:24:58,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {11215#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; {11215#true} is VALID [2022-02-20 23:24:58,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {11215#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {11215#true} is VALID [2022-02-20 23:24:58,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {11215#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {11215#true} assume !main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {11215#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {11215#true} assume !main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {11215#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {11215#true} assume !main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {11215#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {11215#true} assume !main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {11215#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {11215#true} assume !main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {11215#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {11215#true} assume !main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 22: Hoare triple {11215#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {11215#true} assume !main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {11215#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {11215#true} assume main_#t~switch24#1;call main_#t~mem32#1 := read~int(main_~_hj_key~0#1.base, 3 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 16777216 * (main_#t~mem32#1 % 256);havoc main_#t~mem32#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {11215#true} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {11215#true} is VALID [2022-02-20 23:24:58,780 INFO L290 TraceCheckUtils]: 27: Hoare triple {11215#true} assume main_#t~switch24#1;call main_#t~mem33#1 := read~int(main_~_hj_key~0#1.base, 2 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 65536 * (main_#t~mem33#1 % 256);havoc main_#t~mem33#1; {11215#true} is VALID [2022-02-20 23:24:58,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {11215#true} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {11215#true} is VALID [2022-02-20 23:24:58,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {11215#true} assume main_#t~switch24#1;call main_#t~mem34#1 := read~int(main_~_hj_key~0#1.base, 1 + main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + 256 * (main_#t~mem34#1 % 256);havoc main_#t~mem34#1; {11215#true} is VALID [2022-02-20 23:24:58,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {11215#true} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {11215#true} is VALID [2022-02-20 23:24:58,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {11215#true} assume main_#t~switch24#1;call main_#t~mem35#1 := read~int(main_~_hj_key~0#1.base, main_~_hj_key~0#1.offset, 1);main_~_hj_i~0#1 := main_~_hj_i~0#1 + main_#t~mem35#1 % 256;havoc main_#t~mem35#1; {11215#true} is VALID [2022-02-20 23:24:58,781 INFO L290 TraceCheckUtils]: 32: Hoare triple {11215#true} havoc main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:24:58,781 INFO L290 TraceCheckUtils]: 33: Hoare triple {11215#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)))); {11215#true} is VALID [2022-02-20 23:24:58,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {11215#true} goto; {11215#true} is VALID [2022-02-20 23:24:58,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {11215#true} goto; {11215#true} is VALID [2022-02-20 23:24:58,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {11215#true} goto; {11215#true} is VALID [2022-02-20 23:24:58,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {11215#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); {11215#true} is VALID [2022-02-20 23:24:58,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {11215#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); {11215#true} is VALID [2022-02-20 23:24:58,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {11215#true} call main_#t~malloc36#1.base, main_#t~malloc36#1.offset := #Ultimate.allocOnHeap(44);call write~$Pointer$(main_#t~malloc36#1.base, main_#t~malloc36#1.offset, main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);havoc main_#t~malloc36#1.base, main_#t~malloc36#1.offset;call main_#t~mem37#1.base, main_#t~mem37#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11215#true} is VALID [2022-02-20 23:24:58,782 INFO L290 TraceCheckUtils]: 40: Hoare triple {11215#true} assume !(main_#t~mem37#1.base == 0 && main_#t~mem37#1.offset == 0);havoc main_#t~mem37#1.base, main_#t~mem37#1.offset;call main_#t~mem38#1.base, main_#t~mem38#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4); {11215#true} is VALID [2022-02-20 23:24:58,782 INFO L272 TraceCheckUtils]: 41: Hoare triple {11215#true} call main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset := #Ultimate.C_memset(main_#t~mem38#1.base, main_#t~mem38#1.offset, 0, 44); {11215#true} is VALID [2022-02-20 23:24:58,782 INFO L290 TraceCheckUtils]: 42: Hoare triple {11215#true} #t~loopctr192 := 0; {11346#(= |#Ultimate.C_memset_#t~loopctr192| 0)} is VALID [2022-02-20 23:24:58,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {11346#(= |#Ultimate.C_memset_#t~loopctr192| 0)} assume !(#t~loopctr192 % 4294967296 < #amount % 4294967296); {11350#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:24:58,783 INFO L290 TraceCheckUtils]: 44: Hoare triple {11350#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11350#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} is VALID [2022-02-20 23:24:58,784 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11350#(not (< 0 (mod |#Ultimate.C_memset_#amount| 4294967296)))} {11215#true} #709#return; {11216#false} is VALID [2022-02-20 23:24:58,784 INFO L290 TraceCheckUtils]: 46: Hoare triple {11216#false} havoc main_#t~mem38#1.base, main_#t~mem38#1.offset;havoc main_#t~memset~res39#1.base, main_#t~memset~res39#1.offset;call main_#t~mem40#1.base, main_#t~mem40#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem40#1.base, 16 + main_#t~mem40#1.offset, 4);havoc main_#t~mem40#1.base, main_#t~mem40#1.offset;call main_#t~mem41#1.base, main_#t~mem41#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(32, main_#t~mem41#1.base, 4 + main_#t~mem41#1.offset, 4);havoc main_#t~mem41#1.base, main_#t~mem41#1.offset;call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(5, main_#t~mem42#1.base, 8 + main_#t~mem42#1.offset, 4);havoc main_#t~mem42#1.base, main_#t~mem42#1.offset;call main_#t~mem43#1.base, main_#t~mem43#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int((if 8 + main_~user~0#1.offset - main_~user~0#1.offset < 0 && 0 != (8 + main_~user~0#1.offset - main_~user~0#1.offset) % 1 then 1 + (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1 else (8 + main_~user~0#1.offset - main_~user~0#1.offset) / 1), main_#t~mem43#1.base, 20 + main_#t~mem43#1.offset, 4);havoc main_#t~mem43#1.base, main_#t~mem43#1.offset;call main_#t~mem44#1.base, main_#t~mem44#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~malloc45#1.base, main_#t~malloc45#1.offset := #Ultimate.allocOnHeap(384);call write~$Pointer$(main_#t~malloc45#1.base, main_#t~malloc45#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, 4);havoc main_#t~mem44#1.base, main_#t~mem44#1.offset;havoc main_#t~malloc45#1.base, main_#t~malloc45#1.offset;call main_#t~mem46#1.base, main_#t~mem46#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call write~int(2685476833, main_#t~mem46#1.base, 40 + main_#t~mem46#1.offset, 4);havoc main_#t~mem46#1.base, main_#t~mem46#1.offset;call main_#t~mem47#1.base, main_#t~mem47#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem48#1.base, main_#t~mem48#1.offset := read~$Pointer$(main_#t~mem47#1.base, main_#t~mem47#1.offset, 4); {11216#false} is VALID [2022-02-20 23:24:58,784 INFO L290 TraceCheckUtils]: 47: Hoare triple {11216#false} assume !(main_#t~mem48#1.base == 0 && main_#t~mem48#1.offset == 0);havoc main_#t~mem47#1.base, main_#t~mem47#1.offset;havoc main_#t~mem48#1.base, main_#t~mem48#1.offset;call main_#t~mem50#1.base, main_#t~mem50#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem51#1.base, main_#t~mem51#1.offset := read~$Pointer$(main_#t~mem50#1.base, main_#t~mem50#1.offset, 4); {11216#false} is VALID [2022-02-20 23:24:58,784 INFO L272 TraceCheckUtils]: 48: Hoare triple {11216#false} call main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset := #Ultimate.C_memset(main_#t~mem51#1.base, main_#t~mem51#1.offset, 0, 384); {11216#false} is VALID [2022-02-20 23:24:58,784 INFO L290 TraceCheckUtils]: 49: Hoare triple {11216#false} #t~loopctr192 := 0; {11216#false} is VALID [2022-02-20 23:24:58,784 INFO L290 TraceCheckUtils]: 50: Hoare triple {11216#false} assume !(#t~loopctr192 % 4294967296 < #amount % 4294967296); {11216#false} is VALID [2022-02-20 23:24:58,784 INFO L290 TraceCheckUtils]: 51: Hoare triple {11216#false} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11216#false} is VALID [2022-02-20 23:24:58,785 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11216#false} {11216#false} #711#return; {11216#false} is VALID [2022-02-20 23:24:58,785 INFO L290 TraceCheckUtils]: 53: Hoare triple {11216#false} havoc main_#t~mem50#1.base, main_#t~mem50#1.offset;havoc main_#t~mem51#1.base, main_#t~mem51#1.offset;havoc main_#t~memset~res52#1.base, main_#t~memset~res52#1.offset; {11216#false} is VALID [2022-02-20 23:24:58,790 INFO L290 TraceCheckUtils]: 54: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,790 INFO L290 TraceCheckUtils]: 55: Hoare triple {11216#false} main_~users~0#1.base, main_~users~0#1.offset := main_~user~0#1.base, main_~user~0#1.offset; {11216#false} is VALID [2022-02-20 23:24:58,790 INFO L290 TraceCheckUtils]: 56: Hoare triple {11216#false} havoc main_~_ha_bkt~0#1;call main_#t~mem61#1.base, main_#t~mem61#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem62#1 := read~int(main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);main_#t~post63#1 := main_#t~mem62#1;call write~int(1 + main_#t~post63#1, main_#t~mem61#1.base, 12 + main_#t~mem61#1.offset, 4);havoc main_#t~mem61#1.base, main_#t~mem61#1.offset;havoc main_#t~mem62#1;havoc main_#t~post63#1; {11216#false} is VALID [2022-02-20 23:24:58,791 INFO L290 TraceCheckUtils]: 57: Hoare triple {11216#false} call main_#t~mem64#1.base, main_#t~mem64#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem65#1 := read~int(main_#t~mem64#1.base, 4 + main_#t~mem64#1.offset, 4);main_~_ha_bkt~0#1 := (if 0 == main_~_ha_hashv~0#1 || 0 == main_#t~mem65#1 - 1 then 0 else (if 1 == main_#t~mem65#1 - 1 then (if 1 == main_~_ha_hashv~0#1 || 0 == main_~_ha_hashv~0#1 then main_~_ha_hashv~0#1 else (if main_~_ha_hashv~0#1 >= 0 then main_~_ha_hashv~0#1 % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else (if 1 == main_~_ha_hashv~0#1 then (if 1 == main_#t~mem65#1 - 1 || 0 == main_#t~mem65#1 - 1 then main_#t~mem65#1 - 1 else (if main_#t~mem65#1 - 1 >= 0 then (main_#t~mem65#1 - 1) % 2 else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))) else ~bitwiseAnd(main_~_ha_hashv~0#1, main_#t~mem65#1 - 1))));havoc main_#t~mem64#1.base, main_#t~mem64#1.offset;havoc main_#t~mem65#1; {11216#false} is VALID [2022-02-20 23:24:58,791 INFO L290 TraceCheckUtils]: 58: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,791 INFO L290 TraceCheckUtils]: 59: Hoare triple {11216#false} call main_#t~mem66#1.base, main_#t~mem66#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem67#1.base, main_#t~mem67#1.offset := read~$Pointer$(main_#t~mem66#1.base, main_#t~mem66#1.offset, 4);main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset := main_#t~mem67#1.base, main_#t~mem67#1.offset + 12 * (if main_~_ha_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_ha_bkt~0#1 % 4294967296 % 4294967296 else main_~_ha_bkt~0#1 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~mem66#1.base, main_#t~mem66#1.offset;havoc main_#t~mem67#1.base, main_#t~mem67#1.offset;call main_#t~mem68#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);main_#t~post69#1 := main_#t~mem68#1;call write~int(1 + main_#t~post69#1, main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);havoc main_#t~mem68#1;havoc main_#t~post69#1;call main_#t~mem70#1.base, main_#t~mem70#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_#t~mem70#1.base, main_#t~mem70#1.offset, main_~user~0#1.base, 24 + main_~user~0#1.offset, 4);havoc main_#t~mem70#1.base, main_#t~mem70#1.offset;call write~$Pointer$(0, 0, main_~user~0#1.base, 20 + main_~user~0#1.offset, 4);call main_#t~mem71#1.base, main_#t~mem71#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4); {11216#false} is VALID [2022-02-20 23:24:58,791 INFO L290 TraceCheckUtils]: 60: Hoare triple {11216#false} assume main_#t~mem71#1.base != 0 || main_#t~mem71#1.offset != 0;havoc main_#t~mem71#1.base, main_#t~mem71#1.offset;call main_#t~mem72#1.base, main_#t~mem72#1.offset := read~$Pointer$(main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_#t~mem72#1.base, 12 + main_#t~mem72#1.offset, 4);havoc main_#t~mem72#1.base, main_#t~mem72#1.offset; {11216#false} is VALID [2022-02-20 23:24:58,791 INFO L290 TraceCheckUtils]: 61: Hoare triple {11216#false} call write~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, main_~_ha_head~0#1.base, main_~_ha_head~0#1.offset, 4);call main_#t~mem74#1 := read~int(main_~_ha_head~0#1.base, 4 + main_~_ha_head~0#1.offset, 4);call main_#t~mem73#1 := read~int(main_~_ha_head~0#1.base, 8 + main_~_ha_head~0#1.offset, 4);main_#t~short77#1 := main_#t~mem74#1 % 4294967296 >= 10 * (1 + main_#t~mem73#1) % 4294967296; {11216#false} is VALID [2022-02-20 23:24:58,791 INFO L290 TraceCheckUtils]: 62: Hoare triple {11216#false} assume main_#t~short77#1;call main_#t~mem75#1.base, main_#t~mem75#1.offset := read~$Pointer$(main_~user~0#1.base, 8 + main_~user~0#1.offset, 4);call main_#t~mem76#1 := read~int(main_#t~mem75#1.base, 36 + main_#t~mem75#1.offset, 4);main_#t~short77#1 := 0 == main_#t~mem76#1 % 4294967296; {11216#false} is VALID [2022-02-20 23:24:58,791 INFO L290 TraceCheckUtils]: 63: Hoare triple {11216#false} assume !main_#t~short77#1;havoc main_#t~mem74#1;havoc main_#t~mem73#1;havoc main_#t~mem75#1.base, main_#t~mem75#1.offset;havoc main_#t~mem76#1;havoc main_#t~short77#1; {11216#false} is VALID [2022-02-20 23:24:58,792 INFO L290 TraceCheckUtils]: 64: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,792 INFO L290 TraceCheckUtils]: 65: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,792 INFO L290 TraceCheckUtils]: 66: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,792 INFO L290 TraceCheckUtils]: 67: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,792 INFO L290 TraceCheckUtils]: 68: Hoare triple {11216#false} call main_#t~mem5#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4);main_#t~post6#1 := main_#t~mem5#1;call write~int(1 + main_#t~post6#1, main_~#i~0#1.base, main_~#i~0#1.offset, 4);havoc main_#t~mem5#1;havoc main_#t~post6#1; {11216#false} is VALID [2022-02-20 23:24:58,792 INFO L290 TraceCheckUtils]: 69: Hoare triple {11216#false} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11216#false} is VALID [2022-02-20 23:24:58,792 INFO L290 TraceCheckUtils]: 70: Hoare triple {11216#false} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {11216#false} is VALID [2022-02-20 23:24:58,792 INFO L290 TraceCheckUtils]: 71: Hoare triple {11216#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11216#false} is VALID [2022-02-20 23:24:58,793 INFO L290 TraceCheckUtils]: 72: Hoare triple {11216#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {11216#false} is VALID [2022-02-20 23:24:58,793 INFO L290 TraceCheckUtils]: 73: Hoare triple {11216#false} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {11216#false} is VALID [2022-02-20 23:24:58,793 INFO L290 TraceCheckUtils]: 74: Hoare triple {11216#false} havoc main_~_hf_hashv~0#1; {11216#false} is VALID [2022-02-20 23:24:58,793 INFO L290 TraceCheckUtils]: 75: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,793 INFO L290 TraceCheckUtils]: 76: Hoare triple {11216#false} havoc main_~_hj_i~1#1;havoc main_~_hj_j~1#1;havoc main_~_hj_k~1#1;main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset := main_~#i~0#1.base, main_~#i~0#1.offset;main_~_hf_hashv~0#1 := 4276993775;main_~_hj_j~1#1 := 2654435769;main_~_hj_i~1#1 := main_~_hj_j~1#1;main_~_hj_k~1#1 := 4; {11216#false} is VALID [2022-02-20 23:24:58,793 INFO L290 TraceCheckUtils]: 77: Hoare triple {11216#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {11216#false} is VALID [2022-02-20 23:24:58,793 INFO L290 TraceCheckUtils]: 78: Hoare triple {11216#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {11216#false} is VALID [2022-02-20 23:24:58,793 INFO L290 TraceCheckUtils]: 79: Hoare triple {11216#false} assume !main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:24:58,793 INFO L290 TraceCheckUtils]: 80: Hoare triple {11216#false} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {11216#false} is VALID [2022-02-20 23:24:58,794 INFO L290 TraceCheckUtils]: 81: Hoare triple {11216#false} assume !main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:24:58,794 INFO L290 TraceCheckUtils]: 82: Hoare triple {11216#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {11216#false} is VALID [2022-02-20 23:24:58,794 INFO L290 TraceCheckUtils]: 83: Hoare triple {11216#false} assume !main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:24:58,794 INFO L290 TraceCheckUtils]: 84: Hoare triple {11216#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {11216#false} is VALID [2022-02-20 23:24:58,794 INFO L290 TraceCheckUtils]: 85: Hoare triple {11216#false} assume !main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:24:58,794 INFO L290 TraceCheckUtils]: 86: Hoare triple {11216#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {11216#false} is VALID [2022-02-20 23:24:58,794 INFO L290 TraceCheckUtils]: 87: Hoare triple {11216#false} assume !main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:24:58,794 INFO L290 TraceCheckUtils]: 88: Hoare triple {11216#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {11216#false} is VALID [2022-02-20 23:24:58,795 INFO L290 TraceCheckUtils]: 89: Hoare triple {11216#false} assume !main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:24:58,795 INFO L290 TraceCheckUtils]: 90: Hoare triple {11216#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {11216#false} is VALID [2022-02-20 23:24:58,795 INFO L290 TraceCheckUtils]: 91: Hoare triple {11216#false} assume !main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:24:58,795 INFO L290 TraceCheckUtils]: 92: Hoare triple {11216#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {11216#false} is VALID [2022-02-20 23:24:58,795 INFO L290 TraceCheckUtils]: 93: Hoare triple {11216#false} assume main_#t~switch158#1;call main_#t~mem166#1 := read~int(main_~_hj_key~1#1.base, 3 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 16777216 * (main_#t~mem166#1 % 256);havoc main_#t~mem166#1; {11216#false} is VALID [2022-02-20 23:24:58,795 INFO L290 TraceCheckUtils]: 94: Hoare triple {11216#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {11216#false} is VALID [2022-02-20 23:24:58,795 INFO L290 TraceCheckUtils]: 95: Hoare triple {11216#false} assume main_#t~switch158#1;call main_#t~mem167#1 := read~int(main_~_hj_key~1#1.base, 2 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 65536 * (main_#t~mem167#1 % 256);havoc main_#t~mem167#1; {11216#false} is VALID [2022-02-20 23:24:58,795 INFO L290 TraceCheckUtils]: 96: Hoare triple {11216#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {11216#false} is VALID [2022-02-20 23:24:58,796 INFO L290 TraceCheckUtils]: 97: Hoare triple {11216#false} assume main_#t~switch158#1;call main_#t~mem168#1 := read~int(main_~_hj_key~1#1.base, 1 + main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + 256 * (main_#t~mem168#1 % 256);havoc main_#t~mem168#1; {11216#false} is VALID [2022-02-20 23:24:58,796 INFO L290 TraceCheckUtils]: 98: Hoare triple {11216#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {11216#false} is VALID [2022-02-20 23:24:58,796 INFO L290 TraceCheckUtils]: 99: Hoare triple {11216#false} assume main_#t~switch158#1;call main_#t~mem169#1 := read~int(main_~_hj_key~1#1.base, main_~_hj_key~1#1.offset, 1);main_~_hj_i~1#1 := main_~_hj_i~1#1 + main_#t~mem169#1 % 256;havoc main_#t~mem169#1; {11216#false} is VALID [2022-02-20 23:24:58,796 INFO L290 TraceCheckUtils]: 100: Hoare triple {11216#false} havoc main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:24:58,796 INFO L290 TraceCheckUtils]: 101: Hoare triple {11216#false} main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8192 || 0 == main_~_hf_hashv~0#1 / 8192) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8192 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8192 else (if 0 == main_~_hf_hashv~0#1 / 8192 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8192))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 256 * main_~_hj_i~1#1 || 0 == 256 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 256 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 256 * main_~_hj_i~1#1 else (if 0 == 256 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 256 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 8192 || 0 == main_~_hj_j~1#1 / 8192) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 8192 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 8192 else (if 0 == main_~_hj_j~1#1 / 8192 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 8192))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 4096 || 0 == main_~_hf_hashv~0#1 / 4096) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 4096 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 4096 else (if 0 == main_~_hf_hashv~0#1 / 4096 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 4096))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 65536 * main_~_hj_i~1#1 || 0 == 65536 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 65536 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 65536 * main_~_hj_i~1#1 else (if 0 == 65536 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 65536 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32 || 0 == main_~_hj_j~1#1 / 32) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32 else (if 0 == main_~_hj_j~1#1 / 32 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32))));main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hj_j~1#1;main_~_hj_i~1#1 := main_~_hj_i~1#1 - main_~_hf_hashv~0#1;main_~_hj_i~1#1 := (if (1 == main_~_hj_i~1#1 || 0 == main_~_hj_i~1#1) && (1 == main_~_hf_hashv~0#1 / 8 || 0 == main_~_hf_hashv~0#1 / 8) then (if main_~_hj_i~1#1 == main_~_hf_hashv~0#1 / 8 then 0 else 1) else (if 0 == main_~_hj_i~1#1 then main_~_hf_hashv~0#1 / 8 else (if 0 == main_~_hf_hashv~0#1 / 8 then main_~_hj_i~1#1 else ~bitwiseXOr(main_~_hj_i~1#1, main_~_hf_hashv~0#1 / 8))));main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hf_hashv~0#1;main_~_hj_j~1#1 := main_~_hj_j~1#1 - main_~_hj_i~1#1;main_~_hj_j~1#1 := (if (1 == main_~_hj_j~1#1 || 0 == main_~_hj_j~1#1) && (1 == 1024 * main_~_hj_i~1#1 || 0 == 1024 * main_~_hj_i~1#1) then (if main_~_hj_j~1#1 == 1024 * main_~_hj_i~1#1 then 0 else 1) else (if 0 == main_~_hj_j~1#1 then 1024 * main_~_hj_i~1#1 else (if 0 == 1024 * main_~_hj_i~1#1 then main_~_hj_j~1#1 else ~bitwiseXOr(main_~_hj_j~1#1, 1024 * main_~_hj_i~1#1))));main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_i~1#1;main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 - main_~_hj_j~1#1;main_~_hf_hashv~0#1 := (if (1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1) && (1 == main_~_hj_j~1#1 / 32768 || 0 == main_~_hj_j~1#1 / 32768) then (if main_~_hf_hashv~0#1 == main_~_hj_j~1#1 / 32768 then 0 else 1) else (if 0 == main_~_hf_hashv~0#1 then main_~_hj_j~1#1 / 32768 else (if 0 == main_~_hj_j~1#1 / 32768 then main_~_hf_hashv~0#1 else ~bitwiseXOr(main_~_hf_hashv~0#1, main_~_hj_j~1#1 / 32768)))); {11216#false} is VALID [2022-02-20 23:24:58,796 INFO L290 TraceCheckUtils]: 102: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,796 INFO L290 TraceCheckUtils]: 103: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,796 INFO L290 TraceCheckUtils]: 104: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,797 INFO L290 TraceCheckUtils]: 105: Hoare triple {11216#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {11216#false} is VALID [2022-02-20 23:24:58,797 INFO L290 TraceCheckUtils]: 106: Hoare triple {11216#false} assume main_~users~0#1.base != 0 || main_~users~0#1.offset != 0;havoc main_~_hf_bkt~0#1; {11216#false} is VALID [2022-02-20 23:24:58,797 INFO L290 TraceCheckUtils]: 107: Hoare triple {11216#false} call main_#t~mem170#1.base, main_#t~mem170#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem171#1 := read~int(main_#t~mem170#1.base, 4 + main_#t~mem170#1.offset, 4);main_~_hf_bkt~0#1 := (if 0 == main_~_hf_hashv~0#1 || 0 == main_#t~mem171#1 - 1 then 0 else (if 1 == main_#t~mem171#1 - 1 then (if 1 == main_~_hf_hashv~0#1 || 0 == main_~_hf_hashv~0#1 then main_~_hf_hashv~0#1 else (if main_~_hf_hashv~0#1 >= 0 then main_~_hf_hashv~0#1 % 2 else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem171#1 - 1))) else (if 1 == main_~_hf_hashv~0#1 then (if 1 == main_#t~mem171#1 - 1 || 0 == main_#t~mem171#1 - 1 then main_#t~mem171#1 - 1 else (if main_#t~mem171#1 - 1 >= 0 then (main_#t~mem171#1 - 1) % 2 else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem171#1 - 1))) else ~bitwiseAnd(main_~_hf_hashv~0#1, main_#t~mem171#1 - 1))));havoc main_#t~mem170#1.base, main_#t~mem170#1.offset;havoc main_#t~mem171#1; {11216#false} is VALID [2022-02-20 23:24:58,797 INFO L290 TraceCheckUtils]: 108: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,797 INFO L290 TraceCheckUtils]: 109: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,797 INFO L290 TraceCheckUtils]: 110: Hoare triple {11216#false} call main_#t~mem172#1.base, main_#t~mem172#1.offset := read~$Pointer$(main_~users~0#1.base, 8 + main_~users~0#1.offset, 4);call main_#t~mem173#1.base, main_#t~mem173#1.offset := read~$Pointer$(main_#t~mem172#1.base, main_#t~mem172#1.offset, 4);call main_#t~mem174#1.base, main_#t~mem174#1.offset := read~$Pointer$(main_#t~mem173#1.base, main_#t~mem173#1.offset + 12 * (if main_~_hf_bkt~0#1 % 4294967296 % 4294967296 <= 2147483647 then main_~_hf_bkt~0#1 % 4294967296 % 4294967296 else main_~_hf_bkt~0#1 % 4294967296 % 4294967296 - 4294967296), 4); {11216#false} is VALID [2022-02-20 23:24:58,798 INFO L290 TraceCheckUtils]: 111: Hoare triple {11216#false} assume !(main_#t~mem174#1.base != 0 || main_#t~mem174#1.offset != 0);havoc main_#t~mem172#1.base, main_#t~mem172#1.offset;havoc main_#t~mem173#1.base, main_#t~mem173#1.offset;havoc main_#t~mem174#1.base, main_#t~mem174#1.offset;main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {11216#false} is VALID [2022-02-20 23:24:58,798 INFO L290 TraceCheckUtils]: 112: Hoare triple {11216#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {11216#false} is VALID [2022-02-20 23:24:58,798 INFO L290 TraceCheckUtils]: 113: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,798 INFO L290 TraceCheckUtils]: 114: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,798 INFO L290 TraceCheckUtils]: 115: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:24:58,798 INFO L290 TraceCheckUtils]: 116: Hoare triple {11216#false} assume !(main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0); {11216#false} is VALID [2022-02-20 23:24:58,798 INFO L290 TraceCheckUtils]: 117: Hoare triple {11216#false} assume !false; {11216#false} is VALID [2022-02-20 23:24:58,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:24:58,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:24:58,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:24:58,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072626215] [2022-02-20 23:24:58,799 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:24:58,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211974427] [2022-02-20 23:24:58,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211974427] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:24:58,799 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:24:58,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:24:58,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492163892] [2022-02-20 23:24:58,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:24:58,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2022-02-20 23:24:58,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:24:58,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:24:58,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:58,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:24:58,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:24:58,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:24:58,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:24:58,891 INFO L87 Difference]: Start difference. First operand 231 states and 276 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:24:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:59,452 INFO L93 Difference]: Finished difference Result 414 states and 501 transitions. [2022-02-20 23:24:59,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:24:59,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 118 [2022-02-20 23:24:59,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:24:59,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:24:59,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2022-02-20 23:24:59,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:24:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2022-02-20 23:24:59,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 427 transitions. [2022-02-20 23:24:59,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:24:59,787 INFO L225 Difference]: With dead ends: 414 [2022-02-20 23:24:59,787 INFO L226 Difference]: Without dead ends: 234 [2022-02-20 23:24:59,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:24:59,788 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 2 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 629 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-20 23:24:59,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 629 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:24:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-02-20 23:24:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-02-20 23:24:59,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:24:59,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 234 states. Second operand has 234 states, 221 states have (on average 1.1900452488687783) internal successors, (263), 228 states have internal predecessors, (263), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 23:24:59,815 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand has 234 states, 221 states have (on average 1.1900452488687783) internal successors, (263), 228 states have internal predecessors, (263), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 23:24:59,815 INFO L87 Difference]: Start difference. First operand 234 states. Second operand has 234 states, 221 states have (on average 1.1900452488687783) internal successors, (263), 228 states have internal predecessors, (263), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 23:24:59,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:59,835 INFO L93 Difference]: Finished difference Result 234 states and 280 transitions. [2022-02-20 23:24:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2022-02-20 23:24:59,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:59,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:59,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 221 states have (on average 1.1900452488687783) internal successors, (263), 228 states have internal predecessors, (263), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) Second operand 234 states. [2022-02-20 23:24:59,836 INFO L87 Difference]: Start difference. First operand has 234 states, 221 states have (on average 1.1900452488687783) internal successors, (263), 228 states have internal predecessors, (263), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) Second operand 234 states. [2022-02-20 23:24:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:24:59,841 INFO L93 Difference]: Finished difference Result 234 states and 280 transitions. [2022-02-20 23:24:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2022-02-20 23:24:59,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:24:59,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:24:59,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:24:59,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:24:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 221 states have (on average 1.1900452488687783) internal successors, (263), 228 states have internal predecessors, (263), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2022-02-20 23:24:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 280 transitions. [2022-02-20 23:24:59,846 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 280 transitions. Word has length 118 [2022-02-20 23:24:59,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:24:59,846 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 280 transitions. [2022-02-20 23:24:59,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:24:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2022-02-20 23:24:59,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-02-20 23:24:59,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:24:59,850 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:24:59,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-20 23:25:00,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:25:00,070 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:25:00,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:25:00,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1827414795, now seen corresponding path program 1 times [2022-02-20 23:25:00,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:25:00,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602521016] [2022-02-20 23:25:00,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:25:00,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:25:00,127 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:25:00,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1760459043] [2022-02-20 23:25:00,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:25:00,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:25:00,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:25:00,144 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:25:00,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process