./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:13:07,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:13:07,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:13:07,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:13:07,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:13:07,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:13:07,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:13:07,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:13:07,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:13:07,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:13:07,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:13:07,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:13:07,946 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:13:07,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:13:07,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:13:07,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:13:07,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:13:07,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:13:07,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:13:07,958 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:13:07,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:13:07,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:13:07,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:13:07,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:13:07,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:13:07,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:13:07,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:13:07,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:13:07,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:13:07,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:13:07,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:13:07,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:13:07,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:13:07,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:13:07,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:13:07,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:13:07,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:13:07,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:13:07,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:13:07,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:13:07,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:13:07,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:13:08,010 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:13:08,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:13:08,011 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:13:08,011 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:13:08,012 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:13:08,012 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:13:08,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:13:08,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:13:08,013 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:13:08,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:13:08,014 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:13:08,014 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:13:08,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:13:08,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:13:08,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:13:08,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:13:08,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:13:08,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:13:08,016 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:13:08,016 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:13:08,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:13:08,016 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:13:08,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:13:08,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:13:08,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:13:08,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:13:08,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:13:08,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:13:08,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:13:08,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:13:08,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:13:08,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:13:08,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:13:08,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 [2022-02-21 03:13:08,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:13:08,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:13:08,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:13:08,274 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:13:08,275 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:13:08,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2022-02-21 03:13:08,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8324c892f/6a4b69ad029849e387e3758cb8b353f1/FLAG1c662ee09 [2022-02-21 03:13:08,904 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:13:08,908 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2022-02-21 03:13:08,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8324c892f/6a4b69ad029849e387e3758cb8b353f1/FLAG1c662ee09 [2022-02-21 03:13:09,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8324c892f/6a4b69ad029849e387e3758cb8b353f1 [2022-02-21 03:13:09,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:13:09,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:13:09,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:13:09,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:13:09,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:13:09,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:13:09" (1/1) ... [2022-02-21 03:13:09,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87ad9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:09, skipping insertion in model container [2022-02-21 03:13:09,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:13:09" (1/1) ... [2022-02-21 03:13:09,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:13:09,394 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:13:09,794 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i[37019,37032] [2022-02-21 03:13:09,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i[47352,47365] [2022-02-21 03:13:09,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:13:09,933 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:13:09,958 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i[37019,37032] [2022-02-21 03:13:10,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i[47352,47365] [2022-02-21 03:13:10,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:13:10,066 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:13:10,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:10 WrapperNode [2022-02-21 03:13:10,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:13:10,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:13:10,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:13:10,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:13:10,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:10" (1/1) ... [2022-02-21 03:13:10,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:10" (1/1) ... [2022-02-21 03:13:10,217 INFO L137 Inliner]: procedures = 208, calls = 235, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 892 [2022-02-21 03:13:10,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:13:10,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:13:10,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:13:10,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:13:10,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:10" (1/1) ... [2022-02-21 03:13:10,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:10" (1/1) ... [2022-02-21 03:13:10,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:10" (1/1) ... [2022-02-21 03:13:10,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:10" (1/1) ... [2022-02-21 03:13:10,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:10" (1/1) ... [2022-02-21 03:13:10,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:10" (1/1) ... [2022-02-21 03:13:10,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:10" (1/1) ... [2022-02-21 03:13:10,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:13:10,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:13:10,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:13:10,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:13:10,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:10" (1/1) ... [2022-02-21 03:13:10,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:13:10,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:10,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:13:10,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:13:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-21 03:13:10,466 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-21 03:13:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:13:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-21 03:13:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 03:13:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:13:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:13:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-21 03:13:10,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-21 03:13:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:13:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:13:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:13:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 03:13:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:13:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:13:10,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:13:10,701 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:13:10,703 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:13:13,475 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:13:13,485 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:13:13,485 INFO L299 CfgBuilder]: Removed 54 assume(true) statements. [2022-02-21 03:13:13,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:13:13 BoogieIcfgContainer [2022-02-21 03:13:13,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:13:13,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:13:13,489 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:13:13,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:13:13,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:13:09" (1/3) ... [2022-02-21 03:13:13,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399ee00b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:13:13, skipping insertion in model container [2022-02-21 03:13:13,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:13:10" (2/3) ... [2022-02-21 03:13:13,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@399ee00b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:13:13, skipping insertion in model container [2022-02-21 03:13:13,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:13:13" (3/3) ... [2022-02-21 03:13:13,493 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test2-1.i [2022-02-21 03:13:13,497 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:13:13,497 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-02-21 03:13:13,529 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:13:13,534 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:13:13,535 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-02-21 03:13:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 170 states have (on average 1.7) internal successors, (289), 183 states have internal predecessors, (289), 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-21 03:13:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:13:13,559 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:13,559 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:13:13,560 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:13:13,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash 552713999, now seen corresponding path program 1 times [2022-02-21 03:13:13,571 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:13,572 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940287333] [2022-02-21 03:13:13,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:13,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:13,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {192#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; {192#true} is VALID [2022-02-21 03:13:13,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#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); {192#true} is VALID [2022-02-21 03:13:13,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {192#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {192#true} is VALID [2022-02-21 03:13:13,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {192#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; {192#true} is VALID [2022-02-21 03:13:13,767 INFO L290 TraceCheckUtils]: 4: Hoare triple {192#true} assume main_~user~0#1.base == 0 && main_~user~0#1.offset == 0;assume false; {193#false} is VALID [2022-02-21 03:13:13,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {193#false} 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); {193#false} is VALID [2022-02-21 03:13:13,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {193#false} assume !(main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647); {193#false} is VALID [2022-02-21 03:13:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:13,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:13,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940287333] [2022-02-21 03:13:13,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940287333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:13,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:13,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:13:13,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520080718] [2022-02-21 03:13:13,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:13,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-02-21 03:13:13,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:13,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:13,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:13,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:13:13,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:13,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:13:13,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:13:13,829 INFO L87 Difference]: Start difference. First operand has 189 states, 170 states have (on average 1.7) internal successors, (289), 183 states have internal predecessors, (289), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:14,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:14,933 INFO L93 Difference]: Finished difference Result 376 states and 613 transitions. [2022-02-21 03:13:14,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:13:14,933 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-02-21 03:13:14,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 613 transitions. [2022-02-21 03:13:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:14,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 613 transitions. [2022-02-21 03:13:14,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 613 transitions. [2022-02-21 03:13:15,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 613 edges. 613 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:15,587 INFO L225 Difference]: With dead ends: 376 [2022-02-21 03:13:15,588 INFO L226 Difference]: Without dead ends: 185 [2022-02-21 03:13:15,591 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-21 03:13:15,593 INFO L933 BasicCegarLoop]: 245 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, 245 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-21 03:13:15,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-21 03:13:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-02-21 03:13:15,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:15,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 185 states, 167 states have (on average 1.347305389221557) internal successors, (225), 179 states have internal predecessors, (225), 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-21 03:13:15,630 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 185 states, 167 states have (on average 1.347305389221557) internal successors, (225), 179 states have internal predecessors, (225), 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-21 03:13:15,630 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 185 states, 167 states have (on average 1.347305389221557) internal successors, (225), 179 states have internal predecessors, (225), 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-21 03:13:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:15,639 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2022-02-21 03:13:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2022-02-21 03:13:15,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:15,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:15,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 167 states have (on average 1.347305389221557) internal successors, (225), 179 states have internal predecessors, (225), 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 185 states. [2022-02-21 03:13:15,643 INFO L87 Difference]: Start difference. First operand has 185 states, 167 states have (on average 1.347305389221557) internal successors, (225), 179 states have internal predecessors, (225), 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 185 states. [2022-02-21 03:13:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:15,652 INFO L93 Difference]: Finished difference Result 185 states and 241 transitions. [2022-02-21 03:13:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2022-02-21 03:13:15,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:15,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:15,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:15,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 167 states have (on average 1.347305389221557) internal successors, (225), 179 states have internal predecessors, (225), 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-21 03:13:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 241 transitions. [2022-02-21 03:13:15,663 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 241 transitions. Word has length 7 [2022-02-21 03:13:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:15,663 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 241 transitions. [2022-02-21 03:13:15,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 241 transitions. [2022-02-21 03:13:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:13:15,664 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:15,665 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:13:15,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:13:15,665 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:13:15,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:15,666 INFO L85 PathProgramCache]: Analyzing trace with hash 552715921, now seen corresponding path program 1 times [2022-02-21 03:13:15,666 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:15,666 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671081790] [2022-02-21 03:13:15,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:15,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:15,692 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:15,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [941289052] [2022-02-21 03:13:15,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:15,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:15,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:15,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:13:15,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:13:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:15,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:13:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:15,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:15,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:13:15,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 03:13:16,024 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 03:13:16,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-21 03:13:16,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:13:16,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-21 03:13:16,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {1240#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; {1240#true} is VALID [2022-02-21 03:13:16,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {1240#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); {1248#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-21 03:13:16,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {1248#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1248#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} is VALID [2022-02-21 03:13:16,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {1248#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (= (select |#valid| |ULTIMATE.start_main_~#i~0#1.base|) 1))} assume !!(main_#t~mem7#1 < 10);havoc main_#t~mem7#1;call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnHeap(40);main_~user~0#1.base, main_~user~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset; {1255#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~user~0#1.base| |ULTIMATE.start_main_~#i~0#1.base|)))} is VALID [2022-02-21 03:13:16,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {1255#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~user~0#1.base| |ULTIMATE.start_main_~#i~0#1.base|)))} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {1255#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~user~0#1.base| |ULTIMATE.start_main_~#i~0#1.base|)))} is VALID [2022-02-21 03:13:16,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {1255#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~user~0#1.base| |ULTIMATE.start_main_~#i~0#1.base|)))} 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); {1262#(= |ULTIMATE.start_main_#t~mem11#1| 0)} is VALID [2022-02-21 03:13:16,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {1262#(= |ULTIMATE.start_main_#t~mem11#1| 0)} assume !(main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647); {1241#false} is VALID [2022-02-21 03:13:16,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:16,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:16,175 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:16,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671081790] [2022-02-21 03:13:16,176 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:16,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941289052] [2022-02-21 03:13:16,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941289052] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:16,178 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:16,179 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:13:16,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351359603] [2022-02-21 03:13:16,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:16,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2022-02-21 03:13:16,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:16,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:16,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:16,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:13:16,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:16,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:13:16,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:13:16,189 INFO L87 Difference]: Start difference. First operand 185 states and 241 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:18,629 INFO L93 Difference]: Finished difference Result 312 states and 412 transitions. [2022-02-21 03:13:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:13:18,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2022-02-21 03:13:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:18,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2022-02-21 03:13:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:18,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2022-02-21 03:13:18,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 412 transitions. [2022-02-21 03:13:19,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 412 edges. 412 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:19,042 INFO L225 Difference]: With dead ends: 312 [2022-02-21 03:13:19,042 INFO L226 Difference]: Without dead ends: 310 [2022-02-21 03:13:19,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:13:19,043 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 195 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:19,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 714 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-21 03:13:19,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-02-21 03:13:19,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 191. [2022-02-21 03:13:19,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:19,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 310 states. Second operand has 191 states, 173 states have (on average 1.3410404624277457) internal successors, (232), 185 states have internal predecessors, (232), 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-21 03:13:19,064 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand has 191 states, 173 states have (on average 1.3410404624277457) internal successors, (232), 185 states have internal predecessors, (232), 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-21 03:13:19,065 INFO L87 Difference]: Start difference. First operand 310 states. Second operand has 191 states, 173 states have (on average 1.3410404624277457) internal successors, (232), 185 states have internal predecessors, (232), 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-21 03:13:19,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:19,078 INFO L93 Difference]: Finished difference Result 310 states and 410 transitions. [2022-02-21 03:13:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 410 transitions. [2022-02-21 03:13:19,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:19,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:19,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 173 states have (on average 1.3410404624277457) internal successors, (232), 185 states have internal predecessors, (232), 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 310 states. [2022-02-21 03:13:19,088 INFO L87 Difference]: Start difference. First operand has 191 states, 173 states have (on average 1.3410404624277457) internal successors, (232), 185 states have internal predecessors, (232), 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 310 states. [2022-02-21 03:13:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:19,102 INFO L93 Difference]: Finished difference Result 310 states and 410 transitions. [2022-02-21 03:13:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 410 transitions. [2022-02-21 03:13:19,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:19,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:19,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:19,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 173 states have (on average 1.3410404624277457) internal successors, (232), 185 states have internal predecessors, (232), 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-21 03:13:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 248 transitions. [2022-02-21 03:13:19,112 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 248 transitions. Word has length 7 [2022-02-21 03:13:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:19,112 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 248 transitions. [2022-02-21 03:13:19,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 248 transitions. [2022-02-21 03:13:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-21 03:13:19,113 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:19,113 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-21 03:13:19,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:13:19,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:19,332 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:13:19,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:19,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1931275711, now seen corresponding path program 1 times [2022-02-21 03:13:19,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:19,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447012679] [2022-02-21 03:13:19,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:19,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:19,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {2494#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; {2494#true} is VALID [2022-02-21 03:13:19,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {2494#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); {2496#(= (select (select |#memory_int| |ULTIMATE.start_main_~#i~0#1.base|) |ULTIMATE.start_main_~#i~0#1.offset|) 0)} is VALID [2022-02-21 03:13:19,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {2496#(= (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); {2497#(= |ULTIMATE.start_main_#t~mem7#1| 0)} is VALID [2022-02-21 03:13:19,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {2497#(= |ULTIMATE.start_main_#t~mem7#1| 0)} assume !(main_#t~mem7#1 < 10);havoc main_#t~mem7#1; {2495#false} is VALID [2022-02-21 03:13:19,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {2495#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2495#false} is VALID [2022-02-21 03:13:19,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {2495#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {2495#false} is VALID [2022-02-21 03:13:19,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {2495#false} assume !!(main_#t~mem145#1 < 10);havoc main_#t~mem145#1; {2495#false} is VALID [2022-02-21 03:13:19,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {2495#false} havoc main_~_hf_hashv~0#1; {2495#false} is VALID [2022-02-21 03:13:19,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {2495#false} goto; {2495#false} is VALID [2022-02-21 03:13:19,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {2495#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; {2495#false} is VALID [2022-02-21 03:13:19,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {2495#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {2495#false} is VALID [2022-02-21 03:13:19,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {2495#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {2495#false} is VALID [2022-02-21 03:13:19,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {2495#false} assume main_#t~switch158#1;call main_#t~mem159#1 := read~int(main_~_hj_key~1#1.base, 10 + main_~_hj_key~1#1.offset, 1);main_~_hf_hashv~0#1 := main_~_hf_hashv~0#1 + 16777216 * (main_#t~mem159#1 % 256);havoc main_#t~mem159#1; {2495#false} is VALID [2022-02-21 03:13:19,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {2495#false} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {2495#false} is VALID [2022-02-21 03:13:19,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {2495#false} assume !main_#t~switch158#1; {2495#false} is VALID [2022-02-21 03:13:19,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {2495#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {2495#false} is VALID [2022-02-21 03:13:19,413 INFO L290 TraceCheckUtils]: 16: Hoare triple {2495#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; {2495#false} is VALID [2022-02-21 03:13:19,413 INFO L290 TraceCheckUtils]: 17: Hoare triple {2495#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {2495#false} is VALID [2022-02-21 03:13:19,413 INFO L290 TraceCheckUtils]: 18: Hoare triple {2495#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; {2495#false} is VALID [2022-02-21 03:13:19,414 INFO L290 TraceCheckUtils]: 19: Hoare triple {2495#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {2495#false} is VALID [2022-02-21 03:13:19,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {2495#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; {2495#false} is VALID [2022-02-21 03:13:19,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {2495#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {2495#false} is VALID [2022-02-21 03:13:19,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {2495#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; {2495#false} is VALID [2022-02-21 03:13:19,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {2495#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {2495#false} is VALID [2022-02-21 03:13:19,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {2495#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; {2495#false} is VALID [2022-02-21 03:13:19,415 INFO L290 TraceCheckUtils]: 25: Hoare triple {2495#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {2495#false} is VALID [2022-02-21 03:13:19,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {2495#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; {2495#false} is VALID [2022-02-21 03:13:19,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {2495#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {2495#false} is VALID [2022-02-21 03:13:19,416 INFO L290 TraceCheckUtils]: 28: Hoare triple {2495#false} assume !main_#t~switch158#1; {2495#false} is VALID [2022-02-21 03:13:19,416 INFO L290 TraceCheckUtils]: 29: Hoare triple {2495#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {2495#false} is VALID [2022-02-21 03:13:19,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {2495#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; {2495#false} is VALID [2022-02-21 03:13:19,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {2495#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {2495#false} is VALID [2022-02-21 03:13:19,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {2495#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; {2495#false} is VALID [2022-02-21 03:13:19,417 INFO L290 TraceCheckUtils]: 33: Hoare triple {2495#false} havoc main_#t~switch158#1; {2495#false} is VALID [2022-02-21 03:13:19,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {2495#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)))); {2495#false} is VALID [2022-02-21 03:13:19,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {2495#false} goto; {2495#false} is VALID [2022-02-21 03:13:19,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {2495#false} goto; {2495#false} is VALID [2022-02-21 03:13:19,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {2495#false} goto; {2495#false} is VALID [2022-02-21 03:13:19,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {2495#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {2495#false} is VALID [2022-02-21 03:13:19,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {2495#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {2495#false} is VALID [2022-02-21 03:13:19,419 INFO L290 TraceCheckUtils]: 40: Hoare triple {2495#false} goto; {2495#false} is VALID [2022-02-21 03:13:19,419 INFO L290 TraceCheckUtils]: 41: Hoare triple {2495#false} goto; {2495#false} is VALID [2022-02-21 03:13:19,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {2495#false} assume main_~tmp~0#1.base != 0 || main_~tmp~0#1.offset != 0;call main_#t~mem189#1 := read~int(main_~tmp~0#1.base, main_~tmp~0#1.offset, 4);call main_#t~mem190#1 := read~int(main_~tmp~0#1.base, 4 + main_~tmp~0#1.offset, 4);assume { :begin_inline_test_int_int } true;test_int_int_#in~a#1, test_int_int_#in~b#1 := main_#t~mem189#1, main_#t~mem190#1;havoc test_int_int_#t~post3#1, test_int_int_#t~switch4#1, test_int_int_~a#1, test_int_int_~b#1;test_int_int_~a#1 := test_int_int_#in~a#1;test_int_int_~b#1 := test_int_int_#in~b#1;test_int_int_#t~post3#1 := ~count_int_int~0; {2495#false} is VALID [2022-02-21 03:13:19,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {2495#false} assume !(1 + test_int_int_#t~post3#1 <= 2147483647); {2495#false} is VALID [2022-02-21 03:13:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:19,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:19,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447012679] [2022-02-21 03:13:19,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447012679] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:19,420 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:19,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:13:19,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269412935] [2022-02-21 03:13:19,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:19,421 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-21 03:13:19,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:19,422 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-21 03:13:19,462 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-21 03:13:19,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:13:19,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:19,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:13:19,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:13:19,464 INFO L87 Difference]: Start difference. First operand 191 states and 248 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-21 03:13:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:20,464 INFO L93 Difference]: Finished difference Result 352 states and 466 transitions. [2022-02-21 03:13:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:13:20,464 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-21 03:13:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:20,464 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-21 03:13:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2022-02-21 03:13:20,470 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-21 03:13:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2022-02-21 03:13:20,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 466 transitions. [2022-02-21 03:13:20,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 466 edges. 466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:20,850 INFO L225 Difference]: With dead ends: 352 [2022-02-21 03:13:20,851 INFO L226 Difference]: Without dead ends: 269 [2022-02-21 03:13:20,851 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-21 03:13:20,852 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 99 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:20,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 603 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:13:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-02-21 03:13:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 191. [2022-02-21 03:13:20,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:20,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand has 191 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 185 states have internal predecessors, (231), 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-21 03:13:20,863 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand has 191 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 185 states have internal predecessors, (231), 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-21 03:13:20,864 INFO L87 Difference]: Start difference. First operand 269 states. Second operand has 191 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 185 states have internal predecessors, (231), 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-21 03:13:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:20,872 INFO L93 Difference]: Finished difference Result 269 states and 354 transitions. [2022-02-21 03:13:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 354 transitions. [2022-02-21 03:13:20,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:20,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:20,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 185 states have internal predecessors, (231), 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 269 states. [2022-02-21 03:13:20,875 INFO L87 Difference]: Start difference. First operand has 191 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 185 states have internal predecessors, (231), 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 269 states. [2022-02-21 03:13:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:20,883 INFO L93 Difference]: Finished difference Result 269 states and 354 transitions. [2022-02-21 03:13:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 354 transitions. [2022-02-21 03:13:20,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:20,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:20,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:20,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 173 states have (on average 1.3352601156069364) internal successors, (231), 185 states have internal predecessors, (231), 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-21 03:13:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 247 transitions. [2022-02-21 03:13:20,890 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 247 transitions. Word has length 44 [2022-02-21 03:13:20,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:20,890 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 247 transitions. [2022-02-21 03:13:20,891 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-21 03:13:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 247 transitions. [2022-02-21 03:13:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 03:13:20,892 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:20,892 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:13:20,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:13:20,892 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:13:20,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:20,893 INFO L85 PathProgramCache]: Analyzing trace with hash 305892652, now seen corresponding path program 1 times [2022-02-21 03:13:20,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:20,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196456799] [2022-02-21 03:13:20,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:20,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:20,995 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:20,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1172680198] [2022-02-21 03:13:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:20,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:20,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:20,998 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:13:21,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:13:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:21,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 1538 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:13:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:21,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:21,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {3694#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; {3694#true} is VALID [2022-02-21 03:13:21,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {3694#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); {3694#true} is VALID [2022-02-21 03:13:21,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {3694#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {3694#true} is VALID [2022-02-21 03:13:21,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {3694#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; {3694#true} is VALID [2022-02-21 03:13:21,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {3694#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {3694#true} is VALID [2022-02-21 03:13:21,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {3694#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); {3694#true} is VALID [2022-02-21 03:13:21,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {3694#true} assume main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647; {3694#true} is VALID [2022-02-21 03:13:21,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {3694#true} assume main_#t~mem10#1 * main_#t~mem11#1 >= -2147483648;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; {3694#true} is VALID [2022-02-21 03:13:21,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {3694#true} havoc main_~_ha_hashv~0#1; {3694#true} is VALID [2022-02-21 03:13:21,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {3694#true} goto; {3694#true} is VALID [2022-02-21 03:13:21,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {3694#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; {3694#true} is VALID [2022-02-21 03:13:21,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {3694#true} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {3694#true} is VALID [2022-02-21 03:13:21,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {3694#true} main_~_ha_hashv~0#1 := 4 + main_~_ha_hashv~0#1;main_#t~switch24#1 := 11 == main_~_hj_k~0#1; {3694#true} is VALID [2022-02-21 03:13:21,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {3694#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; {3694#true} is VALID [2022-02-21 03:13:21,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {3694#true} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {3694#true} is VALID [2022-02-21 03:13:21,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {3694#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; {3694#true} is VALID [2022-02-21 03:13:21,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {3694#true} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {3694#true} is VALID [2022-02-21 03:13:21,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {3694#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; {3694#true} is VALID [2022-02-21 03:13:21,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {3694#true} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {3694#true} is VALID [2022-02-21 03:13:21,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {3694#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; {3694#true} is VALID [2022-02-21 03:13:21,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {3694#true} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {3694#true} is VALID [2022-02-21 03:13:21,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {3694#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; {3694#true} is VALID [2022-02-21 03:13:21,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {3694#true} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {3694#true} is VALID [2022-02-21 03:13:21,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {3694#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; {3694#true} is VALID [2022-02-21 03:13:21,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {3694#true} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {3694#true} is VALID [2022-02-21 03:13:21,664 INFO L290 TraceCheckUtils]: 25: Hoare triple {3694#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; {3694#true} is VALID [2022-02-21 03:13:21,664 INFO L290 TraceCheckUtils]: 26: Hoare triple {3694#true} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {3694#true} is VALID [2022-02-21 03:13:21,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {3694#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; {3780#|ULTIMATE.start_main_#t~switch24#1|} is VALID [2022-02-21 03:13:21,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {3780#|ULTIMATE.start_main_#t~switch24#1|} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {3780#|ULTIMATE.start_main_#t~switch24#1|} is VALID [2022-02-21 03:13:21,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {3780#|ULTIMATE.start_main_#t~switch24#1|} assume !main_#t~switch24#1; {3695#false} is VALID [2022-02-21 03:13:21,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {3695#false} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {3695#false} is VALID [2022-02-21 03:13:21,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {3695#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; {3695#false} is VALID [2022-02-21 03:13:21,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {3695#false} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {3695#false} is VALID [2022-02-21 03:13:21,671 INFO L290 TraceCheckUtils]: 33: Hoare triple {3695#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; {3695#false} is VALID [2022-02-21 03:13:21,672 INFO L290 TraceCheckUtils]: 34: Hoare triple {3695#false} havoc main_#t~switch24#1; {3695#false} is VALID [2022-02-21 03:13:21,672 INFO L290 TraceCheckUtils]: 35: Hoare triple {3695#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)))); {3695#false} is VALID [2022-02-21 03:13:21,672 INFO L290 TraceCheckUtils]: 36: Hoare triple {3695#false} goto; {3695#false} is VALID [2022-02-21 03:13:21,672 INFO L290 TraceCheckUtils]: 37: Hoare triple {3695#false} goto; {3695#false} is VALID [2022-02-21 03:13:21,672 INFO L290 TraceCheckUtils]: 38: Hoare triple {3695#false} goto; {3695#false} is VALID [2022-02-21 03:13:21,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {3695#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); {3695#false} is VALID [2022-02-21 03:13:21,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {3695#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; {3695#false} is VALID [2022-02-21 03:13:21,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {3695#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; {3695#false} is VALID [2022-02-21 03:13:21,673 INFO L290 TraceCheckUtils]: 42: Hoare triple {3695#false} goto; {3695#false} is VALID [2022-02-21 03:13:21,673 INFO L290 TraceCheckUtils]: 43: Hoare triple {3695#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; {3695#false} is VALID [2022-02-21 03:13:21,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {3695#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; {3695#false} is VALID [2022-02-21 03:13:21,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {3695#false} goto; {3695#false} is VALID [2022-02-21 03:13:21,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {3695#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); {3695#false} is VALID [2022-02-21 03:13:21,674 INFO L290 TraceCheckUtils]: 47: Hoare triple {3695#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; {3695#false} is VALID [2022-02-21 03:13:21,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {3695#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; {3695#false} is VALID [2022-02-21 03:13:21,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {3695#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; {3695#false} is VALID [2022-02-21 03:13:21,675 INFO L290 TraceCheckUtils]: 50: Hoare triple {3695#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; {3695#false} is VALID [2022-02-21 03:13:21,675 INFO L290 TraceCheckUtils]: 51: Hoare triple {3695#false} goto; {3695#false} is VALID [2022-02-21 03:13:21,675 INFO L290 TraceCheckUtils]: 52: Hoare triple {3695#false} goto; {3695#false} is VALID [2022-02-21 03:13:21,675 INFO L290 TraceCheckUtils]: 53: Hoare triple {3695#false} goto; {3695#false} is VALID [2022-02-21 03:13:21,675 INFO L290 TraceCheckUtils]: 54: Hoare triple {3695#false} goto; {3695#false} is VALID [2022-02-21 03:13:21,675 INFO L290 TraceCheckUtils]: 55: Hoare triple {3695#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; {3695#false} is VALID [2022-02-21 03:13:21,675 INFO L290 TraceCheckUtils]: 56: Hoare triple {3695#false} assume !(1 + main_#t~post6#1 <= 2147483647); {3695#false} is VALID [2022-02-21 03:13:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:21,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:21,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:21,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196456799] [2022-02-21 03:13:21,676 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:21,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172680198] [2022-02-21 03:13:21,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172680198] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:21,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:21,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:13:21,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255870445] [2022-02-21 03:13:21,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:21,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 03:13:21,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:21,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:21,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:21,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:13:21,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:21,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:13:21,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:13:21,728 INFO L87 Difference]: Start difference. First operand 191 states and 247 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:22,224 INFO L93 Difference]: Finished difference Result 395 states and 517 transitions. [2022-02-21 03:13:22,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:13:22,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 03:13:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2022-02-21 03:13:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:22,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2022-02-21 03:13:22,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 511 transitions. [2022-02-21 03:13:22,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 511 edges. 511 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:22,626 INFO L225 Difference]: With dead ends: 395 [2022-02-21 03:13:22,627 INFO L226 Difference]: Without dead ends: 212 [2022-02-21 03:13:22,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:13:22,631 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 9 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:22,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 427 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-02-21 03:13:22,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2022-02-21 03:13:22,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:22,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 211 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 205 states have internal predecessors, (251), 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-21 03:13:22,646 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 211 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 205 states have internal predecessors, (251), 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-21 03:13:22,647 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 211 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 205 states have internal predecessors, (251), 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-21 03:13:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:22,654 INFO L93 Difference]: Finished difference Result 212 states and 268 transitions. [2022-02-21 03:13:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 268 transitions. [2022-02-21 03:13:22,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:22,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:22,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 205 states have internal predecessors, (251), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 212 states. [2022-02-21 03:13:22,657 INFO L87 Difference]: Start difference. First operand has 211 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 205 states have internal predecessors, (251), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand 212 states. [2022-02-21 03:13:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:22,663 INFO L93 Difference]: Finished difference Result 212 states and 268 transitions. [2022-02-21 03:13:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 268 transitions. [2022-02-21 03:13:22,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:22,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:22,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:22,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 193 states have (on average 1.3005181347150259) internal successors, (251), 205 states have internal predecessors, (251), 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-21 03:13:22,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 267 transitions. [2022-02-21 03:13:22,669 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 267 transitions. Word has length 57 [2022-02-21 03:13:22,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:22,671 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 267 transitions. [2022-02-21 03:13:22,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 267 transitions. [2022-02-21 03:13:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 03:13:22,674 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:22,674 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:13:22,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-21 03:13:22,897 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-21 03:13:22,898 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:13:22,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:22,899 INFO L85 PathProgramCache]: Analyzing trace with hash 815365742, now seen corresponding path program 1 times [2022-02-21 03:13:22,899 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:22,899 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726434886] [2022-02-21 03:13:22,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:22,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:23,026 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:23,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1079546215] [2022-02-21 03:13:23,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:23,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:23,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:23,028 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:13:23,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:13:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:23,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 1540 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:13:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:23,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:23,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {5010#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; {5010#true} is VALID [2022-02-21 03:13:23,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {5010#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); {5010#true} is VALID [2022-02-21 03:13:23,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {5010#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {5010#true} is VALID [2022-02-21 03:13:23,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {5010#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; {5010#true} is VALID [2022-02-21 03:13:23,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {5010#true} assume !(main_~user~0#1.base == 0 && main_~user~0#1.offset == 0); {5010#true} is VALID [2022-02-21 03:13:23,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {5010#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); {5010#true} is VALID [2022-02-21 03:13:23,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {5010#true} assume main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647; {5010#true} is VALID [2022-02-21 03:13:23,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {5010#true} assume main_#t~mem10#1 * main_#t~mem11#1 >= -2147483648;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; {5010#true} is VALID [2022-02-21 03:13:23,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {5010#true} havoc main_~_ha_hashv~0#1; {5010#true} is VALID [2022-02-21 03:13:23,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {5010#true} goto; {5010#true} is VALID [2022-02-21 03:13:23,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {5010#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; {5045#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-21 03:13:23,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {5045#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} assume !(main_~_hj_k~0#1 % 4294967296 >= 12); {5045#(<= |ULTIMATE.start_main_~_hj_k~0#1| 4)} is VALID [2022-02-21 03:13:23,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {5045#(<= |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; {5052#(not |ULTIMATE.start_main_#t~switch24#1|)} is VALID [2022-02-21 03:13:23,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {5052#(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; {5011#false} is VALID [2022-02-21 03:13:23,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {5011#false} main_#t~switch24#1 := main_#t~switch24#1 || 10 == main_~_hj_k~0#1; {5011#false} is VALID [2022-02-21 03:13:23,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {5011#false} main_#t~switch24#1 := main_#t~switch24#1 || 9 == main_~_hj_k~0#1; {5011#false} is VALID [2022-02-21 03:13:23,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {5011#false} main_#t~switch24#1 := main_#t~switch24#1 || 8 == main_~_hj_k~0#1; {5011#false} is VALID [2022-02-21 03:13:23,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {5011#false} main_#t~switch24#1 := main_#t~switch24#1 || 7 == main_~_hj_k~0#1; {5011#false} is VALID [2022-02-21 03:13:23,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {5011#false} main_#t~switch24#1 := main_#t~switch24#1 || 6 == main_~_hj_k~0#1; {5011#false} is VALID [2022-02-21 03:13:23,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {5011#false} main_#t~switch24#1 := main_#t~switch24#1 || 5 == main_~_hj_k~0#1; {5011#false} is VALID [2022-02-21 03:13:23,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {5011#false} main_#t~switch24#1 := main_#t~switch24#1 || 4 == main_~_hj_k~0#1; {5011#false} is VALID [2022-02-21 03:13:23,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {5011#false} main_#t~switch24#1 := main_#t~switch24#1 || 3 == main_~_hj_k~0#1; {5011#false} is VALID [2022-02-21 03:13:23,734 INFO L290 TraceCheckUtils]: 29: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,734 INFO L290 TraceCheckUtils]: 30: Hoare triple {5011#false} main_#t~switch24#1 := main_#t~switch24#1 || 2 == main_~_hj_k~0#1; {5011#false} is VALID [2022-02-21 03:13:23,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {5011#false} main_#t~switch24#1 := main_#t~switch24#1 || 1 == main_~_hj_k~0#1; {5011#false} is VALID [2022-02-21 03:13:23,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {5011#false} havoc main_#t~switch24#1; {5011#false} is VALID [2022-02-21 03:13:23,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {5011#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)))); {5011#false} is VALID [2022-02-21 03:13:23,734 INFO L290 TraceCheckUtils]: 36: Hoare triple {5011#false} goto; {5011#false} is VALID [2022-02-21 03:13:23,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {5011#false} goto; {5011#false} is VALID [2022-02-21 03:13:23,735 INFO L290 TraceCheckUtils]: 38: Hoare triple {5011#false} goto; {5011#false} is VALID [2022-02-21 03:13:23,735 INFO L290 TraceCheckUtils]: 39: Hoare triple {5011#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); {5011#false} is VALID [2022-02-21 03:13:23,735 INFO L290 TraceCheckUtils]: 40: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,735 INFO L290 TraceCheckUtils]: 41: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {5011#false} goto; {5011#false} is VALID [2022-02-21 03:13:23,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,736 INFO L290 TraceCheckUtils]: 44: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,736 INFO L290 TraceCheckUtils]: 45: Hoare triple {5011#false} goto; {5011#false} is VALID [2022-02-21 03:13:23,736 INFO L290 TraceCheckUtils]: 46: Hoare triple {5011#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); {5011#false} is VALID [2022-02-21 03:13:23,736 INFO L290 TraceCheckUtils]: 47: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,736 INFO L290 TraceCheckUtils]: 48: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,736 INFO L290 TraceCheckUtils]: 49: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,736 INFO L290 TraceCheckUtils]: 51: Hoare triple {5011#false} goto; {5011#false} is VALID [2022-02-21 03:13:23,737 INFO L290 TraceCheckUtils]: 52: Hoare triple {5011#false} goto; {5011#false} is VALID [2022-02-21 03:13:23,737 INFO L290 TraceCheckUtils]: 53: Hoare triple {5011#false} goto; {5011#false} is VALID [2022-02-21 03:13:23,737 INFO L290 TraceCheckUtils]: 54: Hoare triple {5011#false} goto; {5011#false} is VALID [2022-02-21 03:13:23,737 INFO L290 TraceCheckUtils]: 55: Hoare triple {5011#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; {5011#false} is VALID [2022-02-21 03:13:23,737 INFO L290 TraceCheckUtils]: 56: Hoare triple {5011#false} assume !(1 + main_#t~post6#1 <= 2147483647); {5011#false} is VALID [2022-02-21 03:13:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:23,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:23,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:23,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726434886] [2022-02-21 03:13:23,774 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:23,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079546215] [2022-02-21 03:13:23,774 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079546215] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:23,775 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:23,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:13:23,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679552430] [2022-02-21 03:13:23,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:23,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 03:13:23,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:23,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:23,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:23,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:13:23,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:23,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:13:23,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:13:23,819 INFO L87 Difference]: Start difference. First operand 211 states and 267 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:24,572 INFO L93 Difference]: Finished difference Result 404 states and 516 transitions. [2022-02-21 03:13:24,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:13:24,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 03:13:24,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-02-21 03:13:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:24,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-02-21 03:13:24,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 493 transitions. [2022-02-21 03:13:24,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:24,994 INFO L225 Difference]: With dead ends: 404 [2022-02-21 03:13:24,995 INFO L226 Difference]: Without dead ends: 201 [2022-02-21 03:13:24,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:13:24,995 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 206 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:13:24,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 459 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-02-21 03:13:25,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2022-02-21 03:13:25,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:25,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 197 states, 179 states have (on average 1.2849162011173185) internal successors, (230), 191 states have internal predecessors, (230), 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-21 03:13:25,032 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 197 states, 179 states have (on average 1.2849162011173185) internal successors, (230), 191 states have internal predecessors, (230), 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-21 03:13:25,032 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 197 states, 179 states have (on average 1.2849162011173185) internal successors, (230), 191 states have internal predecessors, (230), 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-21 03:13:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:25,037 INFO L93 Difference]: Finished difference Result 201 states and 250 transitions. [2022-02-21 03:13:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 250 transitions. [2022-02-21 03:13:25,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:25,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:25,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 179 states have (on average 1.2849162011173185) internal successors, (230), 191 states have internal predecessors, (230), 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 201 states. [2022-02-21 03:13:25,039 INFO L87 Difference]: Start difference. First operand has 197 states, 179 states have (on average 1.2849162011173185) internal successors, (230), 191 states have internal predecessors, (230), 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 201 states. [2022-02-21 03:13:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:25,043 INFO L93 Difference]: Finished difference Result 201 states and 250 transitions. [2022-02-21 03:13:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 250 transitions. [2022-02-21 03:13:25,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:25,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:25,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:25,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 179 states have (on average 1.2849162011173185) internal successors, (230), 191 states have internal predecessors, (230), 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-21 03:13:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 246 transitions. [2022-02-21 03:13:25,051 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 246 transitions. Word has length 57 [2022-02-21 03:13:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:25,051 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 246 transitions. [2022-02-21 03:13:25,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 246 transitions. [2022-02-21 03:13:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-02-21 03:13:25,052 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:25,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:13:25,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-21 03:13:25,277 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-21 03:13:25,277 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:13:25,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1455665376, now seen corresponding path program 1 times [2022-02-21 03:13:25,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:25,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670265572] [2022-02-21 03:13:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:25,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:25,380 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:25,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [463398946] [2022-02-21 03:13:25,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:25,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:25,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:25,394 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:13:25,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:13:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:26,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 1526 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:13:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:26,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:26,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {6305#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; {6305#true} is VALID [2022-02-21 03:13:26,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {6305#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); {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {6313#(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); {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {6313#(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); {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {6313#(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); {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume main_#t~mem10#1 * main_#t~mem11#1 >= -2147483648;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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_~_ha_hashv~0#1; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {6313#(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); {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} assume !main_#t~switch24#1; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {6313#(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; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} havoc main_#t~switch24#1; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {6313#(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)))); {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} goto; {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {6313#(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); {6313#(and (= |ULTIMATE.start_main_~users~0#1.offset| 0) (= |ULTIMATE.start_main_~users~0#1.base| 0))} is VALID [2022-02-21 03:13:26,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {6313#(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; {6306#false} is VALID [2022-02-21 03:13:26,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {6306#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; {6306#false} is VALID [2022-02-21 03:13:26,371 INFO L290 TraceCheckUtils]: 42: Hoare triple {6306#false} goto; {6306#false} is VALID [2022-02-21 03:13:26,371 INFO L290 TraceCheckUtils]: 43: Hoare triple {6306#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; {6306#false} is VALID [2022-02-21 03:13:26,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {6306#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; {6306#false} is VALID [2022-02-21 03:13:26,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {6306#false} goto; {6306#false} is VALID [2022-02-21 03:13:26,371 INFO L290 TraceCheckUtils]: 46: Hoare triple {6306#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); {6306#false} is VALID [2022-02-21 03:13:26,372 INFO L290 TraceCheckUtils]: 47: Hoare triple {6306#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; {6306#false} is VALID [2022-02-21 03:13:26,372 INFO L290 TraceCheckUtils]: 48: Hoare triple {6306#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; {6306#false} is VALID [2022-02-21 03:13:26,372 INFO L290 TraceCheckUtils]: 49: Hoare triple {6306#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; {6306#false} is VALID [2022-02-21 03:13:26,372 INFO L290 TraceCheckUtils]: 50: Hoare triple {6306#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; {6306#false} is VALID [2022-02-21 03:13:26,372 INFO L290 TraceCheckUtils]: 51: Hoare triple {6306#false} goto; {6306#false} is VALID [2022-02-21 03:13:26,372 INFO L290 TraceCheckUtils]: 52: Hoare triple {6306#false} goto; {6306#false} is VALID [2022-02-21 03:13:26,373 INFO L290 TraceCheckUtils]: 53: Hoare triple {6306#false} goto; {6306#false} is VALID [2022-02-21 03:13:26,373 INFO L290 TraceCheckUtils]: 54: Hoare triple {6306#false} goto; {6306#false} is VALID [2022-02-21 03:13:26,373 INFO L290 TraceCheckUtils]: 55: Hoare triple {6306#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; {6306#false} is VALID [2022-02-21 03:13:26,373 INFO L290 TraceCheckUtils]: 56: Hoare triple {6306#false} assume !(1 + main_#t~post6#1 <= 2147483647); {6306#false} is VALID [2022-02-21 03:13:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:13:26,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:13:26,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:13:26,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670265572] [2022-02-21 03:13:26,374 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:13:26,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463398946] [2022-02-21 03:13:26,374 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463398946] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:13:26,374 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:13:26,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:13:26,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031354855] [2022-02-21 03:13:26,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:13:26,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 03:13:26,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:13:26,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:26,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:26,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:13:26,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:13:26,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:13:26,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:13:26,422 INFO L87 Difference]: Start difference. First operand 197 states and 246 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:28,315 INFO L93 Difference]: Finished difference Result 490 states and 617 transitions. [2022-02-21 03:13:28,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:13:28,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-02-21 03:13:28,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:13:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 599 transitions. [2022-02-21 03:13:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:28,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 599 transitions. [2022-02-21 03:13:28,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 599 transitions. [2022-02-21 03:13:28,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 599 edges. 599 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:13:28,874 INFO L225 Difference]: With dead ends: 490 [2022-02-21 03:13:28,875 INFO L226 Difference]: Without dead ends: 301 [2022-02-21 03:13:28,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:13:28,879 INFO L933 BasicCegarLoop]: 287 mSDtfsCounter, 88 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 499 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-21 03:13:28,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 499 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:13:28,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-02-21 03:13:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 297. [2022-02-21 03:13:28,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:13:28,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 297 states, 274 states have (on average 1.281021897810219) internal successors, (351), 291 states have internal predecessors, (351), 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-21 03:13:28,917 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 297 states, 274 states have (on average 1.281021897810219) internal successors, (351), 291 states have internal predecessors, (351), 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-21 03:13:28,917 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 297 states, 274 states have (on average 1.281021897810219) internal successors, (351), 291 states have internal predecessors, (351), 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-21 03:13:28,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:28,926 INFO L93 Difference]: Finished difference Result 301 states and 377 transitions. [2022-02-21 03:13:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 377 transitions. [2022-02-21 03:13:28,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:28,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:28,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 274 states have (on average 1.281021897810219) internal successors, (351), 291 states have internal predecessors, (351), 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 301 states. [2022-02-21 03:13:28,928 INFO L87 Difference]: Start difference. First operand has 297 states, 274 states have (on average 1.281021897810219) internal successors, (351), 291 states have internal predecessors, (351), 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 301 states. [2022-02-21 03:13:28,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:13:28,935 INFO L93 Difference]: Finished difference Result 301 states and 377 transitions. [2022-02-21 03:13:28,935 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 377 transitions. [2022-02-21 03:13:28,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:13:28,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:13:28,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:13:28,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:13:28,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 274 states have (on average 1.281021897810219) internal successors, (351), 291 states have internal predecessors, (351), 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-21 03:13:28,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 377 transitions. [2022-02-21 03:13:28,951 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 377 transitions. Word has length 57 [2022-02-21 03:13:28,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:13:28,952 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 377 transitions. [2022-02-21 03:13:28,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:13:28,952 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 377 transitions. [2022-02-21 03:13:28,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-21 03:13:28,954 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:13:28,955 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:13:28,982 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-21 03:13:29,167 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-21 03:13:29,167 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-02-21 03:13:29,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:13:29,168 INFO L85 PathProgramCache]: Analyzing trace with hash 471982450, now seen corresponding path program 1 times [2022-02-21 03:13:29,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:13:29,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407248781] [2022-02-21 03:13:29,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:29,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:13:29,230 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:13:29,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113119826] [2022-02-21 03:13:29,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:13:29,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:13:29,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:13:29,232 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:13:29,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:13:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:29,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 158 conjunts are in the unsatisfiable core [2022-02-21 03:13:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:13:29,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:13:29,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-21 03:13:29,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-21 03:13:29,872 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-21 03:13:29,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-21 03:13:29,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-21 03:13:30,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-21 03:13:30,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-21 03:13:30,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-21 03:13:30,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-21 03:13:31,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-21 03:13:31,023 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-02-21 03:13:31,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2022-02-21 03:13:31,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3