./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 02:42:45,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:42:45,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:42:45,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:42:45,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:42:45,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:42:45,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:42:45,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:42:45,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:42:45,574 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:42:45,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:42:45,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:42:45,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:42:45,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:42:45,575 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:42:45,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:42:45,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:42:45,575 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:42:45,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:42:45,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:42:45,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:42:45,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:42:45,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:42:45,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:42:45,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:42:45,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:42:45,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:42:45,577 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-08 02:42:45,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:42:45,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:42:45,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:42:45,781 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:42:45,781 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:42:45,782 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-08 02:42:46,886 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6439a8908/3fd362edaf494624aa6b4380a1e11cd0/FLAGf7e918b88 [2025-03-08 02:42:47,151 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:42:47,152 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i [2025-03-08 02:42:47,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6439a8908/3fd362edaf494624aa6b4380a1e11cd0/FLAGf7e918b88 [2025-03-08 02:42:47,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6439a8908/3fd362edaf494624aa6b4380a1e11cd0 [2025-03-08 02:42:47,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:42:47,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:42:47,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:42:47,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:42:47,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:42:47,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:42:47" (1/1) ... [2025-03-08 02:42:47,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bc8c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:47, skipping insertion in model container [2025-03-08 02:42:47,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:42:47" (1/1) ... [2025-03-08 02:42:47,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:42:47,848 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-08 02:42:47,854 INFO L158 Benchmark]: Toolchain (without parser) took 396.76ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.4MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 02:42:47,855 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:42:47,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.87ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.4MB in the end (delta: 12.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 02:42:47,856 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.14ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.87ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 93.4MB in the end (delta: 12.9MB). 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-?-e2fb8be-m [2025-03-08 02:42:49,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:42:49,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 02:42:49,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:42:49,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:42:49,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:42:49,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:42:49,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:42:49,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:42:49,471 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:42:49,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:42:49,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:42:49,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:42:49,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:42:49,472 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:42:49,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:42:49,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:42:49,473 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:42:49,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:42:49,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:42:49,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:42:49,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:42:49,473 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:42:49,474 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 02:42:49,474 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 02:42:49,474 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 02:42:49,474 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:42:49,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:42:49,474 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:42:49,474 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:42:49,474 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:42:49,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:42:49,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:42:49,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:42:49,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:42:49,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:42:49,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:42:49,475 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:42:49,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:42:49,475 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 02:42:49,475 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 02:42:49,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:42:49,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:42:49,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:42:49,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:42:49,476 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-08 02:42:49,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:42:49,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:42:49,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:42:49,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:42:49,718 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:42:49,719 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-08 02:42:50,892 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9490c5db3/298a4fbbd96a4f0f9737a60ec41066ec/FLAG2505f297c [2025-03-08 02:42:51,064 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:42:51,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float-rounding1.i [2025-03-08 02:42:51,081 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9490c5db3/298a4fbbd96a4f0f9737a60ec41066ec/FLAG2505f297c [2025-03-08 02:42:51,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9490c5db3/298a4fbbd96a4f0f9737a60ec41066ec [2025-03-08 02:42:51,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:42:51,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:42:51,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:42:51,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:42:51,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:42:51,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:42:51" (1/1) ... [2025-03-08 02:42:51,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2924b362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51, skipping insertion in model container [2025-03-08 02:42:51,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:42:51" (1/1) ... [2025-03-08 02:42:51,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:42:51,733 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-08 02:42:51,735 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-08 02:42:51,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:42:51,747 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:42:51,753 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma STDC FENV_ACCESS OFF [1095] [2025-03-08 02:42:51,774 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-08 02:42:51,774 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-08 02:42:51,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:42:51,850 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:42:51,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51 WrapperNode [2025-03-08 02:42:51,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:42:51,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:42:51,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:42:51,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:42:51,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51" (1/1) ... [2025-03-08 02:42:51,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51" (1/1) ... [2025-03-08 02:42:51,881 INFO L138 Inliner]: procedures = 461, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2025-03-08 02:42:51,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:42:51,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:42:51,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:42:51,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:42:51,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51" (1/1) ... [2025-03-08 02:42:51,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51" (1/1) ... [2025-03-08 02:42:51,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51" (1/1) ... [2025-03-08 02:42:51,898 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-08 02:42:51,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51" (1/1) ... [2025-03-08 02:42:51,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51" (1/1) ... [2025-03-08 02:42:51,902 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51" (1/1) ... [2025-03-08 02:42:51,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51" (1/1) ... [2025-03-08 02:42:51,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51" (1/1) ... [2025-03-08 02:42:51,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51" (1/1) ... [2025-03-08 02:42:51,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:42:51,909 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:42:51,909 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:42:51,909 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:42:51,910 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51" (1/1) ... [2025-03-08 02:42:51,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:42:51,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:42:51,934 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-08 02:42:51,939 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-08 02:42:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 02:42:51,961 INFO L130 BoogieDeclarations]: Found specification of procedure roundingTest [2025-03-08 02:42:51,962 INFO L138 BoogieDeclarations]: Found implementation of procedure roundingTest [2025-03-08 02:42:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:42:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:42:51,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:42:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 02:42:51,962 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 02:42:51,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2025-03-08 02:42:51,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2025-03-08 02:42:52,042 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:42:52,043 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:42:52,230 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 02:42:52,231 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:42:52,237 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:42:52,237 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:42:52,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:42:52 BoogieIcfgContainer [2025-03-08 02:42:52,237 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:42:52,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:42:52,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:42:52,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:42:52,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:42:51" (1/3) ... [2025-03-08 02:42:52,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e3a2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:42:52, skipping insertion in model container [2025-03-08 02:42:52,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:42:51" (2/3) ... [2025-03-08 02:42:52,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e3a2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:42:52, skipping insertion in model container [2025-03-08 02:42:52,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:42:52" (3/3) ... [2025-03-08 02:42:52,247 INFO L128 eAbstractionObserver]: Analyzing ICFG float-rounding1.i [2025-03-08 02:42:52,259 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:42:52,261 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG float-rounding1.i that has 4 procedures, 34 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-08 02:42:52,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:42:52,307 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;@41191b4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:42:52,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 02:42:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 24 states have internal predecessors, (31), 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-08 02:42:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 02:42:52,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:42:52,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:42:52,315 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:42:52,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:42:52,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1144602736, now seen corresponding path program 1 times [2025-03-08 02:42:52,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:42:52,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748853913] [2025-03-08 02:42:52,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:42:52,327 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-08 02:42:52,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:42:52,329 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-08 02:42:52,330 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-08 02:42:52,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 02:42:52,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 02:42:52,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:42:52,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:42:52,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:42:52,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:42:52,427 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-08 02:42:52,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:42:52,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:42:52,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748853913] [2025-03-08 02:42:52,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748853913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:42:52,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:42:52,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:42:52,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226474795] [2025-03-08 02:42:52,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:42:52,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:42:52,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:42:52,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:42:52,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:42:52,448 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 24 states have internal predecessors, (31), 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.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 02:42:52,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:42:52,486 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2025-03-08 02:42:52,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:42:52,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-08 02:42:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:42:52,495 INFO L225 Difference]: With dead ends: 67 [2025-03-08 02:42:52,495 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 02:42:52,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:42:52,500 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 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-08 02:42:52,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:42:52,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 02:42:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-08 02:42:52,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 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-08 02:42:52,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-03-08 02:42:52,528 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2025-03-08 02:42:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:42:52,528 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-03-08 02:42:52,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 02:42:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-03-08 02:42:52,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 02:42:52,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:42:52,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:42:52,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:42:52,730 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-08 02:42:52,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:42:52,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:42:52,731 INFO L85 PathProgramCache]: Analyzing trace with hash 556792454, now seen corresponding path program 1 times [2025-03-08 02:42:52,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:42:52,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948011676] [2025-03-08 02:42:52,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:42:52,732 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-08 02:42:52,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:42:52,734 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-08 02:42:52,735 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-08 02:42:52,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 02:42:52,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 02:42:52,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:42:52,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:42:52,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 02:42:52,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:42:53,049 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-08 02:42:53,049 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:42:53,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:42:53,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948011676] [2025-03-08 02:42:53,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948011676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:42:53,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:42:53,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 02:42:53,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91662344] [2025-03-08 02:42:53,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:42:53,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 02:42:53,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:42:53,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 02:42:53,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:42:53,051 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 02:42:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:42:54,003 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2025-03-08 02:42:54,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 02:42:54,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-08 02:42:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:42:54,005 INFO L225 Difference]: With dead ends: 81 [2025-03-08 02:42:54,005 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 02:42:54,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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-08 02:42:54,006 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 61 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:42:54,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 128 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:42:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 02:42:54,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2025-03-08 02:42:54,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 42 states have internal predecessors, (52), 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-08 02:42:54,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2025-03-08 02:42:54,016 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 12 [2025-03-08 02:42:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:42:54,017 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-03-08 02:42:54,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 02:42:54,017 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2025-03-08 02:42:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 02:42:54,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:42:54,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:42:54,021 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 (3)] Ended with exit code 0 [2025-03-08 02:42:54,218 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-08 02:42:54,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:42:54,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:42:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash 14057581, now seen corresponding path program 1 times [2025-03-08 02:42:54,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:42:54,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009422274] [2025-03-08 02:42:54,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:42:54,219 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-08 02:42:54,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:42:54,221 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-08 02:42:54,222 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-08 02:42:54,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 02:42:54,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 02:42:54,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:42:54,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:42:54,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:42:54,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:42:54,271 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-08 02:42:54,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:42:54,274 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:42:54,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009422274] [2025-03-08 02:42:54,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009422274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:42:54,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:42:54,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:42:54,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319132379] [2025-03-08 02:42:54,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:42:54,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:42:54,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:42:54,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:42:54,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:42:54,275 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08 02:42:54,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:42:54,301 INFO L93 Difference]: Finished difference Result 119 states and 161 transitions. [2025-03-08 02:42:54,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:42:54,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 13 [2025-03-08 02:42:54,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:42:54,302 INFO L225 Difference]: With dead ends: 119 [2025-03-08 02:42:54,302 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 02:42:54,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-08 02:42:54,303 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 56 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-08 02:42:54,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 56 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:42:54,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 02:42:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 02:42:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 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-08 02:42:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2025-03-08 02:42:54,315 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 13 [2025-03-08 02:42:54,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:42:54,315 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2025-03-08 02:42:54,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08 02:42:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2025-03-08 02:42:54,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 02:42:54,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:42:54,316 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-08 02:42:54,319 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-08 02:42:54,516 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-08 02:42:54,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:42:54,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:42:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1355687067, now seen corresponding path program 1 times [2025-03-08 02:42:54,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:42:54,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746233031] [2025-03-08 02:42:54,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:42:54,517 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-08 02:42:54,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:42:54,519 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-08 02:42:54,520 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-08 02:42:54,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 02:42:54,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 02:42:54,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:42:54,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:42:54,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:42:54,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:42:54,596 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-08 02:42:54,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:42:54,596 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:42:54,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746233031] [2025-03-08 02:42:54,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746233031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:42:54,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:42:54,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:42:54,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792632514] [2025-03-08 02:42:54,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:42:54,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:42:54,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:42:54,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:42:54,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:42:54,597 INFO L87 Difference]: Start difference. First operand 59 states and 69 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-08 02:42:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:42:54,614 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2025-03-08 02:42:54,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:42:54,615 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-08 02:42:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:42:54,615 INFO L225 Difference]: With dead ends: 96 [2025-03-08 02:42:54,615 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 02:42:54,616 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-08 02:42:54,616 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 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-08 02:42:54,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:42:54,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 02:42:54,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 02:42:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 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-08 02:42:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2025-03-08 02:42:54,630 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 20 [2025-03-08 02:42:54,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:42:54,631 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2025-03-08 02:42:54,631 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-08 02:42:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2025-03-08 02:42:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 02:42:54,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:42:54,632 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:42:54,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-08 02:42:54,832 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-08 02:42:54,833 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:42:54,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:42:54,833 INFO L85 PathProgramCache]: Analyzing trace with hash -887677437, now seen corresponding path program 1 times [2025-03-08 02:42:54,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:42:54,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732287092] [2025-03-08 02:42:54,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:42:54,833 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-08 02:42:54,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:42:54,835 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-08 02:42:54,836 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-08 02:42:54,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 02:42:54,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 02:42:54,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:42:54,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:42:54,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 02:42:54,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:42:55,123 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-08 02:42:55,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:42:55,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:42:55,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732287092] [2025-03-08 02:42:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732287092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:42:55,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:42:55,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 02:42:55,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441404062] [2025-03-08 02:42:55,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:42:55,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 02:42:55,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:42:55,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 02:42:55,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:42:55,125 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-08 02:42:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:42:55,816 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2025-03-08 02:42:55,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 02:42:55,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 21 [2025-03-08 02:42:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:42:55,817 INFO L225 Difference]: With dead ends: 67 [2025-03-08 02:42:55,817 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 02:42:55,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 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-08 02:42:55,818 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 28 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:42:55,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 162 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:42:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 02:42:55,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2025-03-08 02:42:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 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-08 02:42:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2025-03-08 02:42:55,830 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 21 [2025-03-08 02:42:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:42:55,830 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2025-03-08 02:42:55,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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-08 02:42:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2025-03-08 02:42:55,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 02:42:55,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:42:55,832 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:42:55,836 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 (6)] Forceful destruction successful, exit code 0 [2025-03-08 02:42:56,032 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-08 02:42:56,033 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:42:56,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:42:56,033 INFO L85 PathProgramCache]: Analyzing trace with hash -859048286, now seen corresponding path program 1 times [2025-03-08 02:42:56,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:42:56,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746476158] [2025-03-08 02:42:56,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:42:56,033 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-08 02:42:56,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:42:56,035 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-08 02:42:56,036 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-08 02:42:56,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 02:42:56,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 02:42:56,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:42:56,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:42:56,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:42:56,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:42:56,096 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-08 02:42:56,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:42:56,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:42:56,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746476158] [2025-03-08 02:42:56,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746476158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:42:56,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:42:56,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:42:56,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117962391] [2025-03-08 02:42:56,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:42:56,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:42:56,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:42:56,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:42:56,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:42:56,099 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-08 02:42:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:42:56,119 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2025-03-08 02:42:56,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:42:56,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 21 [2025-03-08 02:42:56,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:42:56,122 INFO L225 Difference]: With dead ends: 82 [2025-03-08 02:42:56,122 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 02:42:56,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-08 02:42:56,123 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 53 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-08 02:42:56,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:42:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 02:42:56,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-03-08 02:42:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 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-08 02:42:56,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2025-03-08 02:42:56,130 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 21 [2025-03-08 02:42:56,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:42:56,131 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2025-03-08 02:42:56,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-08 02:42:56,131 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2025-03-08 02:42:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 02:42:56,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:42:56,132 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, 1] [2025-03-08 02:42:56,136 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-08 02:42:56,332 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-08 02:42:56,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:42:56,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:42:56,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1611623960, now seen corresponding path program 1 times [2025-03-08 02:42:56,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:42:56,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554578078] [2025-03-08 02:42:56,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:42:56,333 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-08 02:42:56,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:42:56,335 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-08 02:42:56,335 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-08 02:42:56,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-08 02:42:56,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 02:42:56,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:42:56,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:42:56,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 02:42:56,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:42:57,542 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-08 02:42:57,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:42:57,543 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:42:57,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554578078] [2025-03-08 02:42:57,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554578078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:42:57,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:42:57,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 02:42:57,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588697906] [2025-03-08 02:42:57,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:42:57,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 02:42:57,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:42:57,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 02:42:57,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 02:42:57,544 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 11 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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-08 02:42:59,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:42:59,305 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2025-03-08 02:42:59,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 02:42:59,310 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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 43 [2025-03-08 02:42:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:42:59,310 INFO L225 Difference]: With dead ends: 43 [2025-03-08 02:42:59,310 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 02:42:59,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-08 02:42:59,311 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:42:59,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 206 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:42:59,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 02:42:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2025-03-08 02:42:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.0) internal successors, (26), 26 states have internal predecessors, (26), 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-08 02:42:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-03-08 02:42:59,315 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 43 [2025-03-08 02:42:59,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:42:59,315 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-03-08 02:42:59,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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-08 02:42:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-03-08 02:42:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 02:42:59,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:42:59,316 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, 1] [2025-03-08 02:42:59,321 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-08 02:42:59,517 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-08 02:42:59,517 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION === [roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION, roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:42:59,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:42:59,518 INFO L85 PathProgramCache]: Analyzing trace with hash 650874545, now seen corresponding path program 1 times [2025-03-08 02:42:59,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 02:42:59,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914450567] [2025-03-08 02:42:59,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:42:59,518 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-08 02:42:59,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 02:42:59,520 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-08 02:42:59,521 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-08 02:42:59,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 02:42:59,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 02:42:59,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:42:59,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:42:59,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 02:42:59,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:43:00,751 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-08 02:43:00,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:43:00,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 02:43:00,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914450567] [2025-03-08 02:43:00,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914450567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:43:00,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:43:00,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 02:43:00,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199589506] [2025-03-08 02:43:00,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:43:00,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 02:43:00,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 02:43:00,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 02:43:00,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 02:43:00,753 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 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-08 02:43:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:43:03,042 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-03-08 02:43:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 02:43:03,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 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 52 [2025-03-08 02:43:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:43:03,043 INFO L225 Difference]: With dead ends: 41 [2025-03-08 02:43:03,043 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 02:43:03,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-08 02:43:03,043 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 15 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:43:03,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 186 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:43:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 02:43:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 02:43:03,046 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-08 02:43:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 02:43:03,046 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2025-03-08 02:43:03,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:43:03,046 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 02:43:03,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 7 states have internal predecessors, (26), 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-08 02:43:03,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 02:43:03,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 02:43:03,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location roundingTestErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2025-03-08 02:43:03,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location roundingTestErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2025-03-08 02:43:03,053 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-08 02:43:03,249 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-08 02:43:03,251 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:43:03,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 02:43:04,689 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 02:43:04,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:43:04 BoogieIcfgContainer [2025-03-08 02:43:04,692 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 02:43:04,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 02:43:04,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 02:43:04,693 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 02:43:04,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:42:52" (3/4) ... [2025-03-08 02:43:04,695 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 02:43:04,698 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2025-03-08 02:43:04,699 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-08 02:43:04,699 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure roundingTest [2025-03-08 02:43:04,701 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-08 02:43:04,701 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-03-08 02:43:04,701 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 02:43:04,701 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 02:43:04,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 02:43:04,747 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 02:43:04,747 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 02:43:04,747 INFO L158 Benchmark]: Toolchain (without parser) took 13311.29ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 80.9MB in the end (delta: 9.7MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2025-03-08 02:43:04,747 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 83.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:43:04,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.57ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 43.0MB in the end (delta: 47.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 02:43:04,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.19ms. Allocated memory is still 117.4MB. Free memory was 43.0MB in the beginning and 41.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:43:04,748 INFO L158 Benchmark]: Boogie Preprocessor took 25.75ms. Allocated memory is still 117.4MB. Free memory was 40.8MB in the beginning and 39.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:43:04,748 INFO L158 Benchmark]: IcfgBuilder took 328.69ms. Allocated memory is still 117.4MB. Free memory was 39.4MB in the beginning and 80.8MB in the end (delta: -41.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2025-03-08 02:43:04,748 INFO L158 Benchmark]: TraceAbstraction took 12453.54ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 84.9MB in the end (delta: -4.8MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2025-03-08 02:43:04,748 INFO L158 Benchmark]: Witness Printer took 53.76ms. Allocated memory is still 117.4MB. Free memory was 84.9MB in the beginning and 80.9MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 02:43:04,749 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.35ms. Allocated memory is still 83.9MB. Free memory is still 62.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.57ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 43.0MB in the end (delta: 47.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.19ms. Allocated memory is still 117.4MB. Free memory was 43.0MB in the beginning and 41.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.75ms. Allocated memory is still 117.4MB. Free memory was 40.8MB in the beginning and 39.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 328.69ms. Allocated memory is still 117.4MB. Free memory was 39.4MB in the beginning and 80.8MB in the end (delta: -41.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12453.54ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 84.9MB in the end (delta: -4.8MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * Witness Printer took 53.76ms. Allocated memory is still 117.4MB. Free memory was 84.9MB in the beginning and 80.9MB in the end (delta: 3.9MB). 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, 34 locations, 49 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 923 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 666 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 449 IncrementalHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 257 mSDtfsCounter, 449 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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.9s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 185 ConstructedInterpolants, 26 QuantifiedInterpolants, 786 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-08 02:43:04,827 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