./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 dbfc84775d165ba071925cc295d45b37e6e48fdc14a38c03379a9274950a3653 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:50:53,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:50:53,631 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:50:53,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:50:53,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:50:53,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:50:53,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:50:53,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:50:53,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:50:53,661 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:50:53,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:50:53,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:50:53,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:50:53,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:50:53,663 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:50:53,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:50:53,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:50:53,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:50:53,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:50:53,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:50:53,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:50:53,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:50:53,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:50:53,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:50:53,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:50:53,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:50:53,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:50:53,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:50:53,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:50:53,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:50:53,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:50:53,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:50:53,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:50:53,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:50:53,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:50:53,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:50:53,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:50:53,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:50:53,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:50:53,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:50:53,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:50:53,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:50:53,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:50:53,665 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/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 -> dbfc84775d165ba071925cc295d45b37e6e48fdc14a38c03379a9274950a3653 [2025-03-16 15:50:53,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:50:53,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:50:53,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:50:53,863 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:50:53,864 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:50:53,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i [2025-03-16 15:50:54,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4137a8d62/9123e0c8484d4b5bbac87a47ed080cc5/FLAGeeb46ae14 [2025-03-16 15:50:55,200 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:50:55,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i [2025-03-16 15:50:55,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4137a8d62/9123e0c8484d4b5bbac87a47ed080cc5/FLAGeeb46ae14 [2025-03-16 15:50:55,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4137a8d62/9123e0c8484d4b5bbac87a47ed080cc5 [2025-03-16 15:50:55,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:50:55,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:50:55,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:50:55,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:50:55,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:50:55,536 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:50:55" (1/1) ... [2025-03-16 15:50:55,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@632cfcad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:55, skipping insertion in model container [2025-03-16 15:50:55,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:50:55" (1/1) ... [2025-03-16 15:50:55,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:50:55,788 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.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-03-16 15:50:55,793 INFO L158 Benchmark]: Toolchain (without parser) took 260.90ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 115.6MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:50:55,793 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:50:55,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.42ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 115.6MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:50:55,794 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.42ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 115.6MB in the end (delta: 12.8MB). 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 dbfc84775d165ba071925cc295d45b37e6e48fdc14a38c03379a9274950a3653 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:50:57,335 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:50:57,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 15:50:57,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:50:57,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:50:57,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:50:57,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:50:57,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:50:57,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:50:57,437 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:50:57,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:50:57,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:50:57,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:50:57,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:50:57,438 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:50:57,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:50:57,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:50:57,438 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:50:57,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:50:57,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:50:57,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:50:57,439 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:50:57,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:50:57,439 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 15:50:57,439 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 15:50:57,439 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 15:50:57,439 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:50:57,439 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:50:57,439 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:50:57,439 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:50:57,439 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:50:57,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:50:57,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:50:57,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:50:57,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:50:57,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:50:57,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:50:57,441 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:50:57,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:50:57,441 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 15:50:57,441 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 15:50:57,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:50:57,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:50:57,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:50:57,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:50:57,441 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/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 -> dbfc84775d165ba071925cc295d45b37e6e48fdc14a38c03379a9274950a3653 [2025-03-16 15:50:57,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:50:57,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:50:57,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:50:57,669 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:50:57,669 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:50:57,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i [2025-03-16 15:50:58,832 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83513ab5/026ab85de9d84072beada8f5ad4b4128/FLAG4529e9d5f [2025-03-16 15:50:59,088 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:50:59,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i [2025-03-16 15:50:59,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83513ab5/026ab85de9d84072beada8f5ad4b4128/FLAG4529e9d5f [2025-03-16 15:50:59,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e83513ab5/026ab85de9d84072beada8f5ad4b4128 [2025-03-16 15:50:59,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:50:59,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:50:59,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:50:59,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:50:59,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:50:59,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:50:59" (1/1) ... [2025-03-16 15:50:59,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1358a8a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59, skipping insertion in model container [2025-03-16 15:50:59,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:50:59" (1/1) ... [2025-03-16 15:50:59,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:50:59,751 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i[42829,42842] [2025-03-16 15:50:59,754 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i[42946,42959] [2025-03-16 15:50:59,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:50:59,772 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:50:59,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma STDC FENV_ACCESS OFF [1095] [2025-03-16 15:50:59,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i[42829,42842] [2025-03-16 15:50:59,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i[42946,42959] [2025-03-16 15:50:59,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:50:59,878 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:50:59,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59 WrapperNode [2025-03-16 15:50:59,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:50:59,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:50:59,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:50:59,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:50:59,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59" (1/1) ... [2025-03-16 15:50:59,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59" (1/1) ... [2025-03-16 15:50:59,907 INFO L138 Inliner]: procedures = 461, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2025-03-16 15:50:59,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:50:59,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:50:59,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:50:59,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:50:59,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59" (1/1) ... [2025-03-16 15:50:59,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59" (1/1) ... [2025-03-16 15:50:59,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59" (1/1) ... [2025-03-16 15:50:59,920 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:50:59,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59" (1/1) ... [2025-03-16 15:50:59,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59" (1/1) ... [2025-03-16 15:50:59,924 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59" (1/1) ... [2025-03-16 15:50:59,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59" (1/1) ... [2025-03-16 15:50:59,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59" (1/1) ... [2025-03-16 15:50:59,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59" (1/1) ... [2025-03-16 15:50:59,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:50:59,928 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:50:59,928 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:50:59,928 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:50:59,929 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59" (1/1) ... [2025-03-16 15:50:59,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:50:59,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:50:59,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:50:59,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:50:59,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 15:50:59,968 INFO L130 BoogieDeclarations]: Found specification of procedure roundingTest [2025-03-16 15:50:59,968 INFO L138 BoogieDeclarations]: Found implementation of procedure roundingTest [2025-03-16 15:50:59,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:50:59,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:50:59,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:50:59,968 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 15:50:59,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 15:50:59,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2025-03-16 15:50:59,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2025-03-16 15:51:00,053 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:51:00,054 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:51:00,231 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-16 15:51:00,231 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:51:00,237 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:51:00,237 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:51:00,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:51:00 BoogieIcfgContainer [2025-03-16 15:51:00,237 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:51:00,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:51:00,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:51:00,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:51:00,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:50:59" (1/3) ... [2025-03-16 15:51:00,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c46de6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:51:00, skipping insertion in model container [2025-03-16 15:51:00,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:50:59" (2/3) ... [2025-03-16 15:51:00,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c46de6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:51:00, skipping insertion in model container [2025-03-16 15:51:00,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:51:00" (3/3) ... [2025-03-16 15:51:00,243 INFO L128 eAbstractionObserver]: Analyzing ICFG float-rounding1.i [2025-03-16 15:51:00,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:51:00,254 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG float-rounding1.i that has 4 procedures, 32 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-16 15:51:00,281 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:51:00,288 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;@72d0e287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:51:00,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 15:51:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 22 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-16 15:51:00,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 15:51:00,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:00,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:00,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:00,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1429039871, now seen corresponding path program 1 times [2025-03-16 15:51:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 15:51:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35113722] [2025-03-16 15:51:00,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:51:00,309 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-03-16 15:51:00,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 15:51:00,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 15:51:00,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-16 15:51:00,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 15:51:00,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 15:51:00,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:51:00,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:00,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:51:00,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:51:00,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:51:00,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:51:00,411 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 15:51:00,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35113722] [2025-03-16 15:51:00,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35113722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:51:00,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:51:00,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:51:00,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395988610] [2025-03-16 15:51:00,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:51:00,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:51:00,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 15:51:00,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:51:00,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:51:00,429 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 22 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-03-16 15:51:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:51:00,455 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2025-03-16 15:51:00,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:51:00,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 10 [2025-03-16 15:51:00,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:51:00,461 INFO L225 Difference]: With dead ends: 64 [2025-03-16 15:51:00,461 INFO L226 Difference]: Without dead ends: 29 [2025-03-16 15:51:00,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-03-16 15:51:00,465 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:51:00,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:51:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-16 15:51:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-16 15:51:00,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-16 15:51:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-03-16 15:51:00,490 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 10 [2025-03-16 15:51:00,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:51:00,491 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-03-16 15:51:00,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-03-16 15:51:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-03-16 15:51:00,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 15:51:00,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:00,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:00,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-16 15:51:00,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 15:51:00,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:00,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1261894793, now seen corresponding path program 1 times [2025-03-16 15:51:00,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 15:51:00,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727896478] [2025-03-16 15:51:00,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:51:00,694 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-03-16 15:51:00,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 15:51:00,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 15:51:00,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-16 15:51:00,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 15:51:00,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 15:51:00,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:51:00,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:00,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 15:51:00,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:51:00,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:51:00,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:51:00,997 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 15:51:00,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727896478] [2025-03-16 15:51:00,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727896478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:51:00,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:51:00,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 15:51:00,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683654124] [2025-03-16 15:51:00,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:51:00,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 15:51:00,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 15:51:00,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 15:51:00,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:51:00,998 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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-03-16 15:51:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:51:02,019 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2025-03-16 15:51:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 15:51:02,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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 11 [2025-03-16 15:51:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:51:02,022 INFO L225 Difference]: With dead ends: 80 [2025-03-16 15:51:02,022 INFO L226 Difference]: Without dead ends: 74 [2025-03-16 15:51:02,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-16 15:51:02,023 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 55 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:51:02,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 141 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:51:02,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-16 15:51:02,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2025-03-16 15:51:02,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.275) internal successors, (51), 41 states have internal predecessors, (51), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (20), 13 states have call predecessors, (20), 12 states have call successors, (20) [2025-03-16 15:51:02,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2025-03-16 15:51:02,038 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 11 [2025-03-16 15:51:02,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:51:02,038 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2025-03-16 15:51:02,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 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-03-16 15:51:02,038 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2025-03-16 15:51:02,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 15:51:02,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:02,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:02,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-16 15:51:02,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 15:51:02,239 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:02,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:02,240 INFO L85 PathProgramCache]: Analyzing trace with hash -527901668, now seen corresponding path program 1 times [2025-03-16 15:51:02,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 15:51:02,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772163496] [2025-03-16 15:51:02,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:51:02,240 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-03-16 15:51:02,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 15:51:02,243 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 15:51:02,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-16 15:51:02,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 15:51:02,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 15:51:02,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:51:02,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:02,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:51:02,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:51:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:51:02,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:51:02,297 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 15:51:02,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772163496] [2025-03-16 15:51:02,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772163496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:51:02,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:51:02,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:51:02,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667105447] [2025-03-16 15:51:02,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:51:02,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:51:02,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 15:51:02,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:51:02,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:51:02,298 INFO L87 Difference]: Start difference. First operand 62 states and 85 transitions. 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-03-16 15:51:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:51:02,321 INFO L93 Difference]: Finished difference Result 118 states and 160 transitions. [2025-03-16 15:51:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:51:02,322 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-03-16 15:51:02,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:51:02,322 INFO L225 Difference]: With dead ends: 118 [2025-03-16 15:51:02,323 INFO L226 Difference]: Without dead ends: 58 [2025-03-16 15:51:02,323 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-03-16 15:51:02,324 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:51:02,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:51:02,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-16 15:51:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-16 15:51:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.162162162162162) internal successors, (43), 38 states have internal predecessors, (43), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-16 15:51:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-03-16 15:51:02,337 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 12 [2025-03-16 15:51:02,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:51:02,338 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-03-16 15:51:02,338 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-03-16 15:51:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-03-16 15:51:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-16 15:51:02,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:02,338 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:02,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-16 15:51:02,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 15:51:02,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:02,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:02,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1370356374, now seen corresponding path program 1 times [2025-03-16 15:51:02,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 15:51:02,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354274537] [2025-03-16 15:51:02,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:51:02,540 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-03-16 15:51:02,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 15:51:02,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 15:51:02,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-16 15:51:02,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-16 15:51:02,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-16 15:51:02,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:51:02,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:02,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:51:02,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:51:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 15:51:02,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:51:02,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 15:51:02,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354274537] [2025-03-16 15:51:02,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354274537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:51:02,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:51:02,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:51:02,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112355349] [2025-03-16 15:51:02,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:51:02,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:51:02,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 15:51:02,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:51:02,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:51:02,618 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 15:51:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:51:02,632 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2025-03-16 15:51:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:51:02,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-16 15:51:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:51:02,633 INFO L225 Difference]: With dead ends: 95 [2025-03-16 15:51:02,633 INFO L226 Difference]: Without dead ends: 58 [2025-03-16 15:51:02,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-03-16 15:51:02,634 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 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-03-16 15:51:02,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:51:02,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-16 15:51:02,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-16 15:51:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-16 15:51:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2025-03-16 15:51:02,641 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 19 [2025-03-16 15:51:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:51:02,641 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2025-03-16 15:51:02,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 15:51:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2025-03-16 15:51:02,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 15:51:02,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:02,643 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:02,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-16 15:51:02,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 15:51:02,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:02,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:02,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2018061170, now seen corresponding path program 1 times [2025-03-16 15:51:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 15:51:02,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687153068] [2025-03-16 15:51:02,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:51:02,845 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-03-16 15:51:02,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 15:51:02,846 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 15:51:02,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-16 15:51:02,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 15:51:02,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 15:51:02,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:51:02,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:02,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 15:51:02,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:51:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 15:51:03,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:51:03,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 15:51:03,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687153068] [2025-03-16 15:51:03,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687153068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:51:03,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:51:03,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 15:51:03,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881443673] [2025-03-16 15:51:03,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:51:03,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 15:51:03,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 15:51:03,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 15:51:03,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:51:03,114 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 15:51:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:51:03,748 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2025-03-16 15:51:03,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 15:51:03,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-16 15:51:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:51:03,749 INFO L225 Difference]: With dead ends: 66 [2025-03-16 15:51:03,749 INFO L226 Difference]: Without dead ends: 64 [2025-03-16 15:51:03,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-16 15:51:03,750 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 28 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:51:03,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 146 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:51:03,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-16 15:51:03,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2025-03-16 15:51:03,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (13), 11 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-16 15:51:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2025-03-16 15:51:03,756 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 20 [2025-03-16 15:51:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:51:03,756 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-03-16 15:51:03,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 15:51:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2025-03-16 15:51:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 15:51:03,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:03,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:03,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-16 15:51:03,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 15:51:03,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:03,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash 2046690321, now seen corresponding path program 1 times [2025-03-16 15:51:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 15:51:03,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184675788] [2025-03-16 15:51:03,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:51:03,959 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-03-16 15:51:03,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 15:51:03,960 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 15:51:03,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-16 15:51:03,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 15:51:04,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 15:51:04,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:51:04,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:04,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:51:04,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:51:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 15:51:04,021 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:51:04,021 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 15:51:04,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184675788] [2025-03-16 15:51:04,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184675788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:51:04,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:51:04,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:51:04,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620957730] [2025-03-16 15:51:04,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:51:04,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:51:04,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 15:51:04,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:51:04,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:51:04,022 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 15:51:04,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:51:04,039 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2025-03-16 15:51:04,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:51:04,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-16 15:51:04,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:51:04,040 INFO L225 Difference]: With dead ends: 81 [2025-03-16 15:51:04,040 INFO L226 Difference]: Without dead ends: 42 [2025-03-16 15:51:04,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-03-16 15:51:04,041 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:51:04,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:51:04,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-16 15:51:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2025-03-16 15:51:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-16 15:51:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2025-03-16 15:51:04,046 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 20 [2025-03-16 15:51:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:51:04,046 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2025-03-16 15:51:04,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-16 15:51:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2025-03-16 15:51:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 15:51:04,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:04,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:04,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-16 15:51:04,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 15:51:04,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:04,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash 355748299, now seen corresponding path program 1 times [2025-03-16 15:51:04,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 15:51:04,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047828516] [2025-03-16 15:51:04,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:51:04,248 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-03-16 15:51:04,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 15:51:04,250 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 15:51:04,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-16 15:51:04,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 15:51:04,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 15:51:04,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:51:04,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:04,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 15:51:04,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:51:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 15:51:05,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:51:05,283 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 15:51:05,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047828516] [2025-03-16 15:51:05,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047828516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:51:05,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:51:05,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 15:51:05,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923790986] [2025-03-16 15:51:05,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:51:05,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 15:51:05,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 15:51:05,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 15:51:05,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 15:51:05,285 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 11 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 15:51:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:51:06,805 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2025-03-16 15:51:06,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 15:51:06,805 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2025-03-16 15:51:06,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:51:06,806 INFO L225 Difference]: With dead ends: 42 [2025-03-16 15:51:06,806 INFO L226 Difference]: Without dead ends: 40 [2025-03-16 15:51:06,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-16 15:51:06,807 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 18 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:51:06,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 169 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:51:06,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-16 15:51:06,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-16 15:51:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-16 15:51:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-03-16 15:51:06,811 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 42 [2025-03-16 15:51:06,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:51:06,811 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-03-16 15:51:06,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 15:51:06,811 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-03-16 15:51:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 15:51:06,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:51:06,812 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:06,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-16 15:51:07,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 15:51:07,013 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:51:07,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:51:07,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1656372322, now seen corresponding path program 1 times [2025-03-16 15:51:07,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 15:51:07,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123730613] [2025-03-16 15:51:07,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:51:07,014 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-03-16 15:51:07,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 15:51:07,015 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 15:51:07,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-16 15:51:07,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 15:51:07,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 15:51:07,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:51:07,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:51:07,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 15:51:07,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:51:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 15:51:08,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:51:08,211 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 15:51:08,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123730613] [2025-03-16 15:51:08,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123730613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:51:08,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:51:08,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 15:51:08,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77303358] [2025-03-16 15:51:08,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:51:08,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 15:51:08,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 15:51:08,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 15:51:08,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-16 15:51:08,212 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 15:51:09,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:51:09,853 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2025-03-16 15:51:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 15:51:09,853 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 51 [2025-03-16 15:51:09,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:51:09,853 INFO L225 Difference]: With dead ends: 40 [2025-03-16 15:51:09,853 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:51:09,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-16 15:51:09,854 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:51:09,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 219 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:51:09,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:51:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:51:09,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:51:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:51:09,855 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2025-03-16 15:51:09,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:51:09,855 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:51:09,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 15:51:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:51:09,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:51:09,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-16 15:51:09,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-16 15:51:09,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-16 15:51:10,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 15:51:10,059 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:51:10,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:51:11,487 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:51:11,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:51:11 BoogieIcfgContainer [2025-03-16 15:51:11,491 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:51:11,491 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:51:11,491 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:51:11,491 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:51:11,492 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:51:00" (3/4) ... [2025-03-16 15:51:11,493 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:51:11,497 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2025-03-16 15:51:11,497 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-16 15:51:11,497 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure roundingTest [2025-03-16 15:51:11,499 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-16 15:51:11,500 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-16 15:51:11,500 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-16 15:51:11,500 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-16 15:51:11,544 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:51:11,544 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:51:11,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:51:11,544 INFO L158 Benchmark]: Toolchain (without parser) took 12141.09ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 80.6MB in the end (delta: 11.2MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2025-03-16 15:51:11,545 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 83.9MB. Free memory is still 62.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:51:11,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.64ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 46.0MB in the end (delta: 45.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 15:51:11,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.55ms. Allocated memory is still 117.4MB. Free memory was 45.8MB in the beginning and 43.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:51:11,545 INFO L158 Benchmark]: Boogie Preprocessor took 19.57ms. Allocated memory is still 117.4MB. Free memory was 43.6MB in the beginning and 42.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:51:11,545 INFO L158 Benchmark]: IcfgBuilder took 309.35ms. Allocated memory is still 117.4MB. Free memory was 42.2MB in the beginning and 82.7MB in the end (delta: -40.5MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2025-03-16 15:51:11,545 INFO L158 Benchmark]: TraceAbstraction took 11252.19ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 85.6MB in the end (delta: -3.7MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2025-03-16 15:51:11,546 INFO L158 Benchmark]: Witness Printer took 52.70ms. Allocated memory is still 117.4MB. Free memory was 85.6MB in the beginning and 80.6MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:51:11,547 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.13ms. Allocated memory is still 83.9MB. Free memory is still 62.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 474.64ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 46.0MB in the end (delta: 45.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.55ms. Allocated memory is still 117.4MB. Free memory was 45.8MB in the beginning and 43.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.57ms. Allocated memory is still 117.4MB. Free memory was 43.6MB in the beginning and 42.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 309.35ms. Allocated memory is still 117.4MB. Free memory was 42.2MB in the beginning and 82.7MB in the end (delta: -40.5MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11252.19ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 85.6MB in the end (delta: -3.7MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. * Witness Printer took 52.70ms. Allocated memory is still 117.4MB. Free memory was 85.6MB in the beginning and 80.6MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 1095]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma STDC FENV_ACCESS OFF [1095] * 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 - PositiveResult [Line: 1110]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1103]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 47 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 124 mSDsluCounter, 906 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 656 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 452 IncrementalHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 250 mSDtfsCounter, 452 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=2, InterpolantAutomatonStates: 54, 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, 22 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 177 ConstructedInterpolants, 26 QuantifiedInterpolants, 778 SizeOfPredicates, 20 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 69/69 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-16 15:51:11,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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: TRUE