./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/nla-digbench-scaling/knuth_valuebound10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d57b5e0932e2ae1d13ff96f4ee516144e471d697de2e183c71b602b9615c31f3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 02:09:14,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:09:14,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:09:14,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:09:14,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:09:14,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:09:14,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:09:14,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:09:14,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:09:14,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:09:14,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:09:14,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:09:14,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:09:14,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:09:14,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:09:14,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:09:14,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:09:14,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:09:14,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:09:14,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:09:14,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:09:14,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:09:14,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:09:14,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:09:14,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:09:14,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:09:14,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:09:14,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:09:14,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:09:14,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:09:14,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:09:14,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:09:14,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:09:14,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:09:14,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:09:14,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:09:14,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:09:14,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:09:14,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:09:14,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:09:14,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:09:14,931 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 02:09:14,945 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:09:14,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:09:14,945 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:09:14,945 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:09:14,946 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:09:14,946 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:09:14,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:09:14,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:09:14,947 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:09:14,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:09:14,947 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:09:14,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:09:14,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:09:14,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:09:14,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 02:09:14,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:09:14,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 02:09:14,949 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:09:14,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 02:09:14,949 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:09:14,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 02:09:14,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:09:14,949 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:09:14,949 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:09:14,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:09:14,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:09:14,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:09:14,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 02:09:14,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:09:14,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:09:14,950 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:09:14,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 02:09:14,965 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:09:14,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:09:14,965 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:09:14,965 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d57b5e0932e2ae1d13ff96f4ee516144e471d697de2e183c71b602b9615c31f3 [2023-02-17 02:09:15,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:09:15,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:09:15,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:09:15,215 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:09:15,216 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:09:15,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i [2023-02-17 02:09:16,465 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:09:16,609 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:09:16,614 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i [2023-02-17 02:09:16,618 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7308e1a23/a0efc1bb2ecc40708b248c16db90c852/FLAG710528769 [2023-02-17 02:09:16,628 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7308e1a23/a0efc1bb2ecc40708b248c16db90c852 [2023-02-17 02:09:16,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:09:16,632 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:09:16,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:09:16,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:09:16,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:09:16,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:09:16" (1/1) ... [2023-02-17 02:09:16,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c676d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:16, skipping insertion in model container [2023-02-17 02:09:16,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:09:16" (1/1) ... [2023-02-17 02:09:16,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:09:16,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:09:16,754 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i[948,961] [2023-02-17 02:09:16,762 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:806) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:2063) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:242) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:728) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1420) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1094) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1496) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3320) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2395) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:600) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-02-17 02:09:16,766 INFO L158 Benchmark]: Toolchain (without parser) took 133.71ms. Allocated memory is still 188.7MB. Free memory was 141.7MB in the beginning and 133.0MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 02:09:16,766 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:09:16,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 132.05ms. Allocated memory is still 188.7MB. Free memory was 141.5MB in the beginning and 133.0MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 02:09:16,767 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 188.7MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 132.05ms. Allocated memory is still 188.7MB. Free memory was 141.5MB in the beginning and 133.0MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:806) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/nla-digbench-scaling/knuth_valuebound10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d57b5e0932e2ae1d13ff96f4ee516144e471d697de2e183c71b602b9615c31f3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 02:09:18,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:09:18,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:09:18,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:09:18,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:09:18,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:09:18,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:09:18,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:09:18,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:09:18,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:09:18,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:09:18,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:09:18,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:09:18,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:09:18,584 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:09:18,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:09:18,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:09:18,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:09:18,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:09:18,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:09:18,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:09:18,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:09:18,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:09:18,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:09:18,602 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:09:18,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:09:18,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:09:18,603 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:09:18,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:09:18,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:09:18,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:09:18,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:09:18,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:09:18,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:09:18,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:09:18,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:09:18,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:09:18,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:09:18,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:09:18,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:09:18,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:09:18,615 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-17 02:09:18,643 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:09:18,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:09:18,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:09:18,644 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:09:18,645 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:09:18,645 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:09:18,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:09:18,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:09:18,646 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:09:18,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:09:18,647 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:09:18,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:09:18,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:09:18,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 02:09:18,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:09:18,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 02:09:18,648 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 02:09:18,648 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 02:09:18,648 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 02:09:18,648 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:09:18,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 02:09:18,648 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:09:18,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 02:09:18,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:09:18,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:09:18,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:09:18,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:09:18,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:09:18,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:09:18,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 02:09:18,650 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 02:09:18,650 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 02:09:18,650 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:09:18,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 02:09:18,651 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:09:18,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:09:18,651 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 02:09:18,651 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:09:18,651 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d57b5e0932e2ae1d13ff96f4ee516144e471d697de2e183c71b602b9615c31f3 [2023-02-17 02:09:18,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:09:18,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:09:18,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:09:18,902 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:09:18,903 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:09:18,904 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i [2023-02-17 02:09:19,972 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:09:20,190 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:09:20,190 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i [2023-02-17 02:09:20,195 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fd7ae26/24ec4e68a7684ca5993d5fa7dafab075/FLAG45201470f [2023-02-17 02:09:20,213 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fd7ae26/24ec4e68a7684ca5993d5fa7dafab075 [2023-02-17 02:09:20,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:09:20,216 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:09:20,217 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:09:20,217 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:09:20,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:09:20,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:09:20" (1/1) ... [2023-02-17 02:09:20,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b61b541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:20, skipping insertion in model container [2023-02-17 02:09:20,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:09:20" (1/1) ... [2023-02-17 02:09:20,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:09:20,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:09:20,376 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i[948,961] [2023-02-17 02:09:20,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:09:20,422 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:09:20,434 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i[948,961] [2023-02-17 02:09:20,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:09:20,461 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:09:20,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:20 WrapperNode [2023-02-17 02:09:20,462 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:09:20,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:09:20,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:09:20,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:09:20,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:20" (1/1) ... [2023-02-17 02:09:20,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:20" (1/1) ... [2023-02-17 02:09:20,513 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 74 [2023-02-17 02:09:20,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:09:20,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:09:20,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:09:20,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:09:20,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:20" (1/1) ... [2023-02-17 02:09:20,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:20" (1/1) ... [2023-02-17 02:09:20,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:20" (1/1) ... [2023-02-17 02:09:20,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:20" (1/1) ... [2023-02-17 02:09:20,535 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:20" (1/1) ... [2023-02-17 02:09:20,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:20" (1/1) ... [2023-02-17 02:09:20,548 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:20" (1/1) ... [2023-02-17 02:09:20,549 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:20" (1/1) ... [2023-02-17 02:09:20,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:09:20,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:09:20,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:09:20,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:09:20,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:20" (1/1) ... [2023-02-17 02:09:20,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:09:20,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:09:20,575 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) [2023-02-17 02:09:20,584 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 [2023-02-17 02:09:20,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:09:20,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 02:09:20,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-17 02:09:20,605 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-17 02:09:20,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:09:20,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:09:20,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 02:09:20,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 02:09:20,656 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:09:20,658 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:09:23,595 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:09:23,602 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:09:23,602 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 02:09:23,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:09:23 BoogieIcfgContainer [2023-02-17 02:09:23,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:09:23,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:09:23,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:09:23,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:09:23,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:09:20" (1/3) ... [2023-02-17 02:09:23,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dea41b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:09:23, skipping insertion in model container [2023-02-17 02:09:23,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:09:20" (2/3) ... [2023-02-17 02:09:23,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dea41b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:09:23, skipping insertion in model container [2023-02-17 02:09:23,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:09:23" (3/3) ... [2023-02-17 02:09:23,609 INFO L112 eAbstractionObserver]: Analyzing ICFG knuth_valuebound10.i [2023-02-17 02:09:23,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:09:23,621 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 02:09:23,663 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:09:23,668 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@148747d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:09:23,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 02:09:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 02:09:23,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 02:09:23,676 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:09:23,677 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:09:23,677 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:09:23,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:09:23,693 INFO L85 PathProgramCache]: Analyzing trace with hash 919095715, now seen corresponding path program 1 times [2023-02-17 02:09:23,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:09:23,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481616778] [2023-02-17 02:09:23,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:09:23,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:09:23,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:09:23,705 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:09:23,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-17 02:09:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:09:23,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 02:09:23,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:09:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 02:09:23,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:09:23,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:09:23,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481616778] [2023-02-17 02:09:23,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481616778] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:09:23,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:09:23,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:09:23,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691695023] [2023-02-17 02:09:23,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:09:23,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 02:09:23,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:09:23,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 02:09:23,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:09:23,989 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:09:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:09:24,004 INFO L93 Difference]: Finished difference Result 59 states and 92 transitions. [2023-02-17 02:09:24,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 02:09:24,005 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2023-02-17 02:09:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:09:24,010 INFO L225 Difference]: With dead ends: 59 [2023-02-17 02:09:24,010 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 02:09:24,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:09:24,014 INFO L413 NwaCegarLoop]: 40 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, 40 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 [2023-02-17 02:09:24,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 02:09:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 02:09:24,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-17 02:09:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-17 02:09:24,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-02-17 02:09:24,039 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 29 [2023-02-17 02:09:24,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:09:24,039 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-02-17 02:09:24,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 02:09:24,039 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-02-17 02:09:24,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 02:09:24,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:09:24,040 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:09:24,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-17 02:09:24,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:09:24,258 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:09:24,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:09:24,259 INFO L85 PathProgramCache]: Analyzing trace with hash -960358297, now seen corresponding path program 1 times [2023-02-17 02:09:24,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:09:24,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116063199] [2023-02-17 02:09:24,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:09:24,261 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:09:24,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:09:24,262 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:09:24,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-17 02:09:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:09:25,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 02:09:25,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:09:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 02:09:27,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:09:34,126 WARN L859 $PredicateComparison]: unable to prove that (= (let ((.cse1 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (bvadd (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (bvadd (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse0))) (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse1))) (let ((.cse2 (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse0))))) (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul .cse2 (_ bv2 32)))) (bvmul .cse2 (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1|))))))) (bvmul (_ bv8 32) .cse1))) (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|)) is different from true [2023-02-17 02:09:36,733 WARN L859 $PredicateComparison]: unable to prove that (or (= (let ((.cse1 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (bvadd (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (bvadd (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse0))) (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse1))) (let ((.cse2 (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse0))))) (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul .cse2 (_ bv2 32)))) (bvmul .cse2 (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1|))))))) (bvmul (_ bv8 32) .cse1))) (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|)) (not (bvugt |c_ULTIMATE.start_main_~a~0#1| (_ bv2 32)))) is different from true [2023-02-17 02:09:40,857 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ BitVec 32))) (or (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv2 32)) (= (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5|) (let ((.cse1 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|))) (bvadd (let ((.cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv4294967294 32)))) (bvadd (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse0) (_ bv4 32))) (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvmul (_ bv4 32) .cse1))) (let ((.cse2 (bvmul (bvadd (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse0) (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|))) (_ bv4 32)))) (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvmul .cse2 (_ bv2 32)))) (bvmul .cse2 (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|))))))) (bvmul (_ bv8 32) .cse1)))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-02-17 02:09:46,977 WARN L859 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ BitVec 32))) (or (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv2 32)) (= (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5|) (let ((.cse1 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|))) (bvadd (let ((.cse0 (bvadd |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ bv4294967294 32)))) (bvadd (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvmul (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse0) (_ bv4 32))) (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvmul (_ bv4 32) .cse1))) (let ((.cse2 (bvmul (bvadd (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| .cse0) (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|))) (_ bv4 32)))) (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (bvmul .cse2 (_ bv2 32)))) (bvmul .cse2 (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|))))))) (bvmul (_ bv8 32) .cse1)))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-02-17 02:09:49,235 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1| (_ BitVec 32))) (or (not (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv0 32))) (= (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|) (let ((.cse1 (bvurem |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (bvadd (let ((.cse0 (bvadd |ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (bvadd (bvmul (bvmul (_ bv4 32) (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse0)) |ULTIMATE.start_main_~a~0#1|) (bvadd (bvneg (bvmul |ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse1))) (let ((.cse2 (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse0))))) (bvadd (bvmul .cse2 (bvmul |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|)) (bvneg (bvmul |ULTIMATE.start_main_~a~0#1| (bvmul .cse2 (_ bv2 32))))))))) (bvmul (_ bv8 32) .cse1)))) (not (bvule |ULTIMATE.start_main_~a~0#1| (_ bv10 32))) (not (bvugt |ULTIMATE.start_main_~a~0#1| (_ bv2 32))))) is different from true [2023-02-17 02:09:49,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:09:49,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116063199] [2023-02-17 02:09:49,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116063199] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:09:49,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1664544548] [2023-02-17 02:09:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:09:49,237 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:09:49,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:09:49,239 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 02:09:49,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-02-17 02:09:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:09:57,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 02:09:57,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:09:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 02:09:59,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:10:05,257 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ BitVec 32))) (or (= (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11|) (let ((.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|))) (bvadd (bvmul (_ bv8 32) .cse0) (let ((.cse2 (bvadd |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ bv4294967294 32)))) (bvadd (bvadd (let ((.cse1 (bvmul (_ bv4 32) (bvadd (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| .cse2) (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|)))))) (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvmul (_ bv2 32) .cse1))) (bvmul (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) .cse1))) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvmul (_ bv4 32) .cse0)))) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvmul (_ bv4 32) (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| .cse2)))))))) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ bv2 32)))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-02-17 02:10:11,425 WARN L859 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ BitVec 32))) (or (= (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11|) (let ((.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|))) (bvadd (bvmul (_ bv8 32) .cse0) (let ((.cse2 (bvadd |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ bv4294967294 32)))) (bvadd (bvadd (let ((.cse1 (bvmul (_ bv4 32) (bvadd (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| .cse2) (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|)))))) (bvadd (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvmul (_ bv2 32) .cse1))) (bvmul (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) .cse1))) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvmul (_ bv4 32) .cse0)))) (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (bvmul (_ bv4 32) (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_11| .cse2)))))))) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ bv2 32)))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-02-17 02:10:11,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1664544548] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:10:11,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:10:11,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-02-17 02:10:11,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954841723] [2023-02-17 02:10:11,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:10:11,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 02:10:11,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:10:11,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 02:10:11,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=133, Unknown=7, NotChecked=196, Total=380 [2023-02-17 02:10:11,461 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:10:16,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 02:10:17,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 02:10:27,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:10:27,652 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2023-02-17 02:10:27,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 02:10:27,672 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2023-02-17 02:10:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:10:27,673 INFO L225 Difference]: With dead ends: 44 [2023-02-17 02:10:27,673 INFO L226 Difference]: Without dead ends: 42 [2023-02-17 02:10:27,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=54, Invalid=177, Unknown=7, NotChecked=224, Total=462 [2023-02-17 02:10:27,674 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:10:27,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 99 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 15.5s Time] [2023-02-17 02:10:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-17 02:10:27,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2023-02-17 02:10:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-17 02:10:27,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2023-02-17 02:10:27,681 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 29 [2023-02-17 02:10:27,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:10:27,681 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2023-02-17 02:10:27,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 02:10:27,681 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2023-02-17 02:10:27,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 02:10:27,682 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:10:27,682 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:10:27,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2023-02-17 02:10:27,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-17 02:10:28,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:10:28,099 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:10:28,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:10:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash -603494572, now seen corresponding path program 1 times [2023-02-17 02:10:28,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:10:28,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874597606] [2023-02-17 02:10:28,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:10:28,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:10:28,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:10:28,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:10:28,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-17 02:10:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:10:28,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 02:10:28,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:10:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-17 02:10:28,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:10:28,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:10:28,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874597606] [2023-02-17 02:10:28,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874597606] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:10:28,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:10:28,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:10:28,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208873184] [2023-02-17 02:10:28,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:10:28,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:10:28,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:10:28,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:10:28,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:10:28,566 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-17 02:10:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:10:29,632 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2023-02-17 02:10:29,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:10:29,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2023-02-17 02:10:29,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:10:29,641 INFO L225 Difference]: With dead ends: 46 [2023-02-17 02:10:29,641 INFO L226 Difference]: Without dead ends: 44 [2023-02-17 02:10:29,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 02:10:29,641 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 02:10:29,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 135 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-17 02:10:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-17 02:10:29,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2023-02-17 02:10:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-17 02:10:29,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2023-02-17 02:10:29,650 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 34 [2023-02-17 02:10:29,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:10:29,650 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2023-02-17 02:10:29,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-17 02:10:29,651 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2023-02-17 02:10:29,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 02:10:29,651 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:10:29,652 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:10:29,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-02-17 02:10:29,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:10:29,852 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:10:29,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:10:29,853 INFO L85 PathProgramCache]: Analyzing trace with hash -127108025, now seen corresponding path program 1 times [2023-02-17 02:10:29,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:10:29,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509473347] [2023-02-17 02:10:29,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:10:29,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:10:29,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:10:29,854 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:10:29,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-17 02:10:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:10:31,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 02:10:31,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:10:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 02:10:41,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:11:01,280 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse2 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse5 (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse8))))) (let ((.cse6 (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse8)) (.cse4 (bvmul .cse5 (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (.cse7 (bvmul (_ bv8 32) .cse2)) (.cse0 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|))) (or (= (bvadd (bvadd (bvneg .cse0) (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~a~0#1|))) (let ((.cse1 (bvmul (_ bv0 32) .cse3))) (bvadd (bvneg .cse1) (bvadd (bvadd .cse1 (bvadd (bvneg (bvmul .cse2 .cse3)) (bvadd .cse4 (bvneg (bvmul .cse5 (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~a~0#1|)))))) (bvmul .cse6 .cse3)))))) .cse7) (_ bv0 32)) (not (= (bvadd (bvadd (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse6)) (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse2))) (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul .cse5 (_ bv2 32)))) .cse4))) .cse7) .cse0)))))) is different from true [2023-02-17 02:11:03,792 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse2 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (.cse5 (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse8))))) (let ((.cse6 (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse8)) (.cse4 (bvmul .cse5 (bvmul |c_ULTIMATE.start_main_~a~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (.cse7 (bvmul (_ bv8 32) .cse2)) (.cse0 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|))) (or (= (bvadd (bvadd (bvneg .cse0) (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~a~0#1|))) (let ((.cse1 (bvmul (_ bv0 32) .cse3))) (bvadd (bvneg .cse1) (bvadd (bvadd .cse1 (bvadd (bvneg (bvmul .cse2 .cse3)) (bvadd .cse4 (bvneg (bvmul .cse5 (bvmul (_ bv2 32) |c_ULTIMATE.start_main_~a~0#1|)))))) (bvmul .cse6 .cse3)))))) .cse7) (_ bv0 32)) (not (= (bvadd (bvadd (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse6)) (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse2))) (bvadd (bvneg (bvmul |c_ULTIMATE.start_main_~a~0#1| (bvmul .cse5 (_ bv2 32)))) .cse4))) .cse7) .cse0)) (not (bvugt |c_ULTIMATE.start_main_~a~0#1| (_ bv2 32))))))) is different from true [2023-02-17 02:11:09,972 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (let ((.cse2 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)) (.cse4 (bvmul (_ bv4 32) (bvadd (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| .cse8) (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)))))) (let ((.cse3 (bvmul (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|) .cse4)) (.cse1 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| .cse8)) (.cse5 (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21|)) (.cse0 (bvmul (_ bv8 32) .cse2))) (or (not (= (bvadd .cse0 (bvadd (bvmul (bvmul (_ bv4 32) .cse1) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|) (bvadd (bvneg (bvmul (bvmul (_ bv4 32) .cse2) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)) (bvadd .cse3 (bvneg (bvmul (bvmul (_ bv2 32) .cse4) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)))))) .cse5)) (= (bvadd (bvadd (let ((.cse7 (bvmul (_ bv4 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (let ((.cse6 (bvmul .cse7 (_ bv0 32)))) (bvadd (bvadd (bvadd .cse6 (bvadd (bvneg (bvmul .cse7 .cse2)) (bvadd (bvneg (bvmul .cse4 (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) .cse3))) (bvmul .cse7 .cse1)) (bvneg .cse6)))) (bvneg .cse5)) .cse0) (_ bv0 32)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| (_ bv2 32))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-02-17 02:11:16,107 WARN L859 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (let ((.cse2 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)) (.cse4 (bvmul (_ bv4 32) (bvadd (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| .cse8) (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)))))) (let ((.cse3 (bvmul (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|) .cse4)) (.cse1 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21| .cse8)) (.cse5 (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_21|)) (.cse0 (bvmul (_ bv8 32) .cse2))) (or (not (= (bvadd .cse0 (bvadd (bvmul (bvmul (_ bv4 32) .cse1) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|) (bvadd (bvneg (bvmul (bvmul (_ bv4 32) .cse2) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)) (bvadd .cse3 (bvneg (bvmul (bvmul (_ bv2 32) .cse4) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|)))))) .cse5)) (= (bvadd (bvadd (let ((.cse7 (bvmul (_ bv4 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) (let ((.cse6 (bvmul .cse7 (_ bv0 32)))) (bvadd (bvadd (bvadd .cse6 (bvadd (bvneg (bvmul .cse7 .cse2)) (bvadd (bvneg (bvmul .cse4 (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16|))) .cse3))) (bvmul .cse7 .cse1)) (bvneg .cse6)))) (bvneg .cse5)) .cse0) (_ bv0 32)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_16| (_ bv2 32))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-02-17 02:11:18,175 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1| (_ BitVec 32))) (let ((.cse8 (bvadd |ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (let ((.cse4 (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse8)))) (.cse2 (bvurem |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (let ((.cse5 (bvmul (_ bv8 32) .cse2)) (.cse0 (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~n~0#1|)) (.cse3 (bvmul .cse4 (bvmul |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|))) (.cse1 (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse8))) (or (not (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv0 32))) (not (= .cse0 (bvadd (bvadd (bvmul (bvmul (_ bv4 32) .cse1) |ULTIMATE.start_main_~a~0#1|) (bvadd (bvneg (bvmul |ULTIMATE.start_main_~a~0#1| (bvmul (_ bv4 32) .cse2))) (bvadd .cse3 (bvneg (bvmul |ULTIMATE.start_main_~a~0#1| (bvmul .cse4 (_ bv2 32))))))) .cse5))) (not (bvule |ULTIMATE.start_main_~a~0#1| (_ bv10 32))) (not (bvugt |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (= (bvadd .cse5 (bvadd (bvneg .cse0) (let ((.cse7 (bvmul (_ bv4 32) |ULTIMATE.start_main_~a~0#1|))) (let ((.cse6 (bvmul .cse7 (_ bv0 32)))) (bvadd (bvneg .cse6) (bvadd (bvadd (bvadd (bvadd .cse3 (bvneg (bvmul .cse4 (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv2 32))))) (bvneg (bvmul .cse7 .cse2))) .cse6) (bvmul .cse7 .cse1))))))) (_ bv0 32))))))) is different from true [2023-02-17 02:11:18,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:11:18,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509473347] [2023-02-17 02:11:18,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509473347] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:11:18,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1375682890] [2023-02-17 02:11:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:11:18,176 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:11:18,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:11:18,178 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 02:11:18,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-02-17 02:11:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:11:24,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 02:11:24,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:11:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-17 02:11:31,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:11:38,351 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (let ((.cse3 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|)) (.cse2 (bvmul (_ bv4 32) (bvadd (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| .cse8) (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|)))))) (let ((.cse1 (bvmul (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|) .cse2)) (.cse4 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| .cse8)) (.cse0 (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31|)) (.cse5 (bvmul (_ bv8 32) .cse3))) (or (not (= .cse0 (bvadd (bvadd (bvadd (bvadd .cse1 (bvneg (bvmul (bvmul (_ bv2 32) .cse2) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (bvmul (_ bv4 32) .cse3)))) (bvmul (bvmul (_ bv4 32) .cse4) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|)) .cse5))) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (_ bv2 32)) (= (_ bv0 32) (bvadd (bvadd (let ((.cse7 (bvmul (_ bv4 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (let ((.cse6 (bvmul .cse7 (_ bv0 32)))) (bvadd (bvneg .cse6) (bvadd (bvadd .cse6 (bvadd (bvneg (bvmul .cse7 .cse3)) (bvadd .cse1 (bvneg (bvmul .cse2 (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|)))))) (bvmul .cse7 .cse4))))) (bvneg .cse0)) .cse5))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-02-17 02:11:44,490 WARN L859 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (_ BitVec 32))) (let ((.cse8 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (let ((.cse3 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|)) (.cse2 (bvmul (_ bv4 32) (bvadd (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| .cse8) (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|)))))) (let ((.cse1 (bvmul (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|) .cse2)) (.cse4 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31| .cse8)) (.cse0 (bvmul (_ bv8 32) |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_31|)) (.cse5 (bvmul (_ bv8 32) .cse3))) (or (not (= .cse0 (bvadd (bvadd (bvadd (bvadd .cse1 (bvneg (bvmul (bvmul (_ bv2 32) .cse2) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (bvneg (bvmul |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (bvmul (_ bv4 32) .cse3)))) (bvmul (bvmul (_ bv4 32) .cse4) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|)) .cse5))) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25| (_ bv2 32)) (= (_ bv0 32) (bvadd (bvadd (let ((.cse7 (bvmul (_ bv4 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|))) (let ((.cse6 (bvmul .cse7 (_ bv0 32)))) (bvadd (bvneg .cse6) (bvadd (bvadd .cse6 (bvadd (bvneg (bvmul .cse7 .cse3)) (bvadd .cse1 (bvneg (bvmul .cse2 (bvmul (_ bv2 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_25|)))))) (bvmul .cse7 .cse4))))) (bvneg .cse0)) .cse5))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-02-17 02:11:44,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1375682890] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:11:44,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:11:44,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2023-02-17 02:11:44,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355827746] [2023-02-17 02:11:44,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:11:44,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 02:11:44,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:11:44,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 02:11:44,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=204, Unknown=7, NotChecked=238, Total=506 [2023-02-17 02:11:44,514 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 02:11:50,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 02:11:51,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 02:11:53,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 02:11:59,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 02:12:07,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:12:07,281 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2023-02-17 02:12:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 02:12:07,309 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 39 [2023-02-17 02:12:07,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:12:07,310 INFO L225 Difference]: With dead ends: 52 [2023-02-17 02:12:07,310 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 02:12:07,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 49.5s TimeCoverageRelationStatistics Valid=76, Invalid=287, Unknown=7, NotChecked=280, Total=650 [2023-02-17 02:12:07,311 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2023-02-17 02:12:07,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 68 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 220 Invalid, 1 Unknown, 0 Unchecked, 19.5s Time] [2023-02-17 02:12:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 02:12:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2023-02-17 02:12:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-17 02:12:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2023-02-17 02:12:07,335 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 39 [2023-02-17 02:12:07,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:12:07,336 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2023-02-17 02:12:07,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-17 02:12:07,337 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2023-02-17 02:12:07,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-17 02:12:07,338 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:12:07,339 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:12:07,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-02-17 02:12:07,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-02-17 02:12:07,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:12:07,753 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:12:07,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:12:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash -114260771, now seen corresponding path program 1 times [2023-02-17 02:12:07,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:12:07,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931137545] [2023-02-17 02:12:07,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:12:07,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:12:07,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:12:07,759 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:12:07,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-17 02:12:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:12:08,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 02:12:08,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:12:11,500 WARN L837 $PredicateComparison]: unable to prove that (and (bvuge |c_ULTIMATE.start_main_~d~0#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~n~0#1| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4294967294 32) |c_ULTIMATE.start_main_~d~0#1|))) (and (= (bvurem |ULTIMATE.start_main_~n~0#1| .cse0) |c_ULTIMATE.start_main_~k~0#1|) (bvuge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~q~0#1| (bvmul (bvadd (bvneg (bvudiv |ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~d~0#1|)) (bvudiv |ULTIMATE.start_main_~n~0#1| .cse0)) (_ bv4 32))) (= (bvurem |ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~d~0#1|) |c_ULTIMATE.start_main_~r~0#1|) (= |c_ULTIMATE.start_main_~s~0#1| ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~n~0#1|)))) (bvule |ULTIMATE.start_main_~n~0#1| (_ bv10 32))))) (bvule |c_ULTIMATE.start_main_~d~0#1| (_ bv10 32)) (bvugt |c_ULTIMATE.start_main_~d~0#1| (_ bv2 32))) is different from false [2023-02-17 02:12:14,259 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) |c_ULTIMATE.start_main_~r~0#1|)) (exists ((|ULTIMATE.start_main_~n~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~d~0#1| (_ BitVec 32))) (let ((.cse0 (bvadd |ULTIMATE.start_main_~d~0#1| (_ bv4294967294 32)))) (and (= |c_ULTIMATE.start_main_~r~0#1| (bvurem |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~d~0#1|)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~n~0#1|))) |ULTIMATE.start_main_~d~0#1|) (bvuge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (= (bvurem |ULTIMATE.start_main_~n~0#1| .cse0) |c_ULTIMATE.start_main_~k~0#1|) (bvule |ULTIMATE.start_main_~d~0#1| (_ bv10 32)) (bvule |ULTIMATE.start_main_~n~0#1| (_ bv10 32)) (bvugt |ULTIMATE.start_main_~d~0#1| (_ bv2 32)) (= |c_ULTIMATE.start_main_~q~0#1| (bvmul (_ bv4 32) (bvadd (bvudiv |ULTIMATE.start_main_~n~0#1| .cse0) (bvneg (bvudiv |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~d~0#1|))))) (bvuge |ULTIMATE.start_main_~d~0#1| (_ bv0 32)))))) is different from false [2023-02-17 02:12:19,426 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~n~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~d~0#1| (_ BitVec 32))) (let ((.cse0 (bvurem |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~d~0#1|))) (and (not (= (_ bv0 32) .cse0)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~n~0#1|))) |ULTIMATE.start_main_~d~0#1|) (bvuge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (let ((.cse1 (bvadd |ULTIMATE.start_main_~d~0#1| (_ bv4294967294 32)))) (bvult (bvadd (bvmul (_ bv4 32) (bvadd (bvudiv |ULTIMATE.start_main_~n~0#1| .cse1) (bvneg (bvudiv |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~d~0#1|)))) (bvmul (_ bv2 32) .cse0)) (bvurem |ULTIMATE.start_main_~n~0#1| .cse1))) (bvule |ULTIMATE.start_main_~d~0#1| (_ bv10 32)) (bvule |ULTIMATE.start_main_~n~0#1| (_ bv10 32)) (bvugt |ULTIMATE.start_main_~d~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~d~0#1| (_ bv0 32))))) is different from false [2023-02-17 02:12:21,759 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~n~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~d~0#1| (_ BitVec 32))) (let ((.cse0 (bvurem |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~d~0#1|))) (and (not (= (_ bv0 32) .cse0)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~n~0#1|))) |ULTIMATE.start_main_~d~0#1|) (bvuge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (let ((.cse1 (bvadd |ULTIMATE.start_main_~d~0#1| (_ bv4294967294 32)))) (bvult (bvadd (bvmul (_ bv4 32) (bvadd (bvudiv |ULTIMATE.start_main_~n~0#1| .cse1) (bvneg (bvudiv |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~d~0#1|)))) (bvmul (_ bv2 32) .cse0)) (bvurem |ULTIMATE.start_main_~n~0#1| .cse1))) (bvule |ULTIMATE.start_main_~d~0#1| (_ bv10 32)) (bvule |ULTIMATE.start_main_~n~0#1| (_ bv10 32)) (bvugt |ULTIMATE.start_main_~d~0#1| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~d~0#1| (_ bv0 32))))) is different from true [2023-02-17 02:12:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 2 not checked. [2023-02-17 02:12:31,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:12:34,778 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (or (not (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (bvult (bvadd (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse0))) (bvmul (_ bv2 32) .cse1)) (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse0)))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~n~0#1|))) |c_ULTIMATE.start_main_~a~0#1|)))) is different from false [2023-02-17 02:12:37,305 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (or (not (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (bvult (bvadd (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse0))) (bvmul (_ bv2 32) .cse1)) (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse0)))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~n~0#1|))) |c_ULTIMATE.start_main_~a~0#1|)))) is different from true [2023-02-17 02:12:39,862 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (or (not (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (bvult (bvadd (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse0))) (bvmul (_ bv2 32) .cse1)) (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse0)))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~n~0#1|))) |c_ULTIMATE.start_main_~a~0#1|)) (not (bvugt |c_ULTIMATE.start_main_~a~0#1| (_ bv2 32))))) is different from false [2023-02-17 02:12:42,396 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (or (not (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (bvult (bvadd (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse0))) (bvmul (_ bv2 32) .cse1)) (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse0)))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~n~0#1|))) |c_ULTIMATE.start_main_~a~0#1|)) (not (bvugt |c_ULTIMATE.start_main_~a~0#1| (_ bv2 32))))) is different from true [2023-02-17 02:12:44,986 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_29| (_ BitVec 32))) (let ((.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_29|))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36|))) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_29|)) (= .cse0 (_ bv0 32)) (not (let ((.cse1 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_29|))) (bvult (bvadd (bvmul (_ bv2 32) .cse0) (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_29|)) (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| .cse1)))) (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| .cse1)))) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_29| (_ bv2 32))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-02-17 02:12:47,540 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_29| (_ BitVec 32))) (let ((.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_29|))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36|))) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_29|)) (= .cse0 (_ bv0 32)) (not (let ((.cse1 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_29|))) (bvult (bvadd (bvmul (_ bv2 32) .cse0) (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_29|)) (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| .cse1)))) (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| .cse1)))) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_29| (_ bv2 32))))) (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-02-17 02:12:50,094 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1| (_ BitVec 32))) (let ((.cse0 (bvurem |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (or (not (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv0 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~n~0#1|))) |ULTIMATE.start_main_~a~0#1|)) (not (bvule |ULTIMATE.start_main_~a~0#1| (_ bv10 32))) (not (bvugt |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (= .cse0 (_ bv0 32)) (not (let ((.cse1 (bvadd |ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (bvult (bvadd (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse1))) (bvmul (_ bv2 32) .cse0)) (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse1))))))) is different from false [2023-02-17 02:12:52,658 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1| (_ BitVec 32))) (let ((.cse0 (bvurem |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|))) (or (not (bvuge |ULTIMATE.start_main_~a~0#1| (_ bv0 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~n~0#1|))) |ULTIMATE.start_main_~a~0#1|)) (not (bvule |ULTIMATE.start_main_~a~0#1| (_ bv10 32))) (not (bvugt |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (= .cse0 (_ bv0 32)) (not (let ((.cse1 (bvadd |ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (bvult (bvadd (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse1))) (bvmul (_ bv2 32) .cse0)) (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse1))))))) is different from true [2023-02-17 02:12:52,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:12:52,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931137545] [2023-02-17 02:12:52,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931137545] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:12:52,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [65651195] [2023-02-17 02:12:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:12:52,659 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:12:52,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:12:52,660 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 02:12:52,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2023-02-17 02:12:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:12:58,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-17 02:12:58,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:13:11,347 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 2 not checked. [2023-02-17 02:13:11,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:13:13,952 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_41| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_33| (_ BitVec 32))) (let ((.cse1 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_33|))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_41|))) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_33|)) (not (let ((.cse0 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_33|))) (bvult (bvadd (bvmul (bvadd (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_33|)) (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_41| .cse0)) (_ bv4 32)) (bvmul (_ bv2 32) .cse1)) (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_41| .cse0)))) (= .cse1 (_ bv0 32)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_33| (_ bv2 32))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-02-17 02:13:16,535 WARN L859 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_assume_abort_if_not_~cond) (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_41| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_33| (_ BitVec 32))) (let ((.cse1 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_33|))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_41|))) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_33|)) (not (let ((.cse0 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_33|))) (bvult (bvadd (bvmul (bvadd (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_41| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_33|)) (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_41| .cse0)) (_ bv4 32)) (bvmul (_ bv2 32) .cse1)) (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_41| .cse0)))) (= .cse1 (_ bv0 32)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_33| (_ bv2 32))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-02-17 02:13:16,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [65651195] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:13:16,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:13:16,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-02-17 02:13:16,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631634634] [2023-02-17 02:13:16,559 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:13:16,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 02:13:16,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:13:16,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 02:13:16,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=70, Unknown=14, NotChecked=250, Total=380 [2023-02-17 02:13:16,562 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-17 02:13:20,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 02:13:20,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:13:20,958 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2023-02-17 02:13:21,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 02:13:21,483 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 52 [2023-02-17 02:13:21,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:13:21,485 INFO L225 Difference]: With dead ends: 54 [2023-02-17 02:13:21,485 INFO L226 Difference]: Without dead ends: 52 [2023-02-17 02:13:21,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 150 SyntacticMatches, 14 SemanticMatches, 19 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=51, Invalid=85, Unknown=14, NotChecked=270, Total=420 [2023-02-17 02:13:21,486 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:13:21,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 61 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 1 Unknown, 77 Unchecked, 4.2s Time] [2023-02-17 02:13:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-17 02:13:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2023-02-17 02:13:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 13 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-02-17 02:13:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2023-02-17 02:13:21,493 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 52 [2023-02-17 02:13:21,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:13:21,494 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2023-02-17 02:13:21,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-17 02:13:21,494 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2023-02-17 02:13:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-17 02:13:21,494 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:13:21,495 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 02:13:21,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2023-02-17 02:13:21,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-02-17 02:13:21,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:13:21,912 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:13:21,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:13:21,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1335229085, now seen corresponding path program 1 times [2023-02-17 02:13:21,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:13:21,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281531429] [2023-02-17 02:13:21,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:13:21,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 02:13:21,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:13:21,915 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 02:13:21,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-17 02:13:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:13:22,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 02:13:22,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:13:25,716 WARN L837 $PredicateComparison]: unable to prove that (and (bvuge |c_ULTIMATE.start_main_~d~0#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~n~0#1| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4294967294 32) |c_ULTIMATE.start_main_~d~0#1|))) (and (= (bvurem |ULTIMATE.start_main_~n~0#1| .cse0) |c_ULTIMATE.start_main_~k~0#1|) (bvuge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~q~0#1| (bvmul (bvadd (bvneg (bvudiv |ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~d~0#1|)) (bvudiv |ULTIMATE.start_main_~n~0#1| .cse0)) (_ bv4 32))) (= (bvurem |ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~d~0#1|) |c_ULTIMATE.start_main_~r~0#1|) (= |c_ULTIMATE.start_main_~s~0#1| ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~n~0#1|)))) (bvule |ULTIMATE.start_main_~n~0#1| (_ bv10 32))))) (bvule |c_ULTIMATE.start_main_~d~0#1| (_ bv10 32)) (bvugt |c_ULTIMATE.start_main_~d~0#1| (_ bv2 32))) is different from false [2023-02-17 02:13:28,409 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~n~0#1| (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4294967294 32) |c_ULTIMATE.start_main_~d~0#1|))) (and (= (bvurem |ULTIMATE.start_main_~n~0#1| .cse0) |c_ULTIMATE.start_main_~k~0#1|) (bvuge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~n~0#1|))) |c_ULTIMATE.start_main_~d~0#1|) (= |c_ULTIMATE.start_main_~q~0#1| (bvmul (bvadd (bvneg (bvudiv |ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~d~0#1|)) (bvudiv |ULTIMATE.start_main_~n~0#1| .cse0)) (_ bv4 32))) (= (bvurem |ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~d~0#1|) |c_ULTIMATE.start_main_~r~0#1|) (bvule |ULTIMATE.start_main_~n~0#1| (_ bv10 32))))) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~r~0#1|)) (bvuge |c_ULTIMATE.start_main_~d~0#1| (_ bv0 32)) (bvule |c_ULTIMATE.start_main_~d~0#1| (_ bv10 32)) (bvugt |c_ULTIMATE.start_main_~d~0#1| (_ bv2 32))) is different from false [2023-02-17 02:13:33,578 WARN L837 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~d~0#1_33| (_ BitVec 32)) (|ULTIMATE.start_main_~n~0#1| (_ BitVec 32))) (let ((.cse1 (bvurem |ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~d~0#1_33|))) (and (bvugt |v_ULTIMATE.start_main_~d~0#1_33| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (let ((.cse0 (bvadd |v_ULTIMATE.start_main_~d~0#1_33| (_ bv4294967294 32)))) (bvult (bvadd (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~d~0#1_33|)) (bvudiv |ULTIMATE.start_main_~n~0#1| .cse0))) (bvmul .cse1 (_ bv2 32))) (bvadd (bvadd |v_ULTIMATE.start_main_~d~0#1_33| (bvurem |ULTIMATE.start_main_~n~0#1| .cse0)) (_ bv2 32)))) (not (= .cse1 (_ bv0 32))) (bvuge |v_ULTIMATE.start_main_~d~0#1_33| (_ bv0 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~n~0#1|))) |v_ULTIMATE.start_main_~d~0#1_33|) (bvule |v_ULTIMATE.start_main_~d~0#1_33| (_ bv10 32)) (bvule |ULTIMATE.start_main_~n~0#1| (_ bv10 32))))) is different from false [2023-02-17 02:13:36,183 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~d~0#1_33| (_ BitVec 32)) (|ULTIMATE.start_main_~n~0#1| (_ BitVec 32))) (let ((.cse1 (bvurem |ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~d~0#1_33|))) (and (bvugt |v_ULTIMATE.start_main_~d~0#1_33| (_ bv2 32)) (bvuge |ULTIMATE.start_main_~n~0#1| (_ bv0 32)) (let ((.cse0 (bvadd |v_ULTIMATE.start_main_~d~0#1_33| (_ bv4294967294 32)))) (bvult (bvadd (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |ULTIMATE.start_main_~n~0#1| |v_ULTIMATE.start_main_~d~0#1_33|)) (bvudiv |ULTIMATE.start_main_~n~0#1| .cse0))) (bvmul .cse1 (_ bv2 32))) (bvadd (bvadd |v_ULTIMATE.start_main_~d~0#1_33| (bvurem |ULTIMATE.start_main_~n~0#1| .cse0)) (_ bv2 32)))) (not (= .cse1 (_ bv0 32))) (bvuge |v_ULTIMATE.start_main_~d~0#1_33| (_ bv0 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~n~0#1|))) |v_ULTIMATE.start_main_~d~0#1_33|) (bvule |v_ULTIMATE.start_main_~d~0#1_33| (_ bv10 32)) (bvule |ULTIMATE.start_main_~n~0#1| (_ bv10 32))))) is different from true [2023-02-17 02:13:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 2 not checked. [2023-02-17 02:13:46,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:13:49,701 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (or (not (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (bvult (bvadd (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse0))) (bvmul (_ bv2 32) .cse1)) (bvadd (_ bv2 32) (bvadd |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse0)))))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~n~0#1|))) |c_ULTIMATE.start_main_~a~0#1|)))) is different from false [2023-02-17 02:13:52,307 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (or (not (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (bvult (bvadd (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse0))) (bvmul (_ bv2 32) .cse1)) (bvadd (_ bv2 32) (bvadd |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse0)))))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~n~0#1|))) |c_ULTIMATE.start_main_~a~0#1|)))) is different from true [2023-02-17 02:13:54,898 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (or (not (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (bvult (bvadd (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse0))) (bvmul (_ bv2 32) .cse1)) (bvadd (_ bv2 32) (bvadd |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse0)))))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~n~0#1|))) |c_ULTIMATE.start_main_~a~0#1|)) (not (bvugt |c_ULTIMATE.start_main_~a~0#1| (_ bv2 32))))) is different from false [2023-02-17 02:13:57,388 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|))) (or (not (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1| (_ bv4294967294 32)))) (bvult (bvadd (bvmul (_ bv4 32) (bvadd (bvneg (bvudiv |c_ULTIMATE.start_main_~n~0#1| |c_ULTIMATE.start_main_~a~0#1|)) (bvudiv |c_ULTIMATE.start_main_~n~0#1| .cse0))) (bvmul (_ bv2 32) .cse1)) (bvadd (_ bv2 32) (bvadd |c_ULTIMATE.start_main_~a~0#1| (bvurem |c_ULTIMATE.start_main_~n~0#1| .cse0)))))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~n~0#1|))) |c_ULTIMATE.start_main_~a~0#1|)) (not (bvugt |c_ULTIMATE.start_main_~a~0#1| (_ bv2 32))))) is different from true [2023-02-17 02:13:59,926 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_46| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_37| (_ BitVec 32))) (let ((.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_46| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_37|))) (or (not (let ((.cse1 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_37|))) (bvult (bvadd (bvmul (_ bv2 32) .cse0) (bvmul (bvadd (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_46| .cse1) (bvneg (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_46| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_37|))) (_ bv4 32))) (bvadd (bvadd (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_46| .cse1) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_37|) (_ bv2 32))))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_46|))) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_37|)) (= .cse0 (_ bv0 32)) (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_37| (_ bv2 32))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true