./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-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_test9-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 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:14:14,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:14:14,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:14:14,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:14:14,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:14:14,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:14:14,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:14:14,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:14:14,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:14:14,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:14:14,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:14:14,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:14:14,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:14:14,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:14:14,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:14:14,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:14:14,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:14:14,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:14:14,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:14:14,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:14:14,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:14:14,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:14:14,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:14:14,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:14:14,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:14:14,561 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:14:14,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:14:14,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:14:14,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:14:14,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:14:14,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:14:14,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:14:14,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:14:14,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:14:14,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:14:14,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:14:14,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:14:14,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:14:14,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:14:14,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:14:14,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:14:14,576 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:14:14,596 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:14:14,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:14:14,597 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:14:14,597 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:14:14,598 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:14:14,598 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:14:14,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:14:14,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:14:14,599 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:14:14,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:14:14,600 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:14:14,600 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:14:14,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:14:14,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:14:14,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:14:14,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:14:14,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:14:14,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:14:14,601 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:14:14,601 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:14:14,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:14:14,602 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:14:14,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:14:14,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:14:14,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:14:14,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:14:14,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:14:14,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:14:14,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:14:14,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:14:14,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:14:14,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:14:14,604 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:14:14,604 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 -> 6698dfe763688c38a478c53cfe3bc6bac092e445bf13ef44be53eb6068218c93 [2022-02-21 03:14:14,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:14:14,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:14:14,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:14:14,873 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:14:14,874 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:14:14,875 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_test9-1.i [2022-02-21 03:14:14,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2532b4a2d/96e4b7eb2b364f1b9d53fefb98ce3aed/FLAGb353a323d [2022-02-21 03:14:15,537 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:14:15,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-1.i [2022-02-21 03:14:15,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2532b4a2d/96e4b7eb2b364f1b9d53fefb98ce3aed/FLAGb353a323d [2022-02-21 03:14:15,949 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2532b4a2d/96e4b7eb2b364f1b9d53fefb98ce3aed [2022-02-21 03:14:15,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:14:15,952 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:14:15,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:14:15,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:14:15,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:14:15,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:14:15" (1/1) ... [2022-02-21 03:14:15,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42796eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:14:15, skipping insertion in model container [2022-02-21 03:14:15,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:14:15" (1/1) ... [2022-02-21 03:14:15,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:14:16,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:14:16,453 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_test9-1.i[33021,33034] [2022-02-21 03:14:16,708 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_test9-1.i[84583,84596] [2022-02-21 03:14:16,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:14:16,726 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:14:16,754 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_test9-1.i[33021,33034] [2022-02-21 03:14:16,902 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_test9-1.i[84583,84596] [2022-02-21 03:14:16,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:14:16,954 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:14:16,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:14:16 WrapperNode [2022-02-21 03:14:16,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:14:16,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:14:16,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:14:16,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:14:16,963 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:14:16" (1/1) ... [2022-02-21 03:14:17,006 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:14:16" (1/1) ... [2022-02-21 03:14:17,163 INFO L137 Inliner]: procedures = 177, calls = 730, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2872 [2022-02-21 03:14:17,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:14:17,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:14:17,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:14:17,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:14:17,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:14:16" (1/1) ... [2022-02-21 03:14:17,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:14:16" (1/1) ... [2022-02-21 03:14:17,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:14:16" (1/1) ... [2022-02-21 03:14:17,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:14:16" (1/1) ... [2022-02-21 03:14:17,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:14:16" (1/1) ... [2022-02-21 03:14:17,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:14:16" (1/1) ... [2022-02-21 03:14:17,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:14:16" (1/1) ... [2022-02-21 03:14:17,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:14:17,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:14:17,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:14:17,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:14:17,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:14:16" (1/1) ... [2022-02-21 03:14:17,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:14:17,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:14:17,348 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:14:17,372 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:14:17,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:14:17,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-21 03:14:17,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-21 03:14:17,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:14:17,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-21 03:14:17,394 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-21 03:14:17,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-21 03:14:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:14:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-21 03:14:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:14:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-21 03:14:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-21 03:14:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:14:17,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:14:17,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:14:17,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:14:17,601 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:14:17,603 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:14:20,546 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:14:20,569 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:14:20,569 INFO L299 CfgBuilder]: Removed 54 assume(true) statements. [2022-02-21 03:14:20,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:14:20 BoogieIcfgContainer [2022-02-21 03:14:20,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:14:20,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:14:20,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:14:20,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:14:20,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:14:15" (1/3) ... [2022-02-21 03:14:20,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c5db2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:14:20, skipping insertion in model container [2022-02-21 03:14:20,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:14:16" (2/3) ... [2022-02-21 03:14:20,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c5db2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:14:20, skipping insertion in model container [2022-02-21 03:14:20,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:14:20" (3/3) ... [2022-02-21 03:14:20,582 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-1.i [2022-02-21 03:14:20,587 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:14:20,587 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-02-21 03:14:20,659 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:14:20,664 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:14:20,664 INFO L340 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-02-21 03:14:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 1179 states, 665 states have (on average 1.9233082706766917) internal successors, (1279), 1173 states have internal predecessors, (1279), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-21 03:14:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:14:20,718 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:14:20,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:14:20,719 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:14:20,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:14:20,723 INFO L85 PathProgramCache]: Analyzing trace with hash 552713999, now seen corresponding path program 1 times [2022-02-21 03:14:20,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:14:20,732 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588122511] [2022-02-21 03:14:20,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:14:20,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:14:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:14:20,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {1182#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; {1182#true} is VALID [2022-02-21 03:14:20,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {1182#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); {1182#true} is VALID [2022-02-21 03:14:20,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {1182#true} call main_#t~mem7#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {1182#true} is VALID [2022-02-21 03:14:20,882 INFO L290 TraceCheckUtils]: 3: Hoare triple {1182#true} assume !!(main_#t~mem7#1 < 1000);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; {1182#true} is VALID [2022-02-21 03:14:20,883 INFO L290 TraceCheckUtils]: 4: Hoare triple {1182#true} assume main_~user~0#1.base == 0 && main_~user~0#1.offset == 0;assume false; {1183#false} is VALID [2022-02-21 03:14:20,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#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); {1183#false} is VALID [2022-02-21 03:14:20,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {1183#false} assume !(main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647); {1183#false} is VALID [2022-02-21 03:14:20,884 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:14:20,885 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:14:20,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588122511] [2022-02-21 03:14:20,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588122511] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:14:20,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:14:20,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:14:20,887 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076949410] [2022-02-21 03:14:20,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:14:20,892 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:14:20,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:14:20,896 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:14:20,915 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:14:20,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:14:20,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:14:20,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:14:20,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:14:20,953 INFO L87 Difference]: Start difference. First operand has 1179 states, 665 states have (on average 1.9233082706766917) internal successors, (1279), 1173 states have internal predecessors, (1279), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) 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:14:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:14:23,747 INFO L93 Difference]: Finished difference Result 2356 states and 5068 transitions. [2022-02-21 03:14:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:14:23,748 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:14:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:14:23,749 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:14:24,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5068 transitions. [2022-02-21 03:14:24,340 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:14:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 5068 transitions. [2022-02-21 03:14:24,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 5068 transitions. [2022-02-21 03:14:29,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5068 edges. 5068 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:14:29,464 INFO L225 Difference]: With dead ends: 2356 [2022-02-21 03:14:29,464 INFO L226 Difference]: Without dead ends: 1175 [2022-02-21 03:14:29,478 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:14:29,482 INFO L933 BasicCegarLoop]: 2225 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, 2225 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:14:29,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2225 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:14:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2022-02-21 03:14:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175. [2022-02-21 03:14:29,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:14:29,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1175 states. Second operand has 1175 states, 662 states have (on average 1.8353474320241692) internal successors, (1215), 1169 states have internal predecessors, (1215), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-21 03:14:29,806 INFO L74 IsIncluded]: Start isIncluded. First operand 1175 states. Second operand has 1175 states, 662 states have (on average 1.8353474320241692) internal successors, (1215), 1169 states have internal predecessors, (1215), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-21 03:14:29,810 INFO L87 Difference]: Start difference. First operand 1175 states. Second operand has 1175 states, 662 states have (on average 1.8353474320241692) internal successors, (1215), 1169 states have internal predecessors, (1215), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-21 03:14:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:14:30,101 INFO L93 Difference]: Finished difference Result 1175 states and 2221 transitions. [2022-02-21 03:14:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 2221 transitions. [2022-02-21 03:14:30,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:14:30,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:14:30,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 1175 states, 662 states have (on average 1.8353474320241692) internal successors, (1215), 1169 states have internal predecessors, (1215), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand 1175 states. [2022-02-21 03:14:30,127 INFO L87 Difference]: Start difference. First operand has 1175 states, 662 states have (on average 1.8353474320241692) internal successors, (1215), 1169 states have internal predecessors, (1215), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand 1175 states. [2022-02-21 03:14:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:14:30,439 INFO L93 Difference]: Finished difference Result 1175 states and 2221 transitions. [2022-02-21 03:14:30,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 2221 transitions. [2022-02-21 03:14:30,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:14:30,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:14:30,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:14:30,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:14:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 662 states have (on average 1.8353474320241692) internal successors, (1215), 1169 states have internal predecessors, (1215), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-21 03:14:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 2221 transitions. [2022-02-21 03:14:30,777 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 2221 transitions. Word has length 7 [2022-02-21 03:14:30,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:14:30,778 INFO L470 AbstractCegarLoop]: Abstraction has 1175 states and 2221 transitions. [2022-02-21 03:14:30,778 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:14:30,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 2221 transitions. [2022-02-21 03:14:30,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:14:30,781 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:14:30,782 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:14:30,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:14:30,783 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:14:30,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:14:30,785 INFO L85 PathProgramCache]: Analyzing trace with hash 552715921, now seen corresponding path program 1 times [2022-02-21 03:14:30,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:14:30,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185771317] [2022-02-21 03:14:30,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:14:30,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:14:30,824 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:14:30,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [950348893] [2022-02-21 03:14:30,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:14:30,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:14:30,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:14:30,828 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:14:30,829 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:14:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:14:30,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:14:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:14:30,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:14:31,045 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:14:31,050 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:14:31,094 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-21 03:14:31,094 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:14:31,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-21 03:14:31,221 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:14:31,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {8665#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; {8665#true} is VALID [2022-02-21 03:14:31,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {8665#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); {8673#(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:14:31,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {8673#(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); {8673#(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:14:31,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {8673#(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 < 1000);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; {8680#(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:14:31,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {8680#(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); {8680#(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:14:31,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {8680#(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); {8687#(= |ULTIMATE.start_main_#t~mem11#1| 0)} is VALID [2022-02-21 03:14:31,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {8687#(= |ULTIMATE.start_main_#t~mem11#1| 0)} assume !(main_#t~mem10#1 * main_#t~mem11#1 <= 2147483647); {8666#false} is VALID [2022-02-21 03:14:31,244 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:14:31,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:14:31,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:14:31,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185771317] [2022-02-21 03:14:31,245 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:14:31,245 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950348893] [2022-02-21 03:14:31,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950348893] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:14:31,247 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:14:31,247 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:14:31,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75525140] [2022-02-21 03:14:31,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:14:31,249 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:14:31,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:14:31,249 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:14:31,256 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:14:31,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:14:31,257 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:14:31,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:14:31,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:14:31,258 INFO L87 Difference]: Start difference. First operand 1175 states and 2221 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:14:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:14:50,405 INFO L93 Difference]: Finished difference Result 2292 states and 4372 transitions. [2022-02-21 03:14:50,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:14:50,405 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:14:50,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:14:50,406 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:14:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4372 transitions. [2022-02-21 03:14:50,846 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:14:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 4372 transitions. [2022-02-21 03:14:51,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 4372 transitions. [2022-02-21 03:14:54,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4372 edges. 4372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:14:55,318 INFO L225 Difference]: With dead ends: 2292 [2022-02-21 03:14:55,318 INFO L226 Difference]: Without dead ends: 2290 [2022-02-21 03:14:55,319 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:14:55,320 INFO L933 BasicCegarLoop]: 2674 mSDtfsCounter, 1185 mSDsluCounter, 5960 mSDsCounter, 0 mSdLazyCounter, 1753 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1685 SdHoareTripleChecker+Valid, 8634 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:14:55,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1685 Valid, 8634 Invalid, 1768 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 1753 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-21 03:14:55,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2022-02-21 03:14:55,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 1181. [2022-02-21 03:14:55,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:14:55,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2290 states. Second operand has 1181 states, 668 states have (on average 1.8293413173652695) internal successors, (1222), 1175 states have internal predecessors, (1222), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-21 03:14:55,563 INFO L74 IsIncluded]: Start isIncluded. First operand 2290 states. Second operand has 1181 states, 668 states have (on average 1.8293413173652695) internal successors, (1222), 1175 states have internal predecessors, (1222), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-21 03:14:55,567 INFO L87 Difference]: Start difference. First operand 2290 states. Second operand has 1181 states, 668 states have (on average 1.8293413173652695) internal successors, (1222), 1175 states have internal predecessors, (1222), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-21 03:14:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:14:56,579 INFO L93 Difference]: Finished difference Result 2290 states and 4370 transitions. [2022-02-21 03:14:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 4370 transitions. [2022-02-21 03:14:56,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:14:56,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:14:56,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 1181 states, 668 states have (on average 1.8293413173652695) internal successors, (1222), 1175 states have internal predecessors, (1222), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand 2290 states. [2022-02-21 03:14:56,599 INFO L87 Difference]: Start difference. First operand has 1181 states, 668 states have (on average 1.8293413173652695) internal successors, (1222), 1175 states have internal predecessors, (1222), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) Second operand 2290 states. [2022-02-21 03:14:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:14:57,336 INFO L93 Difference]: Finished difference Result 2290 states and 4370 transitions. [2022-02-21 03:14:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 4370 transitions. [2022-02-21 03:14:57,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:14:57,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:14:57,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:14:57,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:14:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 668 states have (on average 1.8293413173652695) internal successors, (1222), 1175 states have internal predecessors, (1222), 503 states have call successors, (503), 2 states have call predecessors, (503), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2022-02-21 03:14:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 2228 transitions. [2022-02-21 03:14:57,621 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 2228 transitions. Word has length 7 [2022-02-21 03:14:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:14:57,622 INFO L470 AbstractCegarLoop]: Abstraction has 1181 states and 2228 transitions. [2022-02-21 03:14:57,622 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:14:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 2228 transitions. [2022-02-21 03:14:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-21 03:14:57,624 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:14:57,624 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:14:57,650 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:14:57,847 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:14:57,848 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:14:57,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:14:57,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1931275711, now seen corresponding path program 1 times [2022-02-21 03:14:57,849 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:14:57,849 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121869165] [2022-02-21 03:14:57,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:14:57,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:14:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:14:57,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {18334#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; {18334#true} is VALID [2022-02-21 03:14:57,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {18334#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); {18336#(= (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:14:57,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {18336#(= (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); {18337#(= |ULTIMATE.start_main_#t~mem7#1| 0)} is VALID [2022-02-21 03:14:57,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {18337#(= |ULTIMATE.start_main_#t~mem7#1| 0)} assume !(main_#t~mem7#1 < 1000);havoc main_#t~mem7#1; {18335#false} is VALID [2022-02-21 03:14:57,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {18335#false} call write~int(0, main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18335#false} is VALID [2022-02-21 03:14:57,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {18335#false} call main_#t~mem145#1 := read~int(main_~#i~0#1.base, main_~#i~0#1.offset, 4); {18335#false} is VALID [2022-02-21 03:14:57,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {18335#false} assume !!(main_#t~mem145#1 < 1000);havoc main_#t~mem145#1; {18335#false} is VALID [2022-02-21 03:14:57,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {18335#false} havoc main_~_hf_hashv~0#1; {18335#false} is VALID [2022-02-21 03:14:57,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {18335#false} goto; {18335#false} is VALID [2022-02-21 03:14:57,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {18335#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; {18335#false} is VALID [2022-02-21 03:14:57,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {18335#false} assume !(main_~_hj_k~1#1 % 4294967296 >= 12); {18335#false} is VALID [2022-02-21 03:14:57,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {18335#false} main_~_hf_hashv~0#1 := 4 + main_~_hf_hashv~0#1;main_#t~switch158#1 := 11 == main_~_hj_k~1#1; {18335#false} is VALID [2022-02-21 03:14:57,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {18335#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; {18335#false} is VALID [2022-02-21 03:14:57,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {18335#false} main_#t~switch158#1 := main_#t~switch158#1 || 10 == main_~_hj_k~1#1; {18335#false} is VALID [2022-02-21 03:14:57,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {18335#false} assume !main_#t~switch158#1; {18335#false} is VALID [2022-02-21 03:14:57,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {18335#false} main_#t~switch158#1 := main_#t~switch158#1 || 9 == main_~_hj_k~1#1; {18335#false} is VALID [2022-02-21 03:14:57,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {18335#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; {18335#false} is VALID [2022-02-21 03:14:57,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {18335#false} main_#t~switch158#1 := main_#t~switch158#1 || 8 == main_~_hj_k~1#1; {18335#false} is VALID [2022-02-21 03:14:57,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {18335#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; {18335#false} is VALID [2022-02-21 03:14:57,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {18335#false} main_#t~switch158#1 := main_#t~switch158#1 || 7 == main_~_hj_k~1#1; {18335#false} is VALID [2022-02-21 03:14:57,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {18335#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; {18335#false} is VALID [2022-02-21 03:14:57,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {18335#false} main_#t~switch158#1 := main_#t~switch158#1 || 6 == main_~_hj_k~1#1; {18335#false} is VALID [2022-02-21 03:14:57,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {18335#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; {18335#false} is VALID [2022-02-21 03:14:57,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {18335#false} main_#t~switch158#1 := main_#t~switch158#1 || 5 == main_~_hj_k~1#1; {18335#false} is VALID [2022-02-21 03:14:57,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {18335#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; {18335#false} is VALID [2022-02-21 03:14:57,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {18335#false} main_#t~switch158#1 := main_#t~switch158#1 || 4 == main_~_hj_k~1#1; {18335#false} is VALID [2022-02-21 03:14:57,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {18335#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; {18335#false} is VALID [2022-02-21 03:14:57,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {18335#false} main_#t~switch158#1 := main_#t~switch158#1 || 3 == main_~_hj_k~1#1; {18335#false} is VALID [2022-02-21 03:14:57,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {18335#false} assume !main_#t~switch158#1; {18335#false} is VALID [2022-02-21 03:14:57,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {18335#false} main_#t~switch158#1 := main_#t~switch158#1 || 2 == main_~_hj_k~1#1; {18335#false} is VALID [2022-02-21 03:14:57,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {18335#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; {18335#false} is VALID [2022-02-21 03:14:57,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {18335#false} main_#t~switch158#1 := main_#t~switch158#1 || 1 == main_~_hj_k~1#1; {18335#false} is VALID [2022-02-21 03:14:57,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {18335#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; {18335#false} is VALID [2022-02-21 03:14:57,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {18335#false} havoc main_#t~switch158#1; {18335#false} is VALID [2022-02-21 03:14:57,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {18335#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)))); {18335#false} is VALID [2022-02-21 03:14:57,962 INFO L290 TraceCheckUtils]: 35: Hoare triple {18335#false} goto; {18335#false} is VALID [2022-02-21 03:14:57,963 INFO L290 TraceCheckUtils]: 36: Hoare triple {18335#false} goto; {18335#false} is VALID [2022-02-21 03:14:57,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {18335#false} goto; {18335#false} is VALID [2022-02-21 03:14:57,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {18335#false} main_~tmp~0#1.base, main_~tmp~0#1.offset := 0, 0; {18335#false} is VALID [2022-02-21 03:14:57,963 INFO L290 TraceCheckUtils]: 39: Hoare triple {18335#false} assume !(main_~users~0#1.base != 0 || main_~users~0#1.offset != 0); {18335#false} is VALID [2022-02-21 03:14:57,964 INFO L290 TraceCheckUtils]: 40: Hoare triple {18335#false} goto; {18335#false} is VALID [2022-02-21 03:14:57,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {18335#false} goto; {18335#false} is VALID [2022-02-21 03:14:57,964 INFO L290 TraceCheckUtils]: 42: Hoare triple {18335#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; {18335#false} is VALID [2022-02-21 03:14:57,964 INFO L290 TraceCheckUtils]: 43: Hoare triple {18335#false} assume !(1 + test_int_int_#t~post3#1 <= 2147483647); {18335#false} is VALID [2022-02-21 03:14:57,964 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:14:57,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:14:57,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121869165] [2022-02-21 03:14:57,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121869165] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:14:57,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:14:57,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:14:57,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285972874] [2022-02-21 03:14:57,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:14:57,967 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:14:57,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:14:57,968 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:14:58,003 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:14:58,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:14:58,005 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:14:58,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:14:58,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:14:58,006 INFO L87 Difference]: Start difference. First operand 1181 states and 2228 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:15:06,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:15:06,872 INFO L93 Difference]: Finished difference Result 3322 states and 6406 transitions. [2022-02-21 03:15:06,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:15:06,872 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:15:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:15:06,873 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:15:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6406 transitions. [2022-02-21 03:15:07,287 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:15:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6406 transitions. [2022-02-21 03:15:07,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 6406 transitions.