./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/rint.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/rint.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 24195858fe99a26316e7c38e61598aafdb4b380e3cd36e11fd34d1bc33016c49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 18:32:43,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 18:32:43,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 18:32:43,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 18:32:43,157 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 18:32:43,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 18:32:43,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 18:32:43,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 18:32:43,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 18:32:43,178 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 18:32:43,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 18:32:43,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 18:32:43,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 18:32:43,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 18:32:43,179 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 18:32:43,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 18:32:43,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 18:32:43,180 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 18:32:43,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 18:32:43,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 18:32:43,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 18:32:43,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 18:32:43,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 18:32:43,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 18:32:43,180 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 18:32:43,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 18:32:43,181 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 18:32:43,181 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 18:32:43,181 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 18:32:43,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 18:32:43,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 18:32:43,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 18:32:43,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:32:43,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 18:32:43,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 18:32:43,182 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 18:32:43,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 18:32:43,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 18:32:43,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 18:32:43,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 18:32:43,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 18:32:43,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 18:32:43,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 18:32:43,182 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 24195858fe99a26316e7c38e61598aafdb4b380e3cd36e11fd34d1bc33016c49 [2025-02-07 18:32:43,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 18:32:43,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 18:32:43,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 18:32:43,434 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 18:32:43,434 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 18:32:43,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/rint.i [2025-02-07 18:32:44,513 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/171cbc20a/4f87beae413c46ba98be4f39a0a8c7ec/FLAG7f88609f8 [2025-02-07 18:32:44,762 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 18:32:44,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/rint.i [2025-02-07 18:32:44,778 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/171cbc20a/4f87beae413c46ba98be4f39a0a8c7ec/FLAG7f88609f8 [2025-02-07 18:32:44,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/171cbc20a/4f87beae413c46ba98be4f39a0a8c7ec [2025-02-07 18:32:44,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 18:32:44,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 18:32:44,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 18:32:44,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 18:32:44,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 18:32:44,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:32:44" (1/1) ... [2025-02-07 18:32:44,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c199b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:44, skipping insertion in model container [2025-02-07 18:32:44,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:32:44" (1/1) ... [2025-02-07 18:32:44,821 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 18:32:45,074 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/rint.i[38063,38076] [2025-02-07 18:32:45,085 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: fesetround not supported in non-bitprecise translation at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructBuiltinFesetround(IntegerTranslation.java:738) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleBuiltinFesetround(StandardFunctionHandler.java:2800) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:255) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1658) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:271) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1548) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:224) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java:1195) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1178) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:236) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleLoopBody(CHandler.java:3684) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1610) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:227) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java:1195) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1178) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:236) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:392) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1685) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:159) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3589) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2572) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:649) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:189) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:116) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) 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) [2025-02-07 18:32:45,092 INFO L158 Benchmark]: Toolchain (without parser) took 299.39ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 108.6MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 18:32:45,092 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:32:45,093 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.92ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 108.6MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 18:32:45,093 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.92ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 108.6MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: fesetround not supported in non-bitprecise translation de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: fesetround not supported in non-bitprecise translation: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructBuiltinFesetround(IntegerTranslation.java:738) 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: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/rint.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 24195858fe99a26316e7c38e61598aafdb4b380e3cd36e11fd34d1bc33016c49 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 18:32:46,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 18:32:46,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-07 18:32:46,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 18:32:46,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 18:32:46,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 18:32:46,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 18:32:46,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 18:32:46,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 18:32:46,973 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 18:32:46,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 18:32:46,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 18:32:46,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 18:32:46,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 18:32:46,978 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 18:32:46,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 18:32:46,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 18:32:46,978 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 18:32:46,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 18:32:46,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 18:32:46,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 18:32:46,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 18:32:46,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 18:32:46,979 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 18:32:46,979 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 18:32:46,979 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 18:32:46,979 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 18:32:46,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 18:32:46,979 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 18:32:46,979 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 18:32:46,979 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 18:32:46,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 18:32:46,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 18:32:46,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 18:32:46,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:32:46,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 18:32:46,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 18:32:46,980 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 18:32:46,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 18:32:46,980 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 18:32:46,980 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 18:32:46,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 18:32:46,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 18:32:46,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 18:32:46,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 18:32:46,981 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 24195858fe99a26316e7c38e61598aafdb4b380e3cd36e11fd34d1bc33016c49 [2025-02-07 18:32:47,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 18:32:47,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 18:32:47,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 18:32:47,312 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 18:32:47,313 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 18:32:47,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/rint.i [2025-02-07 18:32:48,617 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26761b21e/5722abf1dcaa4d5d83feb01d5d8e908c/FLAGc0ec1f9b1 [2025-02-07 18:32:48,850 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 18:32:48,851 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/rint.i [2025-02-07 18:32:48,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26761b21e/5722abf1dcaa4d5d83feb01d5d8e908c/FLAGc0ec1f9b1 [2025-02-07 18:32:48,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26761b21e/5722abf1dcaa4d5d83feb01d5d8e908c [2025-02-07 18:32:48,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 18:32:48,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 18:32:48,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 18:32:48,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 18:32:48,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 18:32:48,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:32:48" (1/1) ... [2025-02-07 18:32:48,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a764912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:48, skipping insertion in model container [2025-02-07 18:32:48,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 06:32:48" (1/1) ... [2025-02-07 18:32:48,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 18:32:49,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/rint.i[38063,38076] [2025-02-07 18:32:49,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 18:32:49,242 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 18:32:49,280 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/rint.i[38063,38076] [2025-02-07 18:32:49,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 18:32:49,382 INFO L204 MainTranslator]: Completed translation [2025-02-07 18:32:49,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:49 WrapperNode [2025-02-07 18:32:49,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 18:32:49,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 18:32:49,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 18:32:49,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 18:32:49,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:49" (1/1) ... [2025-02-07 18:32:49,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:49" (1/1) ... [2025-02-07 18:32:49,435 INFO L138 Inliner]: procedures = 463, calls = 43, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 143 [2025-02-07 18:32:49,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 18:32:49,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 18:32:49,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 18:32:49,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 18:32:49,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:49" (1/1) ... [2025-02-07 18:32:49,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:49" (1/1) ... [2025-02-07 18:32:49,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:49" (1/1) ... [2025-02-07 18:32:49,473 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 7, 6]. 47 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 7, 4]. The 0 writes are split as follows [0, 0, 0]. [2025-02-07 18:32:49,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:49" (1/1) ... [2025-02-07 18:32:49,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:49" (1/1) ... [2025-02-07 18:32:49,480 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:49" (1/1) ... [2025-02-07 18:32:49,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:49" (1/1) ... [2025-02-07 18:32:49,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:49" (1/1) ... [2025-02-07 18:32:49,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:49" (1/1) ... [2025-02-07 18:32:49,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 18:32:49,489 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 18:32:49,489 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 18:32:49,489 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 18:32:49,490 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:49" (1/1) ... [2025-02-07 18:32:49,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 18:32:49,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 18:32:49,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 18:32:49,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 18:32:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 18:32:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 18:32:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 18:32:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-07 18:32:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-07 18:32:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-07 18:32:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-07 18:32:49,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 18:32:49,570 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 18:32:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 18:32:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 18:32:49,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 18:32:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-07 18:32:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-07 18:32:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-07 18:32:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 18:32:49,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2025-02-07 18:32:49,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2025-02-07 18:32:49,644 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 18:32:49,645 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 18:32:49,758 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000: call ULTIMATE.dealloc(main_~#modes~0#1.base, main_~#modes~0#1.offset);havoc main_~#modes~0#1.base, main_~#modes~0#1.offset; [2025-02-07 18:32:49,787 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-02-07 18:32:49,788 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 18:32:49,793 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 18:32:49,793 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 18:32:49,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:32:49 BoogieIcfgContainer [2025-02-07 18:32:49,794 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 18:32:49,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 18:32:49,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 18:32:49,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 18:32:49,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 06:32:48" (1/3) ... [2025-02-07 18:32:49,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5402930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 06:32:49, skipping insertion in model container [2025-02-07 18:32:49,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 06:32:49" (2/3) ... [2025-02-07 18:32:49,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5402930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 06:32:49, skipping insertion in model container [2025-02-07 18:32:49,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:32:49" (3/3) ... [2025-02-07 18:32:49,800 INFO L128 eAbstractionObserver]: Analyzing ICFG rint.i [2025-02-07 18:32:49,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 18:32:49,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rint.i that has 3 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 18:32:49,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 18:32:49,842 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@40496f23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 18:32:49,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 18:32:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 39 states have internal predecessors, (45), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-07 18:32:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 18:32:49,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:32:49,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:32:49,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:32:49,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:32:49,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1365323019, now seen corresponding path program 1 times [2025-02-07 18:32:49,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:32:49,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284691784] [2025-02-07 18:32:49,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:32:49,857 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 [2025-02-07 18:32:49,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:32:49,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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) [2025-02-07 18:32:49,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:49,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 18:32:49,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 18:32:49,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:32:49,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:32:49,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 18:32:49,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:32:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:32:49,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:32:49,935 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:32:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284691784] [2025-02-07 18:32:49,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284691784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:32:49,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:32:49,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 18:32:49,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961340171] [2025-02-07 18:32:49,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:32:49,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 18:32:49,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:32:49,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 18:32:49,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 18:32:49,951 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 39 states have internal predecessors, (45), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:49,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:32:49,982 INFO L93 Difference]: Finished difference Result 128 states and 209 transitions. [2025-02-07 18:32:49,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 18:32:49,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-02-07 18:32:49,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:32:49,987 INFO L225 Difference]: With dead ends: 128 [2025-02-07 18:32:49,987 INFO L226 Difference]: Without dead ends: 74 [2025-02-07 18:32:49,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 18:32:49,991 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:32:49,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 163 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:32:49,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-07 18:32:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2025-02-07 18:32:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-07 18:32:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2025-02-07 18:32:50,020 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 11 [2025-02-07 18:32:50,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:32:50,021 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2025-02-07 18:32:50,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:50,021 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2025-02-07 18:32:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-07 18:32:50,022 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:32:50,022 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:32:50,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-02-07 18:32:50,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:50,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:32:50,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:32:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1614360531, now seen corresponding path program 1 times [2025-02-07 18:32:50,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:32:50,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653782679] [2025-02-07 18:32:50,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:32:50,226 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 [2025-02-07 18:32:50,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:32:50,229 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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) [2025-02-07 18:32:50,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:50,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-07 18:32:50,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-07 18:32:50,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:32:50,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:32:50,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 18:32:50,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:32:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:32:50,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:32:50,352 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:32:50,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653782679] [2025-02-07 18:32:50,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653782679] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:32:50,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:32:50,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 18:32:50,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630696511] [2025-02-07 18:32:50,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:32:50,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 18:32:50,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:32:50,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 18:32:50,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 18:32:50,354 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:32:50,499 INFO L93 Difference]: Finished difference Result 110 states and 158 transitions. [2025-02-07 18:32:50,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 18:32:50,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-07 18:32:50,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:32:50,501 INFO L225 Difference]: With dead ends: 110 [2025-02-07 18:32:50,505 INFO L226 Difference]: Without dead ends: 73 [2025-02-07 18:32:50,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 18:32:50,506 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 10 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 18:32:50,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 336 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 18:32:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-07 18:32:50,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2025-02-07 18:32:50,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 40 states have internal predecessors, (46), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (17), 17 states have call predecessors, (17), 16 states have call successors, (17) [2025-02-07 18:32:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2025-02-07 18:32:50,521 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 12 [2025-02-07 18:32:50,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:32:50,521 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2025-02-07 18:32:50,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2025-02-07 18:32:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 18:32:50,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:32:50,522 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:32:50,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-02-07 18:32:50,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:50,723 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:32:50,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:32:50,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1497352637, now seen corresponding path program 1 times [2025-02-07 18:32:50,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:32:50,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361989200] [2025-02-07 18:32:50,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:32:50,725 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 [2025-02-07 18:32:50,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:32:50,727 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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) [2025-02-07 18:32:50,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (4)] Waiting until timeout for monitored process [2025-02-07 18:32:50,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 18:32:50,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 18:32:50,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:32:50,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:32:50,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 18:32:50,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:32:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:32:50,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:32:50,880 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:32:50,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361989200] [2025-02-07 18:32:50,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361989200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:32:50,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:32:50,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 18:32:50,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147050541] [2025-02-07 18:32:50,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:32:50,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 18:32:50,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:32:50,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 18:32:50,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 18:32:50,881 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:32:50,988 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2025-02-07 18:32:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 18:32:50,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-07 18:32:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:32:50,989 INFO L225 Difference]: With dead ends: 79 [2025-02-07 18:32:50,989 INFO L226 Difference]: Without dead ends: 70 [2025-02-07 18:32:50,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 18:32:50,990 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 8 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 18:32:50,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 325 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 18:32:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-07 18:32:50,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 62. [2025-02-07 18:32:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 41 states have internal predecessors, (47), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (17), 17 states have call predecessors, (17), 16 states have call successors, (17) [2025-02-07 18:32:50,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2025-02-07 18:32:50,996 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 13 [2025-02-07 18:32:50,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:32:50,996 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2025-02-07 18:32:50,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:50,996 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2025-02-07 18:32:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 18:32:50,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:32:50,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:32:51,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (4)] Ended with exit code 0 [2025-02-07 18:32:51,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:51,201 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:32:51,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:32:51,201 INFO L85 PathProgramCache]: Analyzing trace with hash -538347145, now seen corresponding path program 1 times [2025-02-07 18:32:51,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:32:51,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163691994] [2025-02-07 18:32:51,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:32:51,202 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 [2025-02-07 18:32:51,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:32:51,204 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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) [2025-02-07 18:32:51,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:51,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 18:32:51,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 18:32:51,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:32:51,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:32:51,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 18:32:51,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:32:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:32:51,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:32:51,292 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:32:51,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163691994] [2025-02-07 18:32:51,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163691994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:32:51,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:32:51,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 18:32:51,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138887559] [2025-02-07 18:32:51,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:32:51,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 18:32:51,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:32:51,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 18:32:51,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 18:32:51,293 INFO L87 Difference]: Start difference. First operand 62 states and 85 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:32:51,422 INFO L93 Difference]: Finished difference Result 120 states and 167 transitions. [2025-02-07 18:32:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 18:32:51,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-07 18:32:51,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:32:51,424 INFO L225 Difference]: With dead ends: 120 [2025-02-07 18:32:51,424 INFO L226 Difference]: Without dead ends: 80 [2025-02-07 18:32:51,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 18:32:51,426 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 11 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 18:32:51,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 383 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 18:32:51,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-07 18:32:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2025-02-07 18:32:51,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 45 states have internal predecessors, (52), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (18), 18 states have call predecessors, (18), 16 states have call successors, (18) [2025-02-07 18:32:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2025-02-07 18:32:51,432 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 13 [2025-02-07 18:32:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:32:51,432 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2025-02-07 18:32:51,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2025-02-07 18:32:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 18:32:51,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:32:51,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:32:51,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-07 18:32:51,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:51,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:32:51,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:32:51,634 INFO L85 PathProgramCache]: Analyzing trace with hash -827600211, now seen corresponding path program 1 times [2025-02-07 18:32:51,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:32:51,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107774242] [2025-02-07 18:32:51,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:32:51,634 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 [2025-02-07 18:32:51,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:32:51,637 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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) [2025-02-07 18:32:51,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:51,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 18:32:51,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 18:32:51,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:32:51,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:32:51,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 18:32:51,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:32:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:32:51,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:32:51,701 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:32:51,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107774242] [2025-02-07 18:32:51,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107774242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:32:51,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:32:51,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 18:32:51,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068678613] [2025-02-07 18:32:51,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:32:51,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 18:32:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:32:51,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 18:32:51,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 18:32:51,703 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:51,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:32:51,761 INFO L93 Difference]: Finished difference Result 154 states and 211 transitions. [2025-02-07 18:32:51,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 18:32:51,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-02-07 18:32:51,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:32:51,762 INFO L225 Difference]: With dead ends: 154 [2025-02-07 18:32:51,762 INFO L226 Difference]: Without dead ends: 88 [2025-02-07 18:32:51,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 18:32:51,763 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 13 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 18:32:51,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 269 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 18:32:51,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-07 18:32:51,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2025-02-07 18:32:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 46 states have internal predecessors, (52), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (20), 18 states have call predecessors, (20), 17 states have call successors, (20) [2025-02-07 18:32:51,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2025-02-07 18:32:51,769 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 14 [2025-02-07 18:32:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:32:51,769 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2025-02-07 18:32:51,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2025-02-07 18:32:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 18:32:51,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:32:51,770 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:32:51,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:51,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:51,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:32:51,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:32:51,973 INFO L85 PathProgramCache]: Analyzing trace with hash 494029235, now seen corresponding path program 1 times [2025-02-07 18:32:51,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:32:51,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148393235] [2025-02-07 18:32:51,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:32:51,973 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 [2025-02-07 18:32:51,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:32:51,977 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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) [2025-02-07 18:32:51,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (7)] Waiting until timeout for monitored process [2025-02-07 18:32:52,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 18:32:52,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 18:32:52,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:32:52,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:32:52,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 18:32:52,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:32:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:32:52,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:32:52,074 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:32:52,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148393235] [2025-02-07 18:32:52,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148393235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:32:52,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:32:52,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 18:32:52,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990078754] [2025-02-07 18:32:52,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:32:52,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 18:32:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:32:52,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 18:32:52,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 18:32:52,075 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:52,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:32:52,153 INFO L93 Difference]: Finished difference Result 152 states and 208 transitions. [2025-02-07 18:32:52,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 18:32:52,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-02-07 18:32:52,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:32:52,154 INFO L225 Difference]: With dead ends: 152 [2025-02-07 18:32:52,154 INFO L226 Difference]: Without dead ends: 86 [2025-02-07 18:32:52,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 18:32:52,155 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 14 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 18:32:52,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 274 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 18:32:52,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-07 18:32:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2025-02-07 18:32:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 46 states have internal predecessors, (52), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (19), 18 states have call predecessors, (19), 17 states have call successors, (19) [2025-02-07 18:32:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2025-02-07 18:32:52,161 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 14 [2025-02-07 18:32:52,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:32:52,161 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2025-02-07 18:32:52,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2025-02-07 18:32:52,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 18:32:52,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:32:52,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:32:52,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (7)] Ended with exit code 0 [2025-02-07 18:32:52,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:52,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:32:52,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:32:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1338869296, now seen corresponding path program 1 times [2025-02-07 18:32:52,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:32:52,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111973597] [2025-02-07 18:32:52,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:32:52,368 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 [2025-02-07 18:32:52,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:32:52,371 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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) [2025-02-07 18:32:52,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:52,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 18:32:52,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 18:32:52,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:32:52,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:32:52,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 18:32:52,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:32:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:32:52,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:32:52,499 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:32:52,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111973597] [2025-02-07 18:32:52,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111973597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:32:52,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:32:52,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-07 18:32:52,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173229491] [2025-02-07 18:32:52,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:32:52,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 18:32:52,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:32:52,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 18:32:52,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-07 18:32:52,500 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:52,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:32:52,614 INFO L93 Difference]: Finished difference Result 132 states and 180 transitions. [2025-02-07 18:32:52,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 18:32:52,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-02-07 18:32:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:32:52,617 INFO L225 Difference]: With dead ends: 132 [2025-02-07 18:32:52,617 INFO L226 Difference]: Without dead ends: 88 [2025-02-07 18:32:52,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 18:32:52,618 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 12 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 18:32:52,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 327 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 18:32:52,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-07 18:32:52,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2025-02-07 18:32:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 50 states have internal predecessors, (56), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (21), 18 states have call predecessors, (21), 17 states have call successors, (21) [2025-02-07 18:32:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2025-02-07 18:32:52,624 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 14 [2025-02-07 18:32:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:32:52,624 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2025-02-07 18:32:52,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2025-02-07 18:32:52,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 18:32:52,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:32:52,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:32:52,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-02-07 18:32:52,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:52,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:32:52,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:32:52,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1441803238, now seen corresponding path program 1 times [2025-02-07 18:32:52,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:32:52,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705719003] [2025-02-07 18:32:52,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:32:52,826 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 [2025-02-07 18:32:52,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:32:52,828 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/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) [2025-02-07 18:32:52,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (9)] Waiting until timeout for monitored process [2025-02-07 18:32:52,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 18:32:52,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 18:32:52,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:32:52,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 18:32:52,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 18:32:52,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 18:32:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 18:32:52,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 18:32:52,940 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 18:32:52,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705719003] [2025-02-07 18:32:52,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705719003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 18:32:52,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 18:32:52,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 18:32:52,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356677736] [2025-02-07 18:32:52,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 18:32:52,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 18:32:52,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 18:32:52,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 18:32:52,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-07 18:32:52,940 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:53,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 18:32:53,047 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2025-02-07 18:32:53,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 18:32:53,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-02-07 18:32:53,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 18:32:53,048 INFO L225 Difference]: With dead ends: 94 [2025-02-07 18:32:53,048 INFO L226 Difference]: Without dead ends: 82 [2025-02-07 18:32:53,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-07 18:32:53,049 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 8 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 18:32:53,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 398 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 18:32:53,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-07 18:32:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2025-02-07 18:32:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 17 states have call successors, (21) [2025-02-07 18:32:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2025-02-07 18:32:53,055 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 15 [2025-02-07 18:32:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 18:32:53,055 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2025-02-07 18:32:53,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 18:32:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2025-02-07 18:32:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 18:32:53,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 18:32:53,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:32:53,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (9)] Ended with exit code 0 [2025-02-07 18:32:53,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:53,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 18:32:53,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 18:32:53,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2011390630, now seen corresponding path program 1 times [2025-02-07 18:32:53,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 18:32:53,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407651543] [2025-02-07 18:32:53,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 18:32:53,257 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 [2025-02-07 18:32:53,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 18:32:53,259 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/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) [2025-02-07 18:32:53,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:53,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 18:32:53,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 18:32:53,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:32:53,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 18:32:53,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 18:32:53,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 18:32:53,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 18:32:53,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 18:32:53,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 18:32:53,364 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-07 18:32:53,364 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 18:32:53,365 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 18:32:53,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-02-07 18:32:53,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/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 [2025-02-07 18:32:53,572 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 18:32:53,583 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 18:32:53,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 06:32:53 BoogieIcfgContainer [2025-02-07 18:32:53,585 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 18:32:53,585 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 18:32:53,585 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 18:32:53,586 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 18:32:53,586 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 06:32:49" (3/4) ... [2025-02-07 18:32:53,587 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 18:32:53,588 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 18:32:53,588 INFO L158 Benchmark]: Toolchain (without parser) took 4707.99ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 33.0MB in the end (delta: 57.8MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2025-02-07 18:32:53,588 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory was 62.6MB in the beginning and 62.5MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:32:53,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.65ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 44.1MB in the end (delta: 46.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-07 18:32:53,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.42ms. Allocated memory is still 117.4MB. Free memory was 44.1MB in the beginning and 41.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:32:53,589 INFO L158 Benchmark]: Boogie Preprocessor took 47.41ms. Allocated memory is still 117.4MB. Free memory was 41.6MB in the beginning and 39.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:32:53,589 INFO L158 Benchmark]: IcfgBuilder took 305.66ms. Allocated memory is still 117.4MB. Free memory was 39.5MB in the beginning and 75.1MB in the end (delta: -35.6MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2025-02-07 18:32:53,589 INFO L158 Benchmark]: TraceAbstraction took 3789.19ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 33.9MB in the end (delta: 40.4MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2025-02-07 18:32:53,589 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 117.4MB. Free memory was 33.9MB in the beginning and 33.0MB in the end (delta: 975.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 18:32:53,590 INFO L338 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 83.9MB. Free memory was 62.6MB in the beginning and 62.5MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.65ms. Allocated memory is still 117.4MB. Free memory was 90.5MB in the beginning and 44.1MB in the end (delta: 46.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.42ms. Allocated memory is still 117.4MB. Free memory was 44.1MB in the beginning and 41.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.41ms. Allocated memory is still 117.4MB. Free memory was 41.6MB in the beginning and 39.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 305.66ms. Allocated memory is still 117.4MB. Free memory was 39.5MB in the beginning and 75.1MB in the end (delta: -35.6MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3789.19ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 33.9MB in the end (delta: 40.4MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 117.4MB. Free memory was 33.9MB in the beginning and 33.0MB in the end (delta: 975.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 997]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of rint at line 1006. Possible FailurePath: [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1002] int i = 0; VAL [i=0, modes={3:0}] [L1002] COND TRUE i < sizeof(modes) / sizeof(int) [L1003] EXPR modes[i] [L1003] FCALL fesetround(modes[i]) VAL [i=0, modes={3:0}] [L1004] modes[i] [L1005] case 0x400: [L1006] CALL __VERIFIER_assert(rint(12.9) == 12.) VAL [\old(cond)=0] [L997] COND TRUE !(cond) VAL [\old(cond)=0] [L997] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 2475 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1860 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 476 IncrementalHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 615 mSDtfsCounter, 476 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=8, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 104 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 273 SizeOfPredicates, 38 NumberOfNonLiveVariables, 420 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-07 18:32:53,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample