./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_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_JEN_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 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:27:53,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:27:53,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:27:53,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:27:53,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:27:53,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:27:53,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:27:53,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:27:53,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:27:53,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:27:53,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:27:53,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:27:53,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:27:53,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:27:53,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:27:53,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:27:53,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:27:53,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:27:53,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:27:53,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:27:53,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:27:53,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:27:53,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:27:53,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:27:53,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:27:53,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:27:53,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:27:53,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:27:53,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:27:53,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:27:53,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:27:53,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:27:53,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:27:53,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:27:53,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:27:53,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:27:53,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:27:53,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:27:53,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:27:53,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:27:53,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:27:53,912 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:27:53,938 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:27:53,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:27:53,938 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:27:53,938 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:27:53,939 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:27:53,939 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:27:53,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:27:53,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:27:53,940 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:27:53,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:27:53,941 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:27:53,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:27:53,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:27:53,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:27:53,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 23:27:53,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:27:53,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 23:27:53,942 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:27:53,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 23:27:53,942 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:27:53,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 23:27:53,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:27:53,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:27:53,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:27:53,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:27:53,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:27:53,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:27:53,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 23:27:53,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:27:53,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:27:53,944 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 23:27:53,944 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 23:27:53,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 23:27:53,945 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 -> 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 [2022-02-20 23:27:54,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:27:54,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:27:54,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:27:54,143 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:27:54,143 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:27:54,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2022-02-20 23:27:54,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cf14d46a/7b12cedcb64c47a28f7c6b933c085f37/FLAGe7a7cf360 [2022-02-20 23:27:54,556 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:27:54,557 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2022-02-20 23:27:54,572 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cf14d46a/7b12cedcb64c47a28f7c6b933c085f37/FLAGe7a7cf360 [2022-02-20 23:27:54,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cf14d46a/7b12cedcb64c47a28f7c6b933c085f37 [2022-02-20 23:27:54,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:27:54,927 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:27:54,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:27:54,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:27:54,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:27:54,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:27:54" (1/1) ... [2022-02-20 23:27:54,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a5a63b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:54, skipping insertion in model container [2022-02-20 23:27:54,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:27:54" (1/1) ... [2022-02-20 23:27:54,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:27:54,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:27:55,271 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_JEN_test2-1.i[37019,37032] [2022-02-20 23:27:55,388 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_JEN_test2-1.i[47352,47365] [2022-02-20 23:27:55,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:27:55,406 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:27:55,434 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_JEN_test2-1.i[37019,37032] [2022-02-20 23:27:55,474 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_JEN_test2-1.i[47352,47365] [2022-02-20 23:27:55,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:27:55,504 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:27:55,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:55 WrapperNode [2022-02-20 23:27:55,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:27:55,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:27:55,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:27:55,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:27:55,511 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:27:55" (1/1) ... [2022-02-20 23:27:55,530 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:27:55" (1/1) ... [2022-02-20 23:27:55,581 INFO L137 Inliner]: procedures = 208, calls = 235, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 884 [2022-02-20 23:27:55,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:27:55,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:27:55,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:27:55,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:27:55,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:55" (1/1) ... [2022-02-20 23:27:55,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:55" (1/1) ... [2022-02-20 23:27:55,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:55" (1/1) ... [2022-02-20 23:27:55,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:55" (1/1) ... [2022-02-20 23:27:55,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:55" (1/1) ... [2022-02-20 23:27:55,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:55" (1/1) ... [2022-02-20 23:27:55,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:55" (1/1) ... [2022-02-20 23:27:55,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:27:55,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:27:55,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:27:55,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:27:55,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:55" (1/1) ... [2022-02-20 23:27:55,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:27:55,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:27:55,692 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:27:55,695 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:27:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 23:27:55,720 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 23:27:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:27:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-20 23:27:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:27:55,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:27:55,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:27:55,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 23:27:55,721 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 23:27:55,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:27:55,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:27:55,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:27:55,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:27:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:27:55,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:27:55,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:27:55,914 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:27:55,915 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:27:57,380 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:27:57,392 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:27:57,392 INFO L299 CfgBuilder]: Removed 54 assume(true) statements. [2022-02-20 23:27:57,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:27:57 BoogieIcfgContainer [2022-02-20 23:27:57,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:27:57,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:27:57,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:27:57,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:27:57,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:27:54" (1/3) ... [2022-02-20 23:27:57,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa5a771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:27:57, skipping insertion in model container [2022-02-20 23:27:57,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:27:55" (2/3) ... [2022-02-20 23:27:57,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aa5a771 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:27:57, skipping insertion in model container [2022-02-20 23:27:57,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:27:57" (3/3) ... [2022-02-20 23:27:57,399 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test2-1.i [2022-02-20 23:27:57,402 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:27:57,403 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 23:27:57,432 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:27:57,437 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:27:57,437 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 23:27:57,453 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:27:57,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:27:57,456 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:27:57,456 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:27:57,457 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:27:57,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:27:57,460 INFO L85 PathProgramCache]: Analyzing trace with hash -858859523, now seen corresponding path program 1 times [2022-02-20 23:27:57,466 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:27:57,466 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873539593] [2022-02-20 23:27:57,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:57,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:27:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:57,565 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:27:57,572 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:27:57,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#true} assume !true; {181#false} is VALID [2022-02-20 23:27:57,573 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:27:57,573 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:27:57,573 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:27:57,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {181#false} assume !true; {181#false} is VALID [2022-02-20 23:27:57,574 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:27:57,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {181#false} assume !false; {181#false} is VALID [2022-02-20 23:27:57,575 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:27:57,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:27:57,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873539593] [2022-02-20 23:27:57,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873539593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:27:57,576 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:27:57,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:27:57,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962926298] [2022-02-20 23:27:57,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:27:57,581 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:27:57,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:27:57,583 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:27:57,591 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:27:57,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:27:57,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:27:57,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:27:57,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:27:57,607 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:27:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:57,912 INFO L93 Difference]: Finished difference Result 352 states and 589 transitions. [2022-02-20 23:27:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:27:57,912 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:27:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:27:57,913 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:27:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 589 transitions. [2022-02-20 23:27:57,922 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:27:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 589 transitions. [2022-02-20 23:27:57,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 589 transitions. [2022-02-20 23:27:58,365 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:27:58,375 INFO L225 Difference]: With dead ends: 352 [2022-02-20 23:27:58,375 INFO L226 Difference]: Without dead ends: 173 [2022-02-20 23:27:58,377 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:27:58,379 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:27:58,380 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:27:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-02-20 23:27:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-02-20 23:27:58,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:27:58,406 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:27:58,407 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:27:58,407 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:27:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:58,413 INFO L93 Difference]: Finished difference Result 173 states and 229 transitions. [2022-02-20 23:27:58,413 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 229 transitions. [2022-02-20 23:27:58,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:58,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:58,415 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:27:58,415 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:27:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:58,421 INFO L93 Difference]: Finished difference Result 173 states and 229 transitions. [2022-02-20 23:27:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 229 transitions. [2022-02-20 23:27:58,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:58,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:58,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:27:58,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:27:58,423 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:27:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 229 transitions. [2022-02-20 23:27:58,428 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 229 transitions. Word has length 9 [2022-02-20 23:27:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:27:58,429 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 229 transitions. [2022-02-20 23:27:58,429 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:27:58,429 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 229 transitions. [2022-02-20 23:27:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 23:27:58,430 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:27:58,430 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:27:58,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:27:58,431 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:27:58,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:27:58,432 INFO L85 PathProgramCache]: Analyzing trace with hash -294026559, now seen corresponding path program 1 times [2022-02-20 23:27:58,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:27:58,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200560033] [2022-02-20 23:27:58,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:58,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:27:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:27:58,504 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:27:58,505 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:27:58,505 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:27:58,506 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:27:58,506 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:27:58,506 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:27:58,506 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:27:58,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {1169#false} havoc main_~_hf_hashv~0#1; {1169#false} is VALID [2022-02-20 23:27:58,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {1169#false} goto; {1169#false} is VALID [2022-02-20 23:27:58,507 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:27:58,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {1169#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {1169#false} is VALID [2022-02-20 23:27:58,507 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:27:58,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {1169#false} assume !main_#t~switch158#1; {1169#false} is VALID [2022-02-20 23:27:58,508 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:27:58,508 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:27:58,508 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:27:58,508 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:27:58,508 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:27:58,509 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:27:58,509 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:27:58,509 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:27:58,509 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:27:58,509 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:27:58,509 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:27:58,510 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:27:58,510 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:27:58,510 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:27:58,510 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:27:58,510 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:27:58,511 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:27:58,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {1169#false} assume !main_#t~switch158#1; {1169#false} is VALID [2022-02-20 23:27:58,511 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:27:58,511 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:27:58,511 INFO L290 TraceCheckUtils]: 33: Hoare triple {1169#false} havoc main_#t~switch158#1; {1169#false} is VALID [2022-02-20 23:27:58,512 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:27:58,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {1169#false} goto; {1169#false} is VALID [2022-02-20 23:27:58,512 INFO L290 TraceCheckUtils]: 36: Hoare triple {1169#false} goto; {1169#false} is VALID [2022-02-20 23:27:58,512 INFO L290 TraceCheckUtils]: 37: Hoare triple {1169#false} goto; {1169#false} is VALID [2022-02-20 23:27:58,513 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:27:58,513 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:27:58,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {1169#false} goto; {1169#false} is VALID [2022-02-20 23:27:58,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {1169#false} goto; {1169#false} is VALID [2022-02-20 23:27:58,513 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:27:58,513 INFO L290 TraceCheckUtils]: 43: Hoare triple {1169#false} assume !false; {1169#false} is VALID [2022-02-20 23:27:58,514 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:27:58,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:27:58,514 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200560033] [2022-02-20 23:27:58,514 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200560033] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:27:58,514 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:27:58,514 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:27:58,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557942374] [2022-02-20 23:27:58,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:27:58,516 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:27:58,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:27:58,516 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:27:58,541 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:27:58,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:27:58,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:27:58,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:27:58,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:27:58,543 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:27:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:59,344 INFO L93 Difference]: Finished difference Result 363 states and 489 transitions. [2022-02-20 23:27:59,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:27:59,345 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:27:59,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:27:59,345 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:27:59,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-02-20 23:27:59,349 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:27:59,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2022-02-20 23:27:59,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 489 transitions. [2022-02-20 23:27:59,699 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:27:59,705 INFO L225 Difference]: With dead ends: 363 [2022-02-20 23:27:59,705 INFO L226 Difference]: Without dead ends: 284 [2022-02-20 23:27:59,705 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:27:59,706 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 138 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:27:59,707 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.2s Time] [2022-02-20 23:27:59,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2022-02-20 23:27:59,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 175. [2022-02-20 23:27:59,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:27:59,715 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:27:59,715 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:27:59,716 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:27:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:59,724 INFO L93 Difference]: Finished difference Result 284 states and 381 transitions. [2022-02-20 23:27:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 381 transitions. [2022-02-20 23:27:59,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:59,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:59,727 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:27:59,727 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:27:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:27:59,736 INFO L93 Difference]: Finished difference Result 284 states and 381 transitions. [2022-02-20 23:27:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 381 transitions. [2022-02-20 23:27:59,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:27:59,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:27:59,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:27:59,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:27:59,738 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:27:59,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 231 transitions. [2022-02-20 23:27:59,741 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 231 transitions. Word has length 44 [2022-02-20 23:27:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:27:59,742 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 231 transitions. [2022-02-20 23:27:59,742 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:27:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 231 transitions. [2022-02-20 23:27:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 23:27:59,744 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:27:59,744 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:27:59,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:27:59,744 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:27:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:27:59,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1509402797, now seen corresponding path program 1 times [2022-02-20 23:27:59,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:27:59,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950753242] [2022-02-20 23:27:59,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:59,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:27:59,853 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:27:59,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [130726014] [2022-02-20 23:27:59,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:27:59,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:27:59,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:27:59,855 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:27:59,858 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:28:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:28:00,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 1649 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:28:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:28:00,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:28:00,552 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:28:00,552 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:28:00,553 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:28:00,553 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:28:00,553 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:28:00,553 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:28:00,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {2399#true} havoc main_~_ha_hashv~0#1; {2399#true} is VALID [2022-02-20 23:28:00,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {2399#true} goto; {2399#true} is VALID [2022-02-20 23:28:00,554 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:28:00,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {2399#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {2399#true} is VALID [2022-02-20 23:28:00,554 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:28:00,554 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:28:00,554 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:28:00,555 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:28:00,555 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:28:00,555 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:28:00,555 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:28:00,555 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:28:00,556 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:28:00,557 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:28:00,557 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:28:00,557 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:28:00,557 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:28:00,557 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:28:00,558 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:28:00,558 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:28:00,558 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:28:00,558 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:28:00,558 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:28:00,558 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:28:00,559 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:28:00,559 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:28:00,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {2400#false} havoc main_#t~switch24#1; {2400#false} is VALID [2022-02-20 23:28:00,559 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:28:00,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,560 INFO L290 TraceCheckUtils]: 35: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,560 INFO L290 TraceCheckUtils]: 36: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,560 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:28:00,560 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:28:00,561 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:28:00,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,561 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:28:00,561 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:28:00,562 INFO L290 TraceCheckUtils]: 43: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,562 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:28:00,562 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:28:00,562 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:28:00,562 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:28:00,563 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:28:00,563 INFO L290 TraceCheckUtils]: 49: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,563 INFO L290 TraceCheckUtils]: 50: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,563 INFO L290 TraceCheckUtils]: 51: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,563 INFO L290 TraceCheckUtils]: 52: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,563 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:28:00,564 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:28:00,564 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:28:00,564 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:28:00,564 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:28:00,564 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:28:00,564 INFO L290 TraceCheckUtils]: 59: Hoare triple {2400#false} havoc main_~_hf_hashv~0#1; {2400#false} is VALID [2022-02-20 23:28:00,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,565 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:28:00,565 INFO L290 TraceCheckUtils]: 62: Hoare triple {2400#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {2400#false} is VALID [2022-02-20 23:28:00,565 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:28:00,565 INFO L290 TraceCheckUtils]: 64: Hoare triple {2400#false} assume !main_#t~switch158#1; {2400#false} is VALID [2022-02-20 23:28:00,565 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:28:00,565 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:28:00,566 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:28:00,566 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:28:00,566 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:28:00,566 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:28:00,566 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:28:00,566 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:28:00,567 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:28:00,567 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:28:00,567 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:28:00,567 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:28:00,567 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:28:00,567 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:28:00,568 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:28:00,568 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:28:00,568 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:28:00,568 INFO L290 TraceCheckUtils]: 82: Hoare triple {2400#false} assume !main_#t~switch158#1; {2400#false} is VALID [2022-02-20 23:28:00,568 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:28:00,568 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:28:00,568 INFO L290 TraceCheckUtils]: 85: Hoare triple {2400#false} havoc main_#t~switch158#1; {2400#false} is VALID [2022-02-20 23:28:00,569 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:28:00,569 INFO L290 TraceCheckUtils]: 87: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,569 INFO L290 TraceCheckUtils]: 88: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,569 INFO L290 TraceCheckUtils]: 89: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,569 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:28:00,569 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:28:00,570 INFO L290 TraceCheckUtils]: 92: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,570 INFO L290 TraceCheckUtils]: 93: Hoare triple {2400#false} goto; {2400#false} is VALID [2022-02-20 23:28:00,570 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:28:00,570 INFO L290 TraceCheckUtils]: 95: Hoare triple {2400#false} assume !false; {2400#false} is VALID [2022-02-20 23:28:00,570 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:28:00,571 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:28:00,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:28:00,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950753242] [2022-02-20 23:28:00,571 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:28:00,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130726014] [2022-02-20 23:28:00,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130726014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:28:00,572 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:28:00,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:28:00,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057156693] [2022-02-20 23:28:00,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:28:00,573 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:28:00,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:28:00,573 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:28:00,633 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:28:00,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:28:00,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:28:00,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:28:00,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:28:00,634 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:28:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:01,052 INFO L93 Difference]: Finished difference Result 367 states and 489 transitions. [2022-02-20 23:28:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:28:01,053 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:28:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:28:01,053 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:28:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2022-02-20 23:28:01,057 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:28:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2022-02-20 23:28:01,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 487 transitions. [2022-02-20 23:28:01,415 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:28:01,418 INFO L225 Difference]: With dead ends: 367 [2022-02-20 23:28:01,418 INFO L226 Difference]: Without dead ends: 196 [2022-02-20 23:28:01,419 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:28:01,420 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:28:01,420 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:28:01,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-02-20 23:28:01,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2022-02-20 23:28:01,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:28:01,427 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:28:01,427 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:28:01,428 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:28:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:01,431 INFO L93 Difference]: Finished difference Result 196 states and 252 transitions. [2022-02-20 23:28:01,432 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 252 transitions. [2022-02-20 23:28:01,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:28:01,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:28:01,432 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:28:01,433 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:28:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:01,438 INFO L93 Difference]: Finished difference Result 196 states and 252 transitions. [2022-02-20 23:28:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 252 transitions. [2022-02-20 23:28:01,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:28:01,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:28:01,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:28:01,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:28:01,439 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:28:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 251 transitions. [2022-02-20 23:28:01,451 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 251 transitions. Word has length 96 [2022-02-20 23:28:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:28:01,455 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 251 transitions. [2022-02-20 23:28:01,456 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:28:01,456 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 251 transitions. [2022-02-20 23:28:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 23:28:01,456 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:28:01,457 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:28:01,480 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:28:01,678 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:28:01,678 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:28:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:28:01,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1482337195, now seen corresponding path program 1 times [2022-02-20 23:28:01,679 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:28:01,679 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833513900] [2022-02-20 23:28:01,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:28:01,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:28:01,752 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:28:01,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1563267846] [2022-02-20 23:28:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:28:01,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:28:01,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:28:01,754 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:28:01,784 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:28:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:28:02,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:28:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:28:02,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:28:02,518 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:28:02,518 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:28:02,518 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:28:02,519 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:28:02,519 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:28:02,519 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:28:02,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {3756#true} havoc main_~_ha_hashv~0#1; {3756#true} is VALID [2022-02-20 23:28:02,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:28:02,519 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:28:02,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {3756#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {3756#true} is VALID [2022-02-20 23:28:02,519 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:28:02,519 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:28:02,519 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:28:02,519 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:28:02,519 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:28:02,519 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:28:02,519 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:28:02,520 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:28:02,522 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:28:02,522 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:28:02,522 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:28:02,522 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:28:02,523 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:28:02,523 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:28:02,523 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:28:02,523 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:28:02,523 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:28:02,523 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:28:02,523 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:28:02,523 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:28:02,523 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:28:02,523 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:28:02,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {3756#true} havoc main_#t~switch24#1; {3756#true} is VALID [2022-02-20 23:28:02,523 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:28:02,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:28:02,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:28:02,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:28:02,524 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:28:02,524 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:28:02,524 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:28:02,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:28:02,524 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:28:02,524 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:28:02,525 INFO L290 TraceCheckUtils]: 43: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:28:02,525 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:28:02,525 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:28:02,525 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:28:02,543 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:28:02,543 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:28:02,543 INFO L290 TraceCheckUtils]: 49: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:28:02,543 INFO L290 TraceCheckUtils]: 50: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:28:02,544 INFO L290 TraceCheckUtils]: 51: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:28:02,544 INFO L290 TraceCheckUtils]: 52: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:28:02,544 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:28:02,544 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:28:02,544 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:28:02,544 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:28:02,544 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:28:02,545 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:28:02,545 INFO L290 TraceCheckUtils]: 59: Hoare triple {3756#true} havoc main_~_hf_hashv~0#1; {3756#true} is VALID [2022-02-20 23:28:02,545 INFO L290 TraceCheckUtils]: 60: Hoare triple {3756#true} goto; {3756#true} is VALID [2022-02-20 23:28:02,545 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:28:02,545 INFO L290 TraceCheckUtils]: 62: Hoare triple {3756#true} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {3756#true} is VALID [2022-02-20 23:28:02,545 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:28:02,545 INFO L290 TraceCheckUtils]: 64: Hoare triple {3756#true} assume !main_#t~switch158#1; {3756#true} is VALID [2022-02-20 23:28:02,545 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:28:02,546 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:28:02,546 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:28:02,546 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:28:02,546 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:28:02,546 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:28:02,546 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:28:02,546 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:28:02,546 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:28:02,547 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:28:02,547 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:28:02,547 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:28:02,547 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:28:02,547 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:28:02,547 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:28:02,548 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:28:02,548 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:28:02,549 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:28:02,549 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:28:02,549 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:28:02,549 INFO L290 TraceCheckUtils]: 85: Hoare triple {3757#false} havoc main_#t~switch158#1; {3757#false} is VALID [2022-02-20 23:28:02,549 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:28:02,549 INFO L290 TraceCheckUtils]: 87: Hoare triple {3757#false} goto; {3757#false} is VALID [2022-02-20 23:28:02,549 INFO L290 TraceCheckUtils]: 88: Hoare triple {3757#false} goto; {3757#false} is VALID [2022-02-20 23:28:02,550 INFO L290 TraceCheckUtils]: 89: Hoare triple {3757#false} goto; {3757#false} is VALID [2022-02-20 23:28:02,550 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:28:02,550 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:28:02,550 INFO L290 TraceCheckUtils]: 92: Hoare triple {3757#false} goto; {3757#false} is VALID [2022-02-20 23:28:02,550 INFO L290 TraceCheckUtils]: 93: Hoare triple {3757#false} goto; {3757#false} is VALID [2022-02-20 23:28:02,550 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:28:02,550 INFO L290 TraceCheckUtils]: 95: Hoare triple {3757#false} assume !false; {3757#false} is VALID [2022-02-20 23:28:02,551 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:28:02,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:28:02,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:28:02,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833513900] [2022-02-20 23:28:02,551 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:28:02,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563267846] [2022-02-20 23:28:02,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563267846] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:28:02,552 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:28:02,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:28:02,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323024151] [2022-02-20 23:28:02,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:28:02,552 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:28:02,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:28:02,553 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:28:02,612 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:28:02,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:28:02,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:28:02,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:28:02,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:28:02,613 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:28:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:03,096 INFO L93 Difference]: Finished difference Result 294 states and 388 transitions. [2022-02-20 23:28:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:28:03,096 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:28:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:28:03,097 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:28:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-02-20 23:28:03,099 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:28:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-02-20 23:28:03,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 366 transitions. [2022-02-20 23:28:03,342 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:28:03,345 INFO L225 Difference]: With dead ends: 294 [2022-02-20 23:28:03,345 INFO L226 Difference]: Without dead ends: 216 [2022-02-20 23:28:03,345 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:28:03,346 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:28:03,346 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:28:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-02-20 23:28:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2022-02-20 23:28:03,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:28:03,352 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:28:03,352 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:28:03,353 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:28:03,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:03,364 INFO L93 Difference]: Finished difference Result 216 states and 272 transitions. [2022-02-20 23:28:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 272 transitions. [2022-02-20 23:28:03,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:28:03,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:28:03,365 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:28:03,366 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:28:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:03,370 INFO L93 Difference]: Finished difference Result 216 states and 272 transitions. [2022-02-20 23:28:03,370 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 272 transitions. [2022-02-20 23:28:03,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:28:03,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:28:03,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:28:03,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:28:03,371 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:28:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 271 transitions. [2022-02-20 23:28:03,375 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 271 transitions. Word has length 96 [2022-02-20 23:28:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:28:03,375 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 271 transitions. [2022-02-20 23:28:03,376 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:28:03,376 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 271 transitions. [2022-02-20 23:28:03,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 23:28:03,377 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:28:03,377 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:28:03,399 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:28:03,587 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:28:03,588 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:28:03,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:28:03,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1801512851, now seen corresponding path program 1 times [2022-02-20 23:28:03,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:28:03,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106040134] [2022-02-20 23:28:03,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:28:03,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:28:03,669 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:28:03,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1330363967] [2022-02-20 23:28:03,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:28:03,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:28:03,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:28:03,671 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:28:03,672 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:28:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:28:04,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:28:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:28:04,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:28:04,410 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:28:04,410 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:28:04,410 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:28:04,410 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:28:04,411 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:28:04,411 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:28:04,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {5081#true} havoc main_~_ha_hashv~0#1; {5081#true} is VALID [2022-02-20 23:28:04,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {5081#true} goto; {5081#true} is VALID [2022-02-20 23:28:04,412 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:28:04,412 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:28:04,415 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:28:04,415 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:28:04,415 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:28:04,415 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:28:04,415 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:28:04,415 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:28:04,416 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:28:04,416 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:28:04,416 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:28:04,416 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:28:04,416 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:28:04,416 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:28:04,416 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:28:04,416 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:28:04,416 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:28:04,416 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:28:04,416 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:28:04,416 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:28:04,416 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:28:04,416 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:28:04,417 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:28:04,417 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:28:04,417 INFO L290 TraceCheckUtils]: 32: Hoare triple {5082#false} havoc main_#t~switch24#1; {5082#false} is VALID [2022-02-20 23:28:04,417 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:28:04,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,417 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:28:04,417 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:28:04,417 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:28:04,417 INFO L290 TraceCheckUtils]: 40: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,417 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:28:04,417 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:28:04,418 INFO L290 TraceCheckUtils]: 43: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,418 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:28:04,418 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:28:04,418 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:28:04,418 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:28:04,418 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:28:04,418 INFO L290 TraceCheckUtils]: 49: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,418 INFO L290 TraceCheckUtils]: 50: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,418 INFO L290 TraceCheckUtils]: 51: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,418 INFO L290 TraceCheckUtils]: 52: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,418 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:28:04,418 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:28:04,418 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:28:04,418 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:28:04,419 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:28:04,419 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:28:04,419 INFO L290 TraceCheckUtils]: 59: Hoare triple {5082#false} havoc main_~_hf_hashv~0#1; {5082#false} is VALID [2022-02-20 23:28:04,419 INFO L290 TraceCheckUtils]: 60: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,419 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:28:04,419 INFO L290 TraceCheckUtils]: 62: Hoare triple {5082#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {5082#false} is VALID [2022-02-20 23:28:04,419 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:28:04,419 INFO L290 TraceCheckUtils]: 64: Hoare triple {5082#false} assume !main_#t~switch158#1; {5082#false} is VALID [2022-02-20 23:28:04,419 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:28:04,419 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:28:04,419 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:28:04,419 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:28:04,419 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:28:04,420 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:28:04,420 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:28:04,420 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:28:04,420 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:28:04,420 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:28:04,420 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:28:04,420 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:28:04,420 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:28:04,421 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:28:04,421 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:28:04,421 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:28:04,421 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:28:04,421 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:28:04,421 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:28:04,421 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:28:04,421 INFO L290 TraceCheckUtils]: 85: Hoare triple {5082#false} havoc main_#t~switch158#1; {5082#false} is VALID [2022-02-20 23:28:04,422 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:28:04,422 INFO L290 TraceCheckUtils]: 87: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,422 INFO L290 TraceCheckUtils]: 88: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,422 INFO L290 TraceCheckUtils]: 89: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,422 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:28:04,422 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:28:04,422 INFO L290 TraceCheckUtils]: 92: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,422 INFO L290 TraceCheckUtils]: 93: Hoare triple {5082#false} goto; {5082#false} is VALID [2022-02-20 23:28:04,423 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:28:04,423 INFO L290 TraceCheckUtils]: 95: Hoare triple {5082#false} assume !false; {5082#false} is VALID [2022-02-20 23:28:04,423 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:28:04,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:28:04,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:28:04,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106040134] [2022-02-20 23:28:04,424 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:28:04,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330363967] [2022-02-20 23:28:04,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330363967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:28:04,424 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:28:04,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:28:04,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340669345] [2022-02-20 23:28:04,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:28:04,425 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:28:04,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:28:04,425 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:28:04,489 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:28:04,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:28:04,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:28:04,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:28:04,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:28:04,490 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:28:05,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:05,174 INFO L93 Difference]: Finished difference Result 418 states and 530 transitions. [2022-02-20 23:28:05,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:28:05,174 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:28:05,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:28:05,174 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:28:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2022-02-20 23:28:05,177 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:28:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2022-02-20 23:28:05,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 467 transitions. [2022-02-20 23:28:05,503 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:28:05,506 INFO L225 Difference]: With dead ends: 418 [2022-02-20 23:28:05,506 INFO L226 Difference]: Without dead ends: 207 [2022-02-20 23:28:05,506 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:28:05,507 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:28:05,507 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:28:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-02-20 23:28:05,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 201. [2022-02-20 23:28:05,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:28:05,531 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:28:05,532 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:28:05,532 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:28:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:05,536 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2022-02-20 23:28:05,536 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 256 transitions. [2022-02-20 23:28:05,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:28:05,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:28:05,537 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:28:05,537 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:28:05,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:05,540 INFO L93 Difference]: Finished difference Result 207 states and 256 transitions. [2022-02-20 23:28:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 256 transitions. [2022-02-20 23:28:05,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:28:05,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:28:05,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:28:05,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:28:05,541 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:28:05,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 250 transitions. [2022-02-20 23:28:05,545 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 250 transitions. Word has length 96 [2022-02-20 23:28:05,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:28:05,545 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 250 transitions. [2022-02-20 23:28:05,545 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:28:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 250 transitions. [2022-02-20 23:28:05,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 23:28:05,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:28:05,546 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:28:05,568 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:28:05,759 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:28:05,759 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:28:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:28:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash 432355323, now seen corresponding path program 1 times [2022-02-20 23:28:05,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:28:05,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440822075] [2022-02-20 23:28:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:28:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:28:05,851 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:28:05,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [390958161] [2022-02-20 23:28:05,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:28:05,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:28:05,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:28:05,857 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:28:05,859 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:28:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:28:06,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:28:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:28:06,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:28:06,693 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:28:06,693 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:28:06,694 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:28:06,694 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:28:06,694 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:28:06,694 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:28:06,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {6523#true} havoc main_~_ha_hashv~0#1; {6523#true} is VALID [2022-02-20 23:28:06,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:28:06,694 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:28:06,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {6523#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {6523#true} is VALID [2022-02-20 23:28:06,694 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:28:06,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {6523#true} assume !main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:28:06,694 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:28:06,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {6523#true} assume !main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:28:06,694 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:28:06,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {6523#true} assume !main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:28:06,695 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:28:06,695 INFO L290 TraceCheckUtils]: 17: Hoare triple {6523#true} assume !main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:28:06,695 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:28:06,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {6523#true} assume !main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:28:06,695 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:28:06,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {6523#true} assume !main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:28:06,695 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:28:06,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {6523#true} assume !main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:28:06,695 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:28:06,695 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:28:06,695 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:28:06,695 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:28:06,695 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:28:06,696 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:28:06,696 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:28:06,696 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:28:06,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {6523#true} havoc main_#t~switch24#1; {6523#true} is VALID [2022-02-20 23:28:06,696 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:28:06,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:28:06,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:28:06,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:28:06,696 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:28:06,696 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:28:06,696 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:28:06,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:28:06,696 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:28:06,696 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:28:06,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:28:06,697 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:28:06,697 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:28:06,697 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:28:06,697 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:28:06,697 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:28:06,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:28:06,697 INFO L290 TraceCheckUtils]: 50: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:28:06,697 INFO L290 TraceCheckUtils]: 51: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:28:06,697 INFO L290 TraceCheckUtils]: 52: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:28:06,697 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:28:06,697 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:28:06,697 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:28:06,698 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:28:06,698 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:28:06,698 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:28:06,698 INFO L290 TraceCheckUtils]: 59: Hoare triple {6523#true} havoc main_~_hf_hashv~0#1; {6523#true} is VALID [2022-02-20 23:28:06,698 INFO L290 TraceCheckUtils]: 60: Hoare triple {6523#true} goto; {6523#true} is VALID [2022-02-20 23:28:06,701 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:28:06,701 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:28:06,701 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:28:06,702 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:28:06,702 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:28:06,703 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:28:06,703 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:28:06,703 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:28:06,703 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:28:06,703 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:28:06,703 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:28:06,703 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:28:06,703 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:28:06,703 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:28:06,703 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:28:06,703 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:28:06,703 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:28:06,703 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:28:06,703 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:28:06,704 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:28:06,704 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:28:06,704 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:28:06,704 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:28:06,704 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:28:06,704 INFO L290 TraceCheckUtils]: 85: Hoare triple {6524#false} havoc main_#t~switch158#1; {6524#false} is VALID [2022-02-20 23:28:06,704 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:28:06,704 INFO L290 TraceCheckUtils]: 87: Hoare triple {6524#false} goto; {6524#false} is VALID [2022-02-20 23:28:06,704 INFO L290 TraceCheckUtils]: 88: Hoare triple {6524#false} goto; {6524#false} is VALID [2022-02-20 23:28:06,704 INFO L290 TraceCheckUtils]: 89: Hoare triple {6524#false} goto; {6524#false} is VALID [2022-02-20 23:28:06,704 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:28:06,705 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:28:06,705 INFO L290 TraceCheckUtils]: 92: Hoare triple {6524#false} goto; {6524#false} is VALID [2022-02-20 23:28:06,705 INFO L290 TraceCheckUtils]: 93: Hoare triple {6524#false} goto; {6524#false} is VALID [2022-02-20 23:28:06,705 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:28:06,705 INFO L290 TraceCheckUtils]: 95: Hoare triple {6524#false} assume !false; {6524#false} is VALID [2022-02-20 23:28:06,705 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:28:06,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:28:06,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:28:06,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440822075] [2022-02-20 23:28:06,705 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:28:06,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390958161] [2022-02-20 23:28:06,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390958161] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:28:06,705 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:28:06,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:28:06,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094427770] [2022-02-20 23:28:06,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:28:06,706 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:28:06,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:28:06,706 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:28:06,769 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:28:06,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:28:06,769 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:28:06,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:28:06,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:28:06,770 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:28:07,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:07,449 INFO L93 Difference]: Finished difference Result 291 states and 368 transitions. [2022-02-20 23:28:07,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:28:07,449 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:28:07,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:28:07,450 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:28:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2022-02-20 23:28:07,452 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:28:07,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2022-02-20 23:28:07,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 337 transitions. [2022-02-20 23:28:07,690 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:28:07,692 INFO L225 Difference]: With dead ends: 291 [2022-02-20 23:28:07,692 INFO L226 Difference]: Without dead ends: 193 [2022-02-20 23:28:07,693 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:28:07,693 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:28:07,694 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:28:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-02-20 23:28:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2022-02-20 23:28:07,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:28:07,718 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:28:07,719 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:28:07,719 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:28:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:07,724 INFO L93 Difference]: Finished difference Result 193 states and 235 transitions. [2022-02-20 23:28:07,724 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 235 transitions. [2022-02-20 23:28:07,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:28:07,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:28:07,724 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:28:07,725 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:28:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:07,727 INFO L93 Difference]: Finished difference Result 193 states and 235 transitions. [2022-02-20 23:28:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 235 transitions. [2022-02-20 23:28:07,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:28:07,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:28:07,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:28:07,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:28:07,728 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:28:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 229 transitions. [2022-02-20 23:28:07,731 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 229 transitions. Word has length 96 [2022-02-20 23:28:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:28:07,731 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 229 transitions. [2022-02-20 23:28:07,731 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:28:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 229 transitions. [2022-02-20 23:28:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 23:28:07,731 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:28:07,732 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:28:07,754 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:28:07,952 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:28:07,952 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:28:07,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:28:07,952 INFO L85 PathProgramCache]: Analyzing trace with hash -725253137, now seen corresponding path program 1 times [2022-02-20 23:28:07,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:28:07,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890923958] [2022-02-20 23:28:07,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:28:07,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:28:08,058 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:28:08,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269283434] [2022-02-20 23:28:08,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:28:08,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:28:08,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:28:08,065 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:28:08,066 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:28:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:28:08,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 1627 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:28:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:28:08,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:28:09,009 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:28:09,010 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:28:09,010 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:28:09,011 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:28:09,011 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:28:09,012 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:28:09,012 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:28:09,013 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:28:09,013 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:28:09,013 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:28:09,014 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:28:09,014 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:28:09,014 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:28:09,015 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:28:09,015 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:28:09,015 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:28:09,016 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:28:09,016 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:28:09,016 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:28:09,017 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:28:09,017 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:28:09,017 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:28:09,018 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:28:09,018 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:28:09,018 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:28:09,019 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:28:09,019 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:28:09,019 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:28:09,020 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:28:09,020 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:28:09,021 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:28:09,021 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:28:09,021 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:28:09,023 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:28:09,023 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:28:09,023 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:28:09,024 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:28:09,025 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:28:09,025 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:28:09,025 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:28:09,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:28:09,026 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:28:09,026 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:28:09,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:28:09,026 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:28:09,026 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:28:09,026 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:28:09,026 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:28:09,026 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:28:09,026 INFO L290 TraceCheckUtils]: 49: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:28:09,026 INFO L290 TraceCheckUtils]: 50: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:28:09,026 INFO L290 TraceCheckUtils]: 51: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:28:09,026 INFO L290 TraceCheckUtils]: 52: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:28:09,026 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:28:09,026 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:28:09,026 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:28:09,026 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:28:09,026 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:28:09,026 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:28:09,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {7778#false} havoc main_~_hf_hashv~0#1; {7778#false} is VALID [2022-02-20 23:28:09,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:28:09,027 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:28:09,027 INFO L290 TraceCheckUtils]: 62: Hoare triple {7778#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {7778#false} is VALID [2022-02-20 23:28:09,027 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:28:09,027 INFO L290 TraceCheckUtils]: 64: Hoare triple {7778#false} assume !main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:28:09,027 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:28:09,027 INFO L290 TraceCheckUtils]: 66: Hoare triple {7778#false} assume !main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:28:09,027 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:28:09,027 INFO L290 TraceCheckUtils]: 68: Hoare triple {7778#false} assume !main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:28:09,027 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:28:09,027 INFO L290 TraceCheckUtils]: 70: Hoare triple {7778#false} assume !main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:28:09,027 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:28:09,027 INFO L290 TraceCheckUtils]: 72: Hoare triple {7778#false} assume !main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:28:09,037 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:28:09,037 INFO L290 TraceCheckUtils]: 74: Hoare triple {7778#false} assume !main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:28:09,037 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:28:09,037 INFO L290 TraceCheckUtils]: 76: Hoare triple {7778#false} assume !main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:28:09,037 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:28:09,037 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:28:09,037 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:28:09,038 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:28:09,038 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:28:09,038 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:28:09,038 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:28:09,038 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:28:09,038 INFO L290 TraceCheckUtils]: 85: Hoare triple {7778#false} havoc main_#t~switch158#1; {7778#false} is VALID [2022-02-20 23:28:09,038 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:28:09,038 INFO L290 TraceCheckUtils]: 87: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:28:09,038 INFO L290 TraceCheckUtils]: 88: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:28:09,039 INFO L290 TraceCheckUtils]: 89: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:28:09,039 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:28:09,039 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:28:09,039 INFO L290 TraceCheckUtils]: 92: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:28:09,039 INFO L290 TraceCheckUtils]: 93: Hoare triple {7778#false} goto; {7778#false} is VALID [2022-02-20 23:28:09,039 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:28:09,039 INFO L290 TraceCheckUtils]: 95: Hoare triple {7778#false} assume !false; {7778#false} is VALID [2022-02-20 23:28:09,040 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:28:09,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:28:09,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:28:09,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890923958] [2022-02-20 23:28:09,040 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:28:09,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269283434] [2022-02-20 23:28:09,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269283434] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:28:09,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:28:09,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:28:09,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130578277] [2022-02-20 23:28:09,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:28:09,041 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:28:09,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:28:09,041 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:28:09,125 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:28:09,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:28:09,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:28:09,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:28:09,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:28:09,126 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:28:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:09,590 INFO L93 Difference]: Finished difference Result 476 states and 582 transitions. [2022-02-20 23:28:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:28:09,590 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:28:09,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:28:09,591 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:28:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2022-02-20 23:28:09,594 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:28:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2022-02-20 23:28:09,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 546 transitions. [2022-02-20 23:28:09,962 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:28:09,966 INFO L225 Difference]: With dead ends: 476 [2022-02-20 23:28:09,966 INFO L226 Difference]: Without dead ends: 293 [2022-02-20 23:28:09,967 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:28:09,967 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:28:09,967 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:28:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-02-20 23:28:10,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2022-02-20 23:28:10,002 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:28:10,003 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:28:10,004 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:28:10,004 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:28:10,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:10,009 INFO L93 Difference]: Finished difference Result 293 states and 355 transitions. [2022-02-20 23:28:10,009 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 355 transitions. [2022-02-20 23:28:10,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:28:10,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:28:10,010 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:28:10,011 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:28:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:10,015 INFO L93 Difference]: Finished difference Result 293 states and 355 transitions. [2022-02-20 23:28:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 355 transitions. [2022-02-20 23:28:10,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:28:10,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:28:10,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:28:10,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:28:10,017 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:28:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 354 transitions. [2022-02-20 23:28:10,021 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 354 transitions. Word has length 96 [2022-02-20 23:28:10,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:28:10,022 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 354 transitions. [2022-02-20 23:28:10,022 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:28:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 354 transitions. [2022-02-20 23:28:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-02-20 23:28:10,023 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:28:10,023 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:28:10,044 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:28:10,235 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:28:10,235 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:28:10,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:28:10,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1015837155, now seen corresponding path program 1 times [2022-02-20 23:28:10,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:28:10,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515182831] [2022-02-20 23:28:10,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:28:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:28:10,275 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:28:10,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [311305317] [2022-02-20 23:28:10,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:28:10,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:28:10,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:28:10,277 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:28:10,278 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:28:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:28:10,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:28:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:28:10,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:28:11,105 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:28:11,106 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:28:11,106 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:28:11,106 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:28:11,106 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:28:11,106 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:28:11,107 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:28:11,107 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:28:11,107 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:28:11,107 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:28:11,108 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:28:11,108 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:28:11,108 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:28:11,108 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:28:11,109 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:28:11,109 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:28:11,109 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:28:11,109 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:28:11,110 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:28:11,110 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:28:11,110 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:28:11,110 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:28:11,111 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:28:11,111 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:28:11,111 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:28:11,111 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:28:11,112 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:28:11,112 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:28:11,112 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:28:11,112 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:28:11,113 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:28:11,113 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:28:11,113 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:28:11,113 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:28:11,114 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:28:11,114 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:28:11,114 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:28:11,114 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:28:11,115 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:28:11,115 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:28:11,115 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:28:11,115 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:28:11,115 INFO L290 TraceCheckUtils]: 42: Hoare triple {9571#true} #t~loopctr192 := 0; {9571#true} is VALID [2022-02-20 23:28:11,115 INFO L290 TraceCheckUtils]: 43: Hoare triple {9571#true} assume !(#t~loopctr192 % 4294967296 < #amount % 4294967296); {9571#true} is VALID [2022-02-20 23:28:11,115 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:28:11,116 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:28:11,116 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:28:11,117 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:28:11,117 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:28:11,117 INFO L290 TraceCheckUtils]: 49: Hoare triple {9571#true} #t~loopctr192 := 0; {9571#true} is VALID [2022-02-20 23:28:11,117 INFO L290 TraceCheckUtils]: 50: Hoare triple {9571#true} assume !(#t~loopctr192 % 4294967296 < #amount % 4294967296); {9571#true} is VALID [2022-02-20 23:28:11,117 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:28:11,118 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:28:11,125 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:28:11,126 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:28:11,126 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:28:11,126 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:28:11,126 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:28:11,127 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:28:11,127 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:28:11,127 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:28:11,127 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:28:11,128 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:28:11,128 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:28:11,128 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:28:11,128 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:28:11,129 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:28:11,129 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:28:11,129 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:28:11,129 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:28:11,130 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:28:11,130 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:28:11,130 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:28:11,130 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:28:11,131 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:28:11,131 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:28:11,131 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:28:11,131 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:28:11,132 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:28:11,132 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:28:11,132 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:28:11,132 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:28:11,132 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:28:11,133 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:28:11,133 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:28:11,133 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:28:11,133 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:28:11,134 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:28:11,134 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:28:11,134 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:28:11,134 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:28:11,135 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:28:11,135 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:28:11,135 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:28:11,135 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:28:11,136 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:28:11,136 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:28:11,136 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:28:11,136 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:28:11,137 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:28:11,137 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:28:11,137 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:28:11,137 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:28:11,138 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:28:11,138 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:28:11,138 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:28:11,138 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:28:11,138 INFO L290 TraceCheckUtils]: 107: Hoare triple {9572#false} goto; {9572#false} is VALID [2022-02-20 23:28:11,138 INFO L290 TraceCheckUtils]: 108: Hoare triple {9572#false} goto; {9572#false} is VALID [2022-02-20 23:28:11,138 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:28:11,138 INFO L290 TraceCheckUtils]: 110: Hoare triple {9572#false} assume !false; {9572#false} is VALID [2022-02-20 23:28:11,139 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:28:11,139 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:28:11,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:28:11,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515182831] [2022-02-20 23:28:11,139 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:28:11,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311305317] [2022-02-20 23:28:11,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311305317] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:28:11,139 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:28:11,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:28:11,139 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057727007] [2022-02-20 23:28:11,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:28:11,140 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:28:11,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:28:11,140 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:28:11,227 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:28:11,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:28:11,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:28:11,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:28:11,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:28:11,228 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:28:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:11,804 INFO L93 Difference]: Finished difference Result 474 states and 579 transitions. [2022-02-20 23:28:11,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:28:11,804 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:28:11,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:28:11,805 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:28:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2022-02-20 23:28:11,807 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:28:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2022-02-20 23:28:11,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 473 transitions. [2022-02-20 23:28:12,174 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:28:12,177 INFO L225 Difference]: With dead ends: 474 [2022-02-20 23:28:12,177 INFO L226 Difference]: Without dead ends: 231 [2022-02-20 23:28:12,178 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:28:12,178 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 274 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:28:12,178 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.1s Time] [2022-02-20 23:28:12,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-02-20 23:28:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-02-20 23:28:12,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:28:12,207 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:28:12,208 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:28:12,208 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:28:12,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:12,212 INFO L93 Difference]: Finished difference Result 231 states and 276 transitions. [2022-02-20 23:28:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 276 transitions. [2022-02-20 23:28:12,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:28:12,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:28:12,214 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:28:12,214 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:28:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:12,218 INFO L93 Difference]: Finished difference Result 231 states and 276 transitions. [2022-02-20 23:28:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 276 transitions. [2022-02-20 23:28:12,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:28:12,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:28:12,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:28:12,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:28:12,219 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:28:12,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 276 transitions. [2022-02-20 23:28:12,222 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 276 transitions. Word has length 111 [2022-02-20 23:28:12,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:28:12,223 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 276 transitions. [2022-02-20 23:28:12,223 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:28:12,223 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 276 transitions. [2022-02-20 23:28:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-20 23:28:12,226 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:28:12,226 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:28:12,271 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:28:12,446 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:28:12,446 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:28:12,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:28:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash 379973459, now seen corresponding path program 1 times [2022-02-20 23:28:12,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:28:12,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935430807] [2022-02-20 23:28:12,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:28:12,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:28:12,490 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:28:12,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394203657] [2022-02-20 23:28:12,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:28:12,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:28:12,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:28:12,493 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:28:12,494 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:28:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:28:47,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:28:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:28:47,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:28:48,100 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:28:48,100 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:28:48,101 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:28:48,101 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:28:48,101 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:28:48,101 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:28:48,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {11215#true} havoc main_~_ha_hashv~0#1; {11215#true} is VALID [2022-02-20 23:28:48,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {11215#true} goto; {11215#true} is VALID [2022-02-20 23:28:48,101 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:28:48,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {11215#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {11215#true} is VALID [2022-02-20 23:28:48,101 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:28:48,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {11215#true} assume !main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:28:48,101 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:28:48,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {11215#true} assume !main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:28:48,101 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:28:48,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {11215#true} assume !main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:28:48,101 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:28:48,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {11215#true} assume !main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:28:48,101 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:28:48,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {11215#true} assume !main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:28:48,101 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:28:48,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {11215#true} assume !main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:28:48,102 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:28:48,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {11215#true} assume !main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:28:48,102 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:28:48,102 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:28:48,102 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:28:48,102 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:28:48,102 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:28:48,102 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:28:48,102 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:28:48,102 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:28:48,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {11215#true} havoc main_#t~switch24#1; {11215#true} is VALID [2022-02-20 23:28:48,102 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:28:48,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {11215#true} goto; {11215#true} is VALID [2022-02-20 23:28:48,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {11215#true} goto; {11215#true} is VALID [2022-02-20 23:28:48,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {11215#true} goto; {11215#true} is VALID [2022-02-20 23:28:48,102 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:28:48,102 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:28:48,102 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:28:48,102 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:28:48,102 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:28:48,103 INFO L290 TraceCheckUtils]: 42: Hoare triple {11215#true} #t~loopctr192 := 0; {11346#(= |#Ultimate.C_memset_#t~loopctr192| 0)} is VALID [2022-02-20 23:28:48,104 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:28:48,104 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:28:48,105 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:28:48,105 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:28:48,105 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:28:48,105 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:28:48,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {11216#false} #t~loopctr192 := 0; {11216#false} is VALID [2022-02-20 23:28:48,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {11216#false} assume !(#t~loopctr192 % 4294967296 < #amount % 4294967296); {11216#false} is VALID [2022-02-20 23:28:48,105 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:28:48,106 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {11216#false} {11216#false} #711#return; {11216#false} is VALID [2022-02-20 23:28:48,106 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:28:48,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,106 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:28:48,106 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:28:48,106 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:28:48,106 INFO L290 TraceCheckUtils]: 58: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,106 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:28:48,106 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:28:48,106 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:28:48,107 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:28:48,107 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:28:48,107 INFO L290 TraceCheckUtils]: 64: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,107 INFO L290 TraceCheckUtils]: 65: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,107 INFO L290 TraceCheckUtils]: 66: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,107 INFO L290 TraceCheckUtils]: 67: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,107 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:28:48,107 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:28:48,107 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:28:48,108 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:28:48,108 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:28:48,108 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:28:48,108 INFO L290 TraceCheckUtils]: 74: Hoare triple {11216#false} havoc main_~_hf_hashv~0#1; {11216#false} is VALID [2022-02-20 23:28:48,108 INFO L290 TraceCheckUtils]: 75: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,108 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:28:48,108 INFO L290 TraceCheckUtils]: 77: Hoare triple {11216#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {11216#false} is VALID [2022-02-20 23:28:48,108 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:28:48,108 INFO L290 TraceCheckUtils]: 79: Hoare triple {11216#false} assume !main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:28:48,108 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:28:48,109 INFO L290 TraceCheckUtils]: 81: Hoare triple {11216#false} assume !main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:28:48,109 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:28:48,109 INFO L290 TraceCheckUtils]: 83: Hoare triple {11216#false} assume !main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:28:48,109 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:28:48,109 INFO L290 TraceCheckUtils]: 85: Hoare triple {11216#false} assume !main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:28:48,109 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:28:48,109 INFO L290 TraceCheckUtils]: 87: Hoare triple {11216#false} assume !main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:28:48,109 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:28:48,109 INFO L290 TraceCheckUtils]: 89: Hoare triple {11216#false} assume !main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:28:48,109 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:28:48,110 INFO L290 TraceCheckUtils]: 91: Hoare triple {11216#false} assume !main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:28:48,110 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:28:48,110 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:28:48,110 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:28:48,110 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:28:48,110 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:28:48,110 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:28:48,110 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:28:48,110 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:28:48,110 INFO L290 TraceCheckUtils]: 100: Hoare triple {11216#false} havoc main_#t~switch158#1; {11216#false} is VALID [2022-02-20 23:28:48,111 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:28:48,111 INFO L290 TraceCheckUtils]: 102: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,111 INFO L290 TraceCheckUtils]: 103: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,111 INFO L290 TraceCheckUtils]: 104: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,111 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:28:48,111 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:28:48,111 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:28:48,111 INFO L290 TraceCheckUtils]: 108: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,111 INFO L290 TraceCheckUtils]: 109: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,112 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:28:48,112 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:28:48,112 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:28:48,112 INFO L290 TraceCheckUtils]: 113: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,113 INFO L290 TraceCheckUtils]: 114: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,113 INFO L290 TraceCheckUtils]: 115: Hoare triple {11216#false} goto; {11216#false} is VALID [2022-02-20 23:28:48,113 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:28:48,113 INFO L290 TraceCheckUtils]: 117: Hoare triple {11216#false} assume !false; {11216#false} is VALID [2022-02-20 23:28:48,113 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:28:48,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:28:48,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:28:48,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935430807] [2022-02-20 23:28:48,114 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 23:28:48,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394203657] [2022-02-20 23:28:48,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394203657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:28:48,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:28:48,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:28:48,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15005512] [2022-02-20 23:28:48,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:28:48,115 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:28:48,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:28:48,116 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:28:48,199 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:28:48,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:28:48,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:28:48,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:28:48,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:28:48,200 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:28:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:48,759 INFO L93 Difference]: Finished difference Result 414 states and 501 transitions. [2022-02-20 23:28:48,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:28:48,760 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:28:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:28:48,760 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:28:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2022-02-20 23:28:48,763 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:28:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2022-02-20 23:28:48,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 427 transitions. [2022-02-20 23:28:49,086 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:28:49,089 INFO L225 Difference]: With dead ends: 414 [2022-02-20 23:28:49,089 INFO L226 Difference]: Without dead ends: 234 [2022-02-20 23:28:49,089 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:28:49,089 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:28:49,090 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:28:49,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-02-20 23:28:49,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-02-20 23:28:49,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:28:49,117 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:28:49,118 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:28:49,118 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:28:49,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:49,122 INFO L93 Difference]: Finished difference Result 234 states and 280 transitions. [2022-02-20 23:28:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2022-02-20 23:28:49,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:28:49,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:28:49,123 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:28:49,123 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:28:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:28:49,127 INFO L93 Difference]: Finished difference Result 234 states and 280 transitions. [2022-02-20 23:28:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2022-02-20 23:28:49,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:28:49,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:28:49,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:28:49,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:28:49,129 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:28:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 280 transitions. [2022-02-20 23:28:49,132 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 280 transitions. Word has length 118 [2022-02-20 23:28:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:28:49,133 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 280 transitions. [2022-02-20 23:28:49,133 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:28:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 280 transitions. [2022-02-20 23:28:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-02-20 23:28:49,134 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:28:49,134 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:28:49,173 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:28:49,355 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:28:49,355 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 23:28:49,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:28:49,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1827414795, now seen corresponding path program 1 times [2022-02-20 23:28:49,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:28:49,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701862055] [2022-02-20 23:28:49,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:28:49,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:28:49,396 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 23:28:49,396 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1900921490] [2022-02-20 23:28:49,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:28:49,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:28:49,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:28:49,397 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:28:49,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process