./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/nearbyint.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/nearbyint.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 69ee9fe46649b3b552609f3ec360bfaabd8d7bfa2167c3567b409de7910df01a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:52:34,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:52:34,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:52:34,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:52:34,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:52:34,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:52:34,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:52:34,869 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:52:34,869 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:52:34,869 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:52:34,870 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:52:34,870 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:52:34,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:52:34,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:52:34,871 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:52:34,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:52:34,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:52:34,871 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:52:34,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:52:34,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:52:34,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:52:34,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:52:34,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:52:34,872 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:52:34,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:52:34,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:52:34,872 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 -> 69ee9fe46649b3b552609f3ec360bfaabd8d7bfa2167c3567b409de7910df01a [2025-02-05 12:52:35,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:52:35,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:52:35,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:52:35,156 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:52:35,156 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:52:35,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/nearbyint.i [2025-02-05 12:52:36,317 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e7eb948d/31ce9be018294e2196ca65da776128db/FLAGa78177dcf [2025-02-05 12:52:36,559 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:52:36,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/nearbyint.i [2025-02-05 12:52:36,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e7eb948d/31ce9be018294e2196ca65da776128db/FLAGa78177dcf [2025-02-05 12:52:36,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e7eb948d/31ce9be018294e2196ca65da776128db [2025-02-05 12:52:36,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:52:36,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:52:36,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:52:36,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:52:36,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:52:36,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:52:36" (1/1) ... [2025-02-05 12:52:36,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73825fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:36, skipping insertion in model container [2025-02-05 12:52:36,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:52:36" (1/1) ... [2025-02-05 12:52:36,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:52:37,166 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/nearbyint.i[38068,38081] [2025-02-05 12:52:37,176 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-05 12:52:37,182 INFO L158 Benchmark]: Toolchain (without parser) took 307.04ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 144.8MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 12:52:37,183 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:52:37,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.24ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 144.8MB in the end (delta: 13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 12:52:37,184 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.24ms. Allocated memory is still 201.3MB. Free memory was 158.1MB in the beginning and 144.8MB 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/nearbyint.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 69ee9fe46649b3b552609f3ec360bfaabd8d7bfa2167c3567b409de7910df01a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:52:39,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:52:39,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 12:52:39,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:52:39,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:52:39,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:52:39,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:52:39,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:52:39,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:52:39,217 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:52:39,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:52:39,218 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:52:39,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:52:39,218 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:52:39,218 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:52:39,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:52:39,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:52:39,219 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:52:39,219 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:52:39,219 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:52:39,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:52:39,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:52:39,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:52:39,220 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 12:52:39,220 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 12:52:39,220 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 12:52:39,220 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:52:39,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:52:39,220 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:52:39,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:52:39,220 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:52:39,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:52:39,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:52:39,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:52:39,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:52:39,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:52:39,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:52:39,221 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:52:39,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:52:39,221 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 12:52:39,221 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 12:52:39,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:52:39,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:52:39,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:52:39,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:52:39,222 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 -> 69ee9fe46649b3b552609f3ec360bfaabd8d7bfa2167c3567b409de7910df01a [2025-02-05 12:52:39,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:52:39,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:52:39,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:52:39,524 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:52:39,525 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:52:39,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/nearbyint.i [2025-02-05 12:52:40,745 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/568720025/5b22f898c7cd43e19a68f1699208293b/FLAG3aebeb43d [2025-02-05 12:52:41,038 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:52:41,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/nearbyint.i [2025-02-05 12:52:41,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/568720025/5b22f898c7cd43e19a68f1699208293b/FLAG3aebeb43d [2025-02-05 12:52:41,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/568720025/5b22f898c7cd43e19a68f1699208293b [2025-02-05 12:52:41,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:52:41,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:52:41,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:52:41,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:52:41,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:52:41,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:52:41" (1/1) ... [2025-02-05 12:52:41,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f45aa8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41, skipping insertion in model container [2025-02-05 12:52:41,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:52:41" (1/1) ... [2025-02-05 12:52:41,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:52:41,400 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/nearbyint.i[38068,38081] [2025-02-05 12:52:41,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:52:41,432 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:52:41,472 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/nearbyint.i[38068,38081] [2025-02-05 12:52:41,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:52:41,602 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:52:41,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41 WrapperNode [2025-02-05 12:52:41,604 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:52:41,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:52:41,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:52:41,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:52:41,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41" (1/1) ... [2025-02-05 12:52:41,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41" (1/1) ... [2025-02-05 12:52:41,655 INFO L138 Inliner]: procedures = 463, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 136 [2025-02-05 12:52:41,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:52:41,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:52:41,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:52:41,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:52:41,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41" (1/1) ... [2025-02-05 12:52:41,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41" (1/1) ... [2025-02-05 12:52:41,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41" (1/1) ... [2025-02-05 12:52:41,690 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2025-02-05 12:52:41,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41" (1/1) ... [2025-02-05 12:52:41,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41" (1/1) ... [2025-02-05 12:52:41,695 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41" (1/1) ... [2025-02-05 12:52:41,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41" (1/1) ... [2025-02-05 12:52:41,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41" (1/1) ... [2025-02-05 12:52:41,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41" (1/1) ... [2025-02-05 12:52:41,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:52:41,704 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:52:41,704 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:52:41,705 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:52:41,705 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41" (1/1) ... [2025-02-05 12:52:41,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:52:41,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:52:41,742 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-05 12:52:41,748 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-05 12:52:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-05 12:52:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 12:52:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-05 12:52:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-05 12:52:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-05 12:52:41,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 12:52:41,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 12:52:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:52:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:52:41,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:52:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-05 12:52:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-05 12:52:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-05 12:52:41,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2025-02-05 12:52:41,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2025-02-05 12:52:41,884 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:52:41,886 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:52:42,111 INFO L1309 $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-05 12:52:42,155 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-02-05 12:52:42,156 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:52:42,162 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:52:42,162 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:52:42,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:52:42 BoogieIcfgContainer [2025-02-05 12:52:42,163 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:52:42,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:52:42,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:52:42,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:52:42,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:52:41" (1/3) ... [2025-02-05 12:52:42,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9db44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:52:42, skipping insertion in model container [2025-02-05 12:52:42,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:52:41" (2/3) ... [2025-02-05 12:52:42,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9db44c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:52:42, skipping insertion in model container [2025-02-05 12:52:42,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:52:42" (3/3) ... [2025-02-05 12:52:42,182 INFO L128 eAbstractionObserver]: Analyzing ICFG nearbyint.i [2025-02-05 12:52:42,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:52:42,198 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nearbyint.i that has 3 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:52:42,243 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:52:42,253 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;@54f20c3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:52:42,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:52:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 41 states have internal predecessors, (47), 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-05 12:52:42,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 12:52:42,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:52:42,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:52:42,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:52:42,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:52:42,269 INFO L85 PathProgramCache]: Analyzing trace with hash 713163790, now seen corresponding path program 1 times [2025-02-05 12:52:42,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:52:42,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139524170] [2025-02-05 12:52:42,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:52:42,277 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-05 12:52:42,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:52:42,280 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-05 12:52:42,282 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-05 12:52:42,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 12:52:42,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 12:52:42,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:52:42,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:52:42,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 12:52:42,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:52:42,402 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-05 12:52:42,403 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:52:42,403 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:52:42,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139524170] [2025-02-05 12:52:42,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139524170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:52:42,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:52:42,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:52:42,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792161250] [2025-02-05 12:52:42,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:52:42,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:52:42,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:52:42,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:52:42,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:52:42,425 INFO L87 Difference]: Start difference. First operand has 61 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 41 states have internal predecessors, (47), 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 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-05 12:52:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:52:42,476 INFO L93 Difference]: Finished difference Result 140 states and 234 transitions. [2025-02-05 12:52:42,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:52:42,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 12 [2025-02-05 12:52:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:52:42,485 INFO L225 Difference]: With dead ends: 140 [2025-02-05 12:52:42,486 INFO L226 Difference]: Without dead ends: 77 [2025-02-05 12:52:42,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-05 12:52:42,493 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 14 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 167 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-05 12:52:42,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 167 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 12:52:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-05 12:52:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2025-02-05 12:52:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 12:52:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2025-02-05 12:52:42,538 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 12 [2025-02-05 12:52:42,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:52:42,539 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 85 transitions. [2025-02-05 12:52:42,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-05 12:52:42,539 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 85 transitions. [2025-02-05 12:52:42,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-05 12:52:42,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:52:42,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:52:42,546 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-05 12:52:42,741 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-05 12:52:42,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:52:42,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:52:42,742 INFO L85 PathProgramCache]: Analyzing trace with hash 161619795, now seen corresponding path program 1 times [2025-02-05 12:52:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:52:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191800316] [2025-02-05 12:52:42,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:52:42,743 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-05 12:52:42,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:52:42,746 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-05 12:52:42,749 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-05 12:52:42,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-05 12:52:42,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-05 12:52:42,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:52:42,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:52:42,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 12:52:42,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:52:42,887 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-05 12:52:42,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:52:42,888 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:52:42,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191800316] [2025-02-05 12:52:42,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191800316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:52:42,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:52:42,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 12:52:42,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083398613] [2025-02-05 12:52:42,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:52:42,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 12:52:42,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:52:42,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 12:52:42,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:52:42,890 INFO L87 Difference]: Start difference. First operand 58 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-05 12:52:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:52:43,057 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2025-02-05 12:52:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 12:52:43,058 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-05 12:52:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:52:43,059 INFO L225 Difference]: With dead ends: 131 [2025-02-05 12:52:43,059 INFO L226 Difference]: Without dead ends: 76 [2025-02-05 12:52:43,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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-05 12:52:43,060 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 11 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:52:43,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 370 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 12:52:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-05 12:52:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 63. [2025-02-05 12:52:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 42 states have internal predecessors, (48), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 18 states have call predecessors, (21), 20 states have call successors, (21) [2025-02-05 12:52:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2025-02-05 12:52:43,068 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 13 [2025-02-05 12:52:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:52:43,068 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2025-02-05 12:52:43,068 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-05 12:52:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2025-02-05 12:52:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 12:52:43,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:52:43,069 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:52:43,072 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-05 12:52:43,272 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-05 12:52:43,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:52:43,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:52:43,273 INFO L85 PathProgramCache]: Analyzing trace with hash 717244374, now seen corresponding path program 1 times [2025-02-05 12:52:43,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:52:43,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323895131] [2025-02-05 12:52:43,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:52:43,274 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-05 12:52:43,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:52:43,277 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-05 12:52:43,278 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-05 12:52:43,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 12:52:43,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 12:52:43,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:52:43,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:52:43,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 12:52:43,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:52:43,396 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-05 12:52:43,396 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:52:43,397 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:52:43,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323895131] [2025-02-05 12:52:43,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323895131] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:52:43,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:52:43,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 12:52:43,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290095041] [2025-02-05 12:52:43,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:52:43,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 12:52:43,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:52:43,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 12:52:43,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:52:43,398 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-05 12:52:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:52:43,577 INFO L93 Difference]: Finished difference Result 133 states and 194 transitions. [2025-02-05 12:52:43,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 12:52:43,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-05 12:52:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:52:43,579 INFO L225 Difference]: With dead ends: 133 [2025-02-05 12:52:43,579 INFO L226 Difference]: Without dead ends: 73 [2025-02-05 12:52:43,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 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-05 12:52:43,580 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 9 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:52:43,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 428 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 12:52:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-05 12:52:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2025-02-05 12:52:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 43 states have internal predecessors, (49), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 18 states have call predecessors, (21), 20 states have call successors, (21) [2025-02-05 12:52:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2025-02-05 12:52:43,590 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 14 [2025-02-05 12:52:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:52:43,591 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2025-02-05 12:52:43,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-05 12:52:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2025-02-05 12:52:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 12:52:43,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:52:43,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:52:43,595 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-05 12:52:43,794 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-05 12:52:43,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:52:43,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:52:43,795 INFO L85 PathProgramCache]: Analyzing trace with hash -430951727, now seen corresponding path program 1 times [2025-02-05 12:52:43,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:52:43,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439568397] [2025-02-05 12:52:43,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:52:43,798 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-05 12:52:43,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:52:43,799 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-05 12:52:43,801 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-05 12:52:43,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 12:52:43,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 12:52:43,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:52:43,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:52:43,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 12:52:43,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:52:43,913 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-05 12:52:43,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:52:43,913 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:52:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439568397] [2025-02-05 12:52:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439568397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:52:43,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:52:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 12:52:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333391193] [2025-02-05 12:52:43,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:52:43,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 12:52:43,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:52:43,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 12:52:43,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:52:43,915 INFO L87 Difference]: Start difference. First operand 64 states and 91 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-05 12:52:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:52:44,128 INFO L93 Difference]: Finished difference Result 144 states and 213 transitions. [2025-02-05 12:52:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 12:52:44,129 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-05 12:52:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:52:44,131 INFO L225 Difference]: With dead ends: 144 [2025-02-05 12:52:44,131 INFO L226 Difference]: Without dead ends: 83 [2025-02-05 12:52:44,132 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-05 12:52:44,133 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 12 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 12:52:44,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 420 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 12:52:44,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-02-05 12:52:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 70. [2025-02-05 12:52:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 47 states have internal predecessors, (54), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2025-02-05 12:52:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2025-02-05 12:52:44,142 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 14 [2025-02-05 12:52:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:52:44,143 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2025-02-05 12:52:44,143 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-05 12:52:44,143 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2025-02-05 12:52:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 12:52:44,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:52:44,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:52:44,149 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-05 12:52:44,344 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-05 12:52:44,345 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:52:44,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:52:44,345 INFO L85 PathProgramCache]: Analyzing trace with hash 757923891, now seen corresponding path program 1 times [2025-02-05 12:52:44,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:52:44,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974167649] [2025-02-05 12:52:44,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:52:44,346 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-05 12:52:44,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:52:44,351 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-05 12:52:44,352 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-05 12:52:44,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 12:52:44,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 12:52:44,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:52:44,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:52:44,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 12:52:44,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:52:44,440 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-05 12:52:44,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:52:44,440 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:52:44,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974167649] [2025-02-05 12:52:44,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974167649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:52:44,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:52:44,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 12:52:44,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435328723] [2025-02-05 12:52:44,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:52:44,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 12:52:44,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:52:44,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 12:52:44,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:52:44,442 INFO L87 Difference]: Start difference. First operand 70 states and 97 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-05 12:52:44,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:52:44,522 INFO L93 Difference]: Finished difference Result 158 states and 227 transitions. [2025-02-05 12:52:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 12:52:44,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-05 12:52:44,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:52:44,523 INFO L225 Difference]: With dead ends: 158 [2025-02-05 12:52:44,524 INFO L226 Difference]: Without dead ends: 91 [2025-02-05 12:52:44,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-05 12:52:44,525 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 14 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 293 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:52:44,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 293 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 12:52:44,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-05 12:52:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2025-02-05 12:52:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 48 states have internal predecessors, (54), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (24), 19 states have call predecessors, (24), 21 states have call successors, (24) [2025-02-05 12:52:44,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2025-02-05 12:52:44,540 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 15 [2025-02-05 12:52:44,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:52:44,540 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2025-02-05 12:52:44,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-05 12:52:44,540 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2025-02-05 12:52:44,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 12:52:44,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:52:44,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:52:44,545 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-05 12:52:44,741 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-05 12:52:44,741 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:52:44,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:52:44,742 INFO L85 PathProgramCache]: Analyzing trace with hash -472603624, now seen corresponding path program 1 times [2025-02-05 12:52:44,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:52:44,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516810747] [2025-02-05 12:52:44,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:52:44,742 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-05 12:52:44,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:52:44,744 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-05 12:52:44,746 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-05 12:52:44,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 12:52:44,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 12:52:44,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:52:44,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:52:44,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 12:52:44,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:52:44,832 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-05 12:52:44,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:52:44,833 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:52:44,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516810747] [2025-02-05 12:52:44,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516810747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:52:44,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:52:44,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 12:52:44,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466552141] [2025-02-05 12:52:44,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:52:44,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 12:52:44,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:52:44,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 12:52:44,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 12:52:44,834 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-05 12:52:44,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:52:44,928 INFO L93 Difference]: Finished difference Result 156 states and 224 transitions. [2025-02-05 12:52:44,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 12:52:44,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-05 12:52:44,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:52:44,929 INFO L225 Difference]: With dead ends: 156 [2025-02-05 12:52:44,929 INFO L226 Difference]: Without dead ends: 89 [2025-02-05 12:52:44,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-05 12:52:44,930 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 15 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 298 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-05 12:52:44,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 298 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 12:52:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-05 12:52:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2025-02-05 12:52:44,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 48 states have internal predecessors, (54), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 19 states have call predecessors, (23), 21 states have call successors, (23) [2025-02-05 12:52:44,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2025-02-05 12:52:44,943 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 15 [2025-02-05 12:52:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:52:44,944 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2025-02-05 12:52:44,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-05 12:52:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2025-02-05 12:52:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 12:52:44,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:52:44,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:52:44,948 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-05 12:52:45,145 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-05 12:52:45,146 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:52:45,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:52:45,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1259740118, now seen corresponding path program 1 times [2025-02-05 12:52:45,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:52:45,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111611260] [2025-02-05 12:52:45,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:52:45,147 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-05 12:52:45,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:52:45,149 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-05 12:52:45,150 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-05 12:52:45,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 12:52:45,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 12:52:45,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:52:45,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:52:45,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 12:52:45,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:52:45,240 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-05 12:52:45,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:52:45,240 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:52:45,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111611260] [2025-02-05 12:52:45,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111611260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:52:45,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:52:45,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 12:52:45,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787845166] [2025-02-05 12:52:45,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:52:45,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 12:52:45,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:52:45,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 12:52:45,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:52:45,242 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-05 12:52:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:52:45,387 INFO L93 Difference]: Finished difference Result 158 states and 229 transitions. [2025-02-05 12:52:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 12:52:45,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-05 12:52:45,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:52:45,392 INFO L225 Difference]: With dead ends: 158 [2025-02-05 12:52:45,392 INFO L226 Difference]: Without dead ends: 91 [2025-02-05 12:52:45,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 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-05 12:52:45,393 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 13 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:52:45,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 361 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 12:52:45,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-05 12:52:45,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2025-02-05 12:52:45,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 52 states have internal predecessors, (58), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (25), 19 states have call predecessors, (25), 21 states have call successors, (25) [2025-02-05 12:52:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 105 transitions. [2025-02-05 12:52:45,407 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 105 transitions. Word has length 15 [2025-02-05 12:52:45,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:52:45,408 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 105 transitions. [2025-02-05 12:52:45,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 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-05 12:52:45,408 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 105 transitions. [2025-02-05 12:52:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 12:52:45,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:52:45,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:52:45,412 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-05 12:52:45,609 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-05 12:52:45,609 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:52:45,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:52:45,609 INFO L85 PathProgramCache]: Analyzing trace with hash 399236019, now seen corresponding path program 1 times [2025-02-05 12:52:45,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:52:45,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436127874] [2025-02-05 12:52:45,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:52:45,610 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-05 12:52:45,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:52:45,613 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-05 12:52:45,614 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-05 12:52:45,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 12:52:45,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 12:52:45,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:52:45,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:52:45,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 12:52:45,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:52:45,721 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-05 12:52:45,721 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 12:52:45,722 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 12:52:45,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436127874] [2025-02-05 12:52:45,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436127874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:52:45,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:52:45,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 12:52:45,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921325752] [2025-02-05 12:52:45,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:52:45,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 12:52:45,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 12:52:45,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 12:52:45,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 12:52:45,722 INFO L87 Difference]: Start difference. First operand 76 states and 105 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-05 12:52:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:52:45,849 INFO L93 Difference]: Finished difference Result 157 states and 218 transitions. [2025-02-05 12:52:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 12:52:45,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 16 [2025-02-05 12:52:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:52:45,850 INFO L225 Difference]: With dead ends: 157 [2025-02-05 12:52:45,850 INFO L226 Difference]: Without dead ends: 85 [2025-02-05 12:52:45,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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-05 12:52:45,851 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 9 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:52:45,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 452 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 12:52:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-05 12:52:45,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2025-02-05 12:52:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 55 states have internal predecessors, (62), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (25), 20 states have call predecessors, (25), 21 states have call successors, (25) [2025-02-05 12:52:45,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2025-02-05 12:52:45,860 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 16 [2025-02-05 12:52:45,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:52:45,860 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2025-02-05 12:52:45,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-05 12:52:45,860 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2025-02-05 12:52:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 12:52:45,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:52:45,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:52:45,865 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-02-05 12:52:46,063 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-05 12:52:46,063 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:52:46,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:52:46,064 INFO L85 PathProgramCache]: Analyzing trace with hash 717152308, now seen corresponding path program 1 times [2025-02-05 12:52:46,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 12:52:46,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883515834] [2025-02-05 12:52:46,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:52:46,064 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-05 12:52:46,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 12:52:46,066 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-05 12:52:46,067 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-05 12:52:46,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 12:52:46,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 12:52:46,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:52:46,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 12:52:46,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 12:52:46,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-05 12:52:46,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 12:52:46,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:52:46,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 12:52:46,121 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-05 12:52:46,121 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 12:52:46,122 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 12:52:46,127 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-05 12:52:46,326 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-05 12:52:46,329 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:52:46,340 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 12:52:46,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 12:52:46 BoogieIcfgContainer [2025-02-05 12:52:46,342 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 12:52:46,342 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 12:52:46,342 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 12:52:46,343 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 12:52:46,343 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:52:42" (3/4) ... [2025-02-05 12:52:46,345 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 12:52:46,345 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 12:52:46,346 INFO L158 Benchmark]: Toolchain (without parser) took 5279.34ms. Allocated memory was 83.9MB in the beginning and 125.8MB in the end (delta: 41.9MB). Free memory was 55.4MB in the beginning and 46.6MB in the end (delta: 8.7MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2025-02-05 12:52:46,346 INFO L158 Benchmark]: CDTParser took 3.31ms. Allocated memory is still 83.9MB. Free memory was 54.1MB in the beginning and 54.1MB in the end (delta: 18.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:52:46,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.09ms. Allocated memory is still 83.9MB. Free memory was 55.2MB in the beginning and 37.1MB in the end (delta: 18.1MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. [2025-02-05 12:52:46,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.40ms. Allocated memory is still 83.9MB. Free memory was 37.1MB in the beginning and 34.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:52:46,347 INFO L158 Benchmark]: Boogie Preprocessor took 47.74ms. Allocated memory is still 83.9MB. Free memory was 34.3MB in the beginning and 32.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:52:46,347 INFO L158 Benchmark]: IcfgBuilder took 458.33ms. Allocated memory was 83.9MB in the beginning and 125.8MB in the end (delta: 41.9MB). Free memory was 32.3MB in the beginning and 90.3MB in the end (delta: -58.1MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2025-02-05 12:52:46,347 INFO L158 Benchmark]: TraceAbstraction took 4176.69ms. Allocated memory is still 125.8MB. Free memory was 89.4MB in the beginning and 46.7MB in the end (delta: 42.7MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2025-02-05 12:52:46,347 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 125.8MB. Free memory was 46.7MB in the beginning and 46.6MB in the end (delta: 9.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 12:52:46,348 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.31ms. Allocated memory is still 83.9MB. Free memory was 54.1MB in the beginning and 54.1MB in the end (delta: 18.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.09ms. Allocated memory is still 83.9MB. Free memory was 55.2MB in the beginning and 37.1MB in the end (delta: 18.1MB). Peak memory consumption was 30.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.40ms. Allocated memory is still 83.9MB. Free memory was 37.1MB in the beginning and 34.3MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.74ms. Allocated memory is still 83.9MB. Free memory was 34.3MB in the beginning and 32.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 458.33ms. Allocated memory was 83.9MB in the beginning and 125.8MB in the end (delta: 41.9MB). Free memory was 32.3MB in the beginning and 90.3MB in the end (delta: -58.1MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4176.69ms. Allocated memory is still 125.8MB. Free memory was 89.4MB in the beginning and 46.7MB in the end (delta: 42.7MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 125.8MB. Free memory was 46.7MB in the beginning and 46.6MB in the end (delta: 9.8kB). 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 nearbyint 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(nearbyint(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, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 2789 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2118 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 509 IncrementalHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 671 mSDtfsCounter, 509 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred 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, 112 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 106 ConstructedInterpolants, 0 QuantifiedInterpolants, 281 SizeOfPredicates, 38 NumberOfNonLiveVariables, 364 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-05 12:52:46,360 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