./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound5.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_valuebound5.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 dba22d6df3d4e3652cbc5549e3bb451cd645bea6f6419ad67cf157d39a1c2871 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 02:10:15,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:10:15,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:10:15,090 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:10:15,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:10:15,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:10:15,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:10:15,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:10:15,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:10:15,103 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:10:15,104 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:10:15,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:10:15,106 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:10:15,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:10:15,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:10:15,110 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:10:15,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:10:15,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:10:15,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:10:15,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:10:15,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:10:15,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:10:15,119 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:10:15,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:10:15,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:10:15,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:10:15,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:10:15,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:10:15,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:10:15,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:10:15,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:10:15,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:10:15,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:10:15,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:10:15,132 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:10:15,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:10:15,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:10:15,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:10:15,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:10:15,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:10:15,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:10:15,137 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:10:15,159 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:10:15,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:10:15,160 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:10:15,160 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:10:15,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:10:15,161 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:10:15,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:10:15,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:10:15,162 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:10:15,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:10:15,162 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:10:15,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 02:10:15,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:10:15,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:10:15,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 02:10:15,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:10:15,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 02:10:15,163 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:10:15,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 02:10:15,164 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:10:15,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 02:10:15,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:10:15,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:10:15,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:10:15,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:10:15,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:10:15,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:10:15,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 02:10:15,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 02:10:15,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 02:10:15,166 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:10:15,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 02:10:15,166 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:10:15,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:10:15,167 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:10:15,167 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 -> dba22d6df3d4e3652cbc5549e3bb451cd645bea6f6419ad67cf157d39a1c2871 [2023-02-17 02:10:15,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:10:15,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:10:15,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:10:15,386 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:10:15,393 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:10:15,394 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound5.i [2023-02-17 02:10:16,346 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:10:16,464 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:10:16,465 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound5.i [2023-02-17 02:10:16,470 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887bd2a3b/43ae7c8ca7aa407db5613c4f924ddbba/FLAG08e797bf5 [2023-02-17 02:10:16,482 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/887bd2a3b/43ae7c8ca7aa407db5613c4f924ddbba [2023-02-17 02:10:16,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:10:16,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:10:16,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:10:16,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:10:16,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:10:16,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:10:16" (1/1) ... [2023-02-17 02:10:16,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32d0d684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:10:16, skipping insertion in model container [2023-02-17 02:10:16,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:10:16" (1/1) ... [2023-02-17 02:10:16,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:10:16,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:10:16,614 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_valuebound5.i[948,961] [2023-02-17 02:10:16,636 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:10:16,644 INFO L158 Benchmark]: Toolchain (without parser) took 158.29ms. Allocated memory is still 123.7MB. Free memory was 82.8MB in the beginning and 73.5MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 02:10:16,645 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 123.7MB. Free memory was 89.3MB in the beginning and 89.3MB in the end (delta: 24.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 02:10:16,646 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.94ms. Allocated memory is still 123.7MB. Free memory was 82.8MB in the beginning and 73.5MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 02:10:16,647 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.16ms. Allocated memory is still 123.7MB. Free memory was 89.3MB in the beginning and 89.3MB in the end (delta: 24.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.94ms. Allocated memory is still 123.7MB. Free memory was 82.8MB in the beginning and 73.5MB in the end (delta: 9.3MB). 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_valuebound5.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 dba22d6df3d4e3652cbc5549e3bb451cd645bea6f6419ad67cf157d39a1c2871 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 02:10:18,314 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 02:10:18,315 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 02:10:18,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 02:10:18,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 02:10:18,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 02:10:18,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 02:10:18,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 02:10:18,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 02:10:18,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 02:10:18,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 02:10:18,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 02:10:18,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 02:10:18,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 02:10:18,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 02:10:18,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 02:10:18,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 02:10:18,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 02:10:18,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 02:10:18,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 02:10:18,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 02:10:18,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 02:10:18,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 02:10:18,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 02:10:18,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 02:10:18,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 02:10:18,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 02:10:18,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 02:10:18,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 02:10:18,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 02:10:18,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 02:10:18,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 02:10:18,392 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 02:10:18,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 02:10:18,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 02:10:18,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 02:10:18,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 02:10:18,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 02:10:18,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 02:10:18,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 02:10:18,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 02:10:18,396 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:10:18,421 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 02:10:18,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 02:10:18,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 02:10:18,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 02:10:18,423 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 02:10:18,424 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 02:10:18,424 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 02:10:18,424 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 02:10:18,424 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 02:10:18,425 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 02:10:18,425 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 02:10:18,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 02:10:18,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 02:10:18,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 02:10:18,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 02:10:18,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 02:10:18,426 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 02:10:18,426 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 02:10:18,427 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 02:10:18,427 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 02:10:18,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 02:10:18,427 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 02:10:18,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 02:10:18,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 02:10:18,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 02:10:18,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 02:10:18,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:10:18,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 02:10:18,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 02:10:18,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 02:10:18,438 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 02:10:18,438 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 02:10:18,438 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 02:10:18,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 02:10:18,438 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 02:10:18,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 02:10:18,438 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 02:10:18,439 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 02:10:18,439 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 -> dba22d6df3d4e3652cbc5549e3bb451cd645bea6f6419ad67cf157d39a1c2871 [2023-02-17 02:10:18,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 02:10:18,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 02:10:18,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 02:10:18,728 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 02:10:18,729 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 02:10:18,730 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound5.i [2023-02-17 02:10:19,684 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 02:10:19,894 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 02:10:19,895 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound5.i [2023-02-17 02:10:19,919 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd22fe4e/30fca2f81a0e4e97bef451f0415ddc93/FLAGff9e7342a [2023-02-17 02:10:19,931 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dd22fe4e/30fca2f81a0e4e97bef451f0415ddc93 [2023-02-17 02:10:19,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 02:10:19,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 02:10:19,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 02:10:19,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 02:10:19,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 02:10:19,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:10:19" (1/1) ... [2023-02-17 02:10:19,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f5e8a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:10:19, skipping insertion in model container [2023-02-17 02:10:19,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 02:10:19" (1/1) ... [2023-02-17 02:10:19,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 02:10:19,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 02:10:20,081 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_valuebound5.i[948,961] [2023-02-17 02:10:20,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:10:20,126 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 02:10:20,135 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_valuebound5.i[948,961] [2023-02-17 02:10:20,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 02:10:20,155 INFO L208 MainTranslator]: Completed translation [2023-02-17 02:10:20,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:10:20 WrapperNode [2023-02-17 02:10:20,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 02:10:20,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 02:10:20,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 02:10:20,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 02:10:20,166 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:10:20" (1/1) ... [2023-02-17 02:10:20,173 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:10:20" (1/1) ... [2023-02-17 02:10:20,187 INFO L138 Inliner]: procedures = 18, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 74 [2023-02-17 02:10:20,188 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 02:10:20,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 02:10:20,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 02:10:20,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 02:10:20,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:10:20" (1/1) ... [2023-02-17 02:10:20,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:10:20" (1/1) ... [2023-02-17 02:10:20,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:10:20" (1/1) ... [2023-02-17 02:10:20,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:10:20" (1/1) ... [2023-02-17 02:10:20,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:10:20" (1/1) ... [2023-02-17 02:10:20,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:10:20" (1/1) ... [2023-02-17 02:10:20,244 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:10:20" (1/1) ... [2023-02-17 02:10:20,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:10:20" (1/1) ... [2023-02-17 02:10:20,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 02:10:20,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 02:10:20,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 02:10:20,248 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 02:10:20,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:10:20" (1/1) ... [2023-02-17 02:10:20,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 02:10:20,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 02:10:20,279 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:10:20,281 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:10:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 02:10:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 02:10:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-17 02:10:20,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-17 02:10:20,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 02:10:20,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 02:10:20,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 02:10:20,307 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 02:10:20,350 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 02:10:20,352 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 02:10:23,341 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 02:10:23,345 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 02:10:23,346 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-17 02:10:23,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:10:23 BoogieIcfgContainer [2023-02-17 02:10:23,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 02:10:23,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 02:10:23,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 02:10:23,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 02:10:23,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 02:10:19" (1/3) ... [2023-02-17 02:10:23,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a45aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:10:23, skipping insertion in model container [2023-02-17 02:10:23,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 02:10:20" (2/3) ... [2023-02-17 02:10:23,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55a45aff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 02:10:23, skipping insertion in model container [2023-02-17 02:10:23,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 02:10:23" (3/3) ... [2023-02-17 02:10:23,353 INFO L112 eAbstractionObserver]: Analyzing ICFG knuth_valuebound5.i [2023-02-17 02:10:23,365 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 02:10:23,372 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 02:10:23,419 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 02:10:23,426 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;@3ea6f0f8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 02:10:23,427 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 02:10:23,430 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:10:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 02:10:23,436 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:10:23,437 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:10:23,437 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:10:23,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:10:23,442 INFO L85 PathProgramCache]: Analyzing trace with hash 919095715, now seen corresponding path program 1 times [2023-02-17 02:10:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:10:23,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043677376] [2023-02-17 02:10:23,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:10:23,470 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:23,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:10:23,472 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:10:23,474 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:10:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:10:23,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 02:10:23,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:10:23,786 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:10:23,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:10:23,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:10:23,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043677376] [2023-02-17 02:10:23,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043677376] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:10:23,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:10:23,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 02:10:23,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290722118] [2023-02-17 02:10:23,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:10:23,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 02:10:23,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:10:23,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 02:10:23,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 02:10:23,822 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:10:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:10:23,845 INFO L93 Difference]: Finished difference Result 59 states and 92 transitions. [2023-02-17 02:10:23,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 02:10:23,848 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:10:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:10:23,852 INFO L225 Difference]: With dead ends: 59 [2023-02-17 02:10:23,853 INFO L226 Difference]: Without dead ends: 27 [2023-02-17 02:10:23,858 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:10:23,861 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:10:23,862 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:10:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-17 02:10:23,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-02-17 02:10:23,892 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:10:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-02-17 02:10:23,896 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 29 [2023-02-17 02:10:23,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:10:23,897 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-02-17 02:10:23,897 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:10:23,898 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-02-17 02:10:23,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-17 02:10:23,900 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:10:23,900 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:10:23,919 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:10:24,109 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:10:24,109 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:10:24,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:10:24,110 INFO L85 PathProgramCache]: Analyzing trace with hash -960358297, now seen corresponding path program 1 times [2023-02-17 02:10:24,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:10:24,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210146133] [2023-02-17 02:10:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:10:24,111 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:24,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:10:24,137 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:10:24,139 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:10:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:10:24,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 02:10:24,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:10:27,068 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:10:27,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:10:32,733 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:10:35,438 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:10:39,544 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:10:45,665 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:10:47,891 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 (bvugt |ULTIMATE.start_main_~a~0#1| (_ bv2 32))) (not (bvule |ULTIMATE.start_main_~a~0#1| (_ bv5 32))))) is different from true [2023-02-17 02:10:47,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:10:47,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210146133] [2023-02-17 02:10:47,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210146133] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:10:47,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1620973517] [2023-02-17 02:10:47,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:10:47,893 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:10:47,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:10:47,895 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:10:47,902 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:10:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:10:53,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 02:10:53,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:10:54,230 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:10:54,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:11:00,350 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:11:06,480 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:11:06,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1620973517] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:11:06,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:11:06,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-02-17 02:11:06,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246301374] [2023-02-17 02:11:06,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:11:06,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 02:11:06,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:11:06,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 02:11:06,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=133, Unknown=7, NotChecked=196, Total=380 [2023-02-17 02:11:06,518 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:11:11,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 02:11:20,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 02:11:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:11:21,336 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2023-02-17 02:11:21,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 02:11:21,360 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:11:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:11:21,361 INFO L225 Difference]: With dead ends: 44 [2023-02-17 02:11:21,361 INFO L226 Difference]: Without dead ends: 42 [2023-02-17 02:11:21,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=54, Invalid=177, Unknown=7, NotChecked=224, Total=462 [2023-02-17 02:11:21,362 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s 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, 14.1s IncrementalHoareTripleChecker+Time [2023-02-17 02:11:21,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 99 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 14.1s Time] [2023-02-17 02:11:21,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-17 02:11:21,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2023-02-17 02:11:21,368 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:11:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2023-02-17 02:11:21,372 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 29 [2023-02-17 02:11:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:11:21,372 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2023-02-17 02:11:21,372 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:11:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2023-02-17 02:11:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-17 02:11:21,374 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:11:21,374 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:11:21,431 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:11:21,596 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:11:21,781 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:11:21,782 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:11:21,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:11:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash -603494572, now seen corresponding path program 1 times [2023-02-17 02:11:21,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:11:21,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067458823] [2023-02-17 02:11:21,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:11:21,782 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:11:21,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:11:21,784 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:11:21,785 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:11:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:11:22,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 02:11:22,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:11:22,273 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:11:22,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:11:22,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:11:22,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067458823] [2023-02-17 02:11:22,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067458823] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:11:22,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 02:11:22,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 02:11:22,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329988405] [2023-02-17 02:11:22,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:11:22,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:11:22,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:11:22,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:11:22,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 02:11:22,275 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:11:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:11:23,549 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2023-02-17 02:11:23,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:11:23,557 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:11:23,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:11:23,558 INFO L225 Difference]: With dead ends: 46 [2023-02-17 02:11:23,558 INFO L226 Difference]: Without dead ends: 44 [2023-02-17 02:11:23,558 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:11:23,559 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2023-02-17 02:11:23,559 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.2s Time] [2023-02-17 02:11:23,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-17 02:11:23,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2023-02-17 02:11:23,566 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:11:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2023-02-17 02:11:23,567 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 34 [2023-02-17 02:11:23,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:11:23,567 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2023-02-17 02:11:23,567 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:11:23,567 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2023-02-17 02:11:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 02:11:23,568 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:11:23,568 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:11:23,584 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 (5)] Forceful destruction successful, exit code 0 [2023-02-17 02:11:23,768 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:11:23,768 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:11:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:11:23,770 INFO L85 PathProgramCache]: Analyzing trace with hash -127108025, now seen corresponding path program 1 times [2023-02-17 02:11:23,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:11:23,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773658625] [2023-02-17 02:11:23,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:11:23,770 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:11:23,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:11:23,773 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:11:23,774 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:11:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:11:24,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 02:11:24,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:11:31,032 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,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:11:47,506 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:50,180 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:56,343 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:12:02,489 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:12:04,828 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 (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)) (not (bvule |ULTIMATE.start_main_~a~0#1| (_ bv5 32)))))))) is different from true [2023-02-17 02:12:04,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:12:04,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773658625] [2023-02-17 02:12:04,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773658625] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:12:04,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1974676833] [2023-02-17 02:12:04,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:12:04,830 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:12:04,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:12:04,831 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:12:04,831 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:12:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:12:10,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-17 02:12:10,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:12:15,398 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:12:15,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:12:22,092 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:12:28,235 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:12:28,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1974676833] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:12:28,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 02:12:28,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2023-02-17 02:12:28,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222318522] [2023-02-17 02:12:28,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 02:12:28,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 02:12:28,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:12:28,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 02:12:28,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=204, Unknown=7, NotChecked=238, Total=506 [2023-02-17 02:12:28,253 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:12:33,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 02:12:40,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 02:12:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:12:47,446 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2023-02-17 02:12:47,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 02:12:47,473 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:47,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:12:47,474 INFO L225 Difference]: With dead ends: 52 [2023-02-17 02:12:47,474 INFO L226 Difference]: Without dead ends: 50 [2023-02-17 02:12:47,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 97 SyntacticMatches, 12 SemanticMatches, 24 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 42.1s TimeCoverageRelationStatistics Valid=76, Invalid=287, Unknown=7, NotChecked=280, Total=650 [2023-02-17 02:12:47,476 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2023-02-17 02:12:47,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 68 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 219 Invalid, 2 Unknown, 0 Unchecked, 16.6s Time] [2023-02-17 02:12:47,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-17 02:12:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2023-02-17 02:12:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2023-02-17 02:12:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2023-02-17 02:12:47,483 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 39 [2023-02-17 02:12:47,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:12:47,483 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2023-02-17 02:12:47,483 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:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2023-02-17 02:12:47,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 02:12:47,484 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:12:47,484 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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:47,538 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:47,704 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:47,890 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:47,890 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:12:47,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:12:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1831166220, now seen corresponding path program 1 times [2023-02-17 02:12:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:12:47,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516072181] [2023-02-17 02:12:47,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:12:47,891 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:47,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:12:47,892 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:47,893 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:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:12:48,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-17 02:12:48,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:12:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-17 02:12:49,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:12:50,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:12:50,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516072181] [2023-02-17 02:12:50,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516072181] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:12:50,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2098430620] [2023-02-17 02:12:50,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:12:50,838 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:12:50,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:12:50,841 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:50,851 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:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:12:54,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 02:12:54,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:12:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-17 02:12:57,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 02:12:57,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2098430620] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 02:12:57,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 02:12:57,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2023-02-17 02:12:57,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483730850] [2023-02-17 02:12:57,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 02:12:57,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 02:12:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 02:12:57,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 02:12:57,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2023-02-17 02:12:57,017 INFO L87 Difference]: Start difference. First operand 43 states and 52 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-17 02:12:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 02:12:59,097 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2023-02-17 02:12:59,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 02:12:59,099 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 44 [2023-02-17 02:12:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 02:12:59,100 INFO L225 Difference]: With dead ends: 54 [2023-02-17 02:12:59,100 INFO L226 Difference]: Without dead ends: 52 [2023-02-17 02:12:59,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=37, Invalid=144, Unknown=1, NotChecked=0, Total=182 [2023-02-17 02:12:59,101 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-17 02:12:59,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 112 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-17 02:12:59,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-17 02:12:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2023-02-17 02:12:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-17 02:12:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2023-02-17 02:12:59,107 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 44 [2023-02-17 02:12:59,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 02:12:59,107 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2023-02-17 02:12:59,107 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, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-17 02:12:59,108 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2023-02-17 02:12:59,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-17 02:12:59,108 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 02:12:59,109 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:59,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2023-02-17 02:12:59,329 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 (8)] Forceful destruction successful, exit code 0 [2023-02-17 02:12:59,512 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:12:59,513 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 02:12:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 02:12:59,513 INFO L85 PathProgramCache]: Analyzing trace with hash -114260771, now seen corresponding path program 1 times [2023-02-17 02:12:59,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 02:12:59,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199739717] [2023-02-17 02:12:59,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:12:59,513 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:59,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 02:12:59,514 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:12:59,516 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:12:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:12:59,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 02:12:59,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:13:03,075 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)) (= |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| (_ bv5 32))))) (bvuge |c_ULTIMATE.start_main_~d~0#1| (_ bv0 32)) (bvule |c_ULTIMATE.start_main_~d~0#1| (_ bv5 32)) (bvugt |c_ULTIMATE.start_main_~d~0#1| (_ bv2 32))) is different from false [2023-02-17 02:13:05,650 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| (_ bv5 32)) (bvule |ULTIMATE.start_main_~n~0#1| (_ bv5 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:13:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-02-17 02:13:07,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 02:13:10,577 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:13:13,082 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:13:15,624 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:13:18,144 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:13:20,716 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_39| (_ BitVec 32))) (let ((.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_39|))) (or (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_39| (_ bv2 32)) (not (let ((.cse1 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_39|))) (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_39|)) (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| .cse1)))) (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| .cse1)))) (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_39|)) (= .cse0 (_ bv0 32))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2023-02-17 02:13:23,315 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_39| (_ BitVec 32))) (let ((.cse0 (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_39|))) (or (bvugt |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_39| (_ bv2 32)) (not (let ((.cse1 (bvadd (_ bv4294967294 32) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_39|))) (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_39|)) (bvudiv |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| .cse1)))) (bvurem |v_ULTIMATE.start_main_~n~0#1_BEFORE_CALL_36| .cse1)))) (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_39|)) (= .cse0 (_ bv0 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:13:25,874 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 (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)))) (not (bvule |ULTIMATE.start_main_~a~0#1| (_ bv5 32)))))) is different from false [2023-02-17 02:13:28,419 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 (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)))) (not (bvule |ULTIMATE.start_main_~a~0#1| (_ bv5 32)))))) is different from true [2023-02-17 02:13:28,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 02:13:28,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199739717] [2023-02-17 02:13:28,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199739717] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 02:13:28,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1385518077] [2023-02-17 02:13:28,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 02:13:28,420 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 02:13:28,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 02:13:28,422 INFO L229 MonitoredProcess]: Starting monitored process 11 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:13:28,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-02-17 02:13:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 02:13:34,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 02:13:34,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 02:13:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-17 02:13:50,345 INFO L328 TraceCheckSpWp]: Computing backward predicates...