./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/neural-networks/softmax_11_safe.c-amalgamation.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/neural-networks/softmax_11_safe.c-amalgamation.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 06079ef6845cb4e1d4583c8af78d2f925187490fb0cd250b6d7743c55f841983 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 19:48:26,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 19:48:26,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 19:48:26,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 19:48:26,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 19:48:26,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 19:48:26,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 19:48:26,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 19:48:26,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 19:48:26,961 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 19:48:26,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 19:48:26,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 19:48:26,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 19:48:26,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 19:48:26,963 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 19:48:26,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 19:48:26,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 19:48:26,963 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 19:48:26,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 19:48:26,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 19:48:26,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 19:48:26,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 19:48:26,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 19:48:26,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 19:48:26,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 19:48:26,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 19:48:26,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 19:48:26,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 19:48:26,964 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 19:48:26,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 19:48:26,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 19:48:26,964 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 19:48:26,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 19:48:26,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 19:48:26,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 19:48:26,965 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 19:48:26,965 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 19:48:26,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 19:48:26,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 19:48:26,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 19:48:26,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 19:48:26,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 19:48:26,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 19:48:26,966 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 06079ef6845cb4e1d4583c8af78d2f925187490fb0cd250b6d7743c55f841983 [2025-02-07 19:48:27,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 19:48:27,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 19:48:27,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 19:48:27,245 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 19:48:27,245 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 19:48:27,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/neural-networks/softmax_11_safe.c-amalgamation.i [2025-02-07 19:48:28,559 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c185127c/b1b7f8c312f14ff0b2dc03eef5df1452/FLAG6f1a8cd37 [2025-02-07 19:48:28,974 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 19:48:28,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_11_safe.c-amalgamation.i [2025-02-07 19:48:28,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c185127c/b1b7f8c312f14ff0b2dc03eef5df1452/FLAG6f1a8cd37 [2025-02-07 19:48:29,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c185127c/b1b7f8c312f14ff0b2dc03eef5df1452 [2025-02-07 19:48:29,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 19:48:29,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 19:48:29,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 19:48:29,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 19:48:29,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 19:48:29,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:48:29" (1/1) ... [2025-02-07 19:48:29,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49efd45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:29, skipping insertion in model container [2025-02-07 19:48:29,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:48:29" (1/1) ... [2025-02-07 19:48:29,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 19:48:29,742 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:629) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:3127) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.lambda$150(StandardFunctionHandler.java:621) 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:2628) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:790) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:286) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2628) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2628) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1808) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:233) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java:1195) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1178) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:236) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:392) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1685) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:159) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3589) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2572) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:649) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:189) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:116) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-02-07 19:48:29,750 INFO L158 Benchmark]: Toolchain (without parser) took 732.69ms. Allocated memory is still 201.3MB. Free memory was 156.5MB in the beginning and 141.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 19:48:29,750 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 201.3MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 19:48:29,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 730.22ms. Allocated memory is still 201.3MB. Free memory was 156.5MB in the beginning and 141.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 19:48:29,753 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.61ms. Allocated memory is still 201.3MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 730.22ms. Allocated memory is still 201.3MB. Free memory was 156.5MB in the beginning and 141.4MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: isnan: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:629) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/neural-networks/softmax_11_safe.c-amalgamation.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 06079ef6845cb4e1d4583c8af78d2f925187490fb0cd250b6d7743c55f841983 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 19:48:31,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 19:48:31,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-07 19:48:31,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 19:48:31,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 19:48:31,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 19:48:31,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 19:48:31,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 19:48:31,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 19:48:31,997 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 19:48:31,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 19:48:31,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 19:48:31,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 19:48:31,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 19:48:31,999 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 19:48:31,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 19:48:31,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 19:48:31,999 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 19:48:31,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 19:48:32,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 19:48:32,000 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 19:48:32,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 19:48:32,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 19:48:32,000 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 19:48:32,000 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 19:48:32,000 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 19:48:32,000 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 19:48:32,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 19:48:32,001 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 19:48:32,001 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 19:48:32,001 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 19:48:32,001 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 19:48:32,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 19:48:32,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 19:48:32,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 19:48:32,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 19:48:32,002 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 19:48:32,002 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 19:48:32,002 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 19:48:32,003 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 19:48:32,003 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 19:48:32,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 19:48:32,003 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 19:48:32,003 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 19:48:32,003 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 19:48:32,004 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 06079ef6845cb4e1d4583c8af78d2f925187490fb0cd250b6d7743c55f841983 [2025-02-07 19:48:32,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 19:48:32,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 19:48:32,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 19:48:32,295 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 19:48:32,296 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 19:48:32,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/neural-networks/softmax_11_safe.c-amalgamation.i [2025-02-07 19:48:33,581 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9de545370/5c15f978435846829e15f518cca420f6/FLAG58d28b7d4 [2025-02-07 19:48:33,847 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 19:48:33,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_11_safe.c-amalgamation.i [2025-02-07 19:48:33,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9de545370/5c15f978435846829e15f518cca420f6/FLAG58d28b7d4 [2025-02-07 19:48:34,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9de545370/5c15f978435846829e15f518cca420f6 [2025-02-07 19:48:34,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 19:48:34,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 19:48:34,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 19:48:34,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 19:48:34,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 19:48:34,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:48:34" (1/1) ... [2025-02-07 19:48:34,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40527d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34, skipping insertion in model container [2025-02-07 19:48:34,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:48:34" (1/1) ... [2025-02-07 19:48:34,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 19:48:34,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_11_safe.c-amalgamation.i[63382,63395] [2025-02-07 19:48:34,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 19:48:34,651 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 19:48:34,706 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/neural-networks/softmax_11_safe.c-amalgamation.i[63382,63395] [2025-02-07 19:48:34,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 19:48:34,902 INFO L204 MainTranslator]: Completed translation [2025-02-07 19:48:34,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34 WrapperNode [2025-02-07 19:48:34,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 19:48:34,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 19:48:34,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 19:48:34,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 19:48:34,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34" (1/1) ... [2025-02-07 19:48:34,934 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34" (1/1) ... [2025-02-07 19:48:34,955 INFO L138 Inliner]: procedures = 562, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2025-02-07 19:48:34,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 19:48:34,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 19:48:34,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 19:48:34,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 19:48:34,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34" (1/1) ... [2025-02-07 19:48:34,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34" (1/1) ... [2025-02-07 19:48:34,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34" (1/1) ... [2025-02-07 19:48:34,991 INFO L175 MemorySlicer]: Split 24 memory accesses to 4 slices as follows [2, 7, 10, 5]. 42 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 6 writes are split as follows [0, 0, 4, 2]. [2025-02-07 19:48:34,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34" (1/1) ... [2025-02-07 19:48:34,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34" (1/1) ... [2025-02-07 19:48:35,006 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34" (1/1) ... [2025-02-07 19:48:35,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34" (1/1) ... [2025-02-07 19:48:35,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34" (1/1) ... [2025-02-07 19:48:35,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34" (1/1) ... [2025-02-07 19:48:35,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 19:48:35,015 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 19:48:35,015 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 19:48:35,016 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 19:48:35,017 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34" (1/1) ... [2025-02-07 19:48:35,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 19:48:35,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 19:48:35,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 19:48:35,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 19:48:35,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-07 19:48:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-07 19:48:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-07 19:48:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-07 19:48:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 19:48:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 19:48:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-07 19:48:35,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-07 19:48:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-07 19:48:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 19:48:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 19:48:35,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 19:48:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-07 19:48:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-07 19:48:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-07 19:48:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-07 19:48:35,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 19:48:35,178 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 19:48:35,179 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 19:48:36,270 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L863: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset; [2025-02-07 19:48:36,277 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-07 19:48:36,277 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 19:48:36,284 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 19:48:36,286 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 19:48:36,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 07:48:36 BoogieIcfgContainer [2025-02-07 19:48:36,287 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 19:48:36,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 19:48:36,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 19:48:36,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 19:48:36,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:48:34" (1/3) ... [2025-02-07 19:48:36,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8e3256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:48:36, skipping insertion in model container [2025-02-07 19:48:36,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:48:34" (2/3) ... [2025-02-07 19:48:36,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8e3256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:48:36, skipping insertion in model container [2025-02-07 19:48:36,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 07:48:36" (3/3) ... [2025-02-07 19:48:36,296 INFO L128 eAbstractionObserver]: Analyzing ICFG softmax_11_safe.c-amalgamation.i [2025-02-07 19:48:36,308 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 19:48:36,310 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG softmax_11_safe.c-amalgamation.i that has 1 procedures, 15 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-07 19:48:36,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 19:48:36,360 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;@7d0b1b35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 19:48:36,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 19:48:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 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-02-07 19:48:36,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 19:48:36,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 19:48:36,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 19:48:36,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 19:48:36,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 19:48:36,372 INFO L85 PathProgramCache]: Analyzing trace with hash -2017705449, now seen corresponding path program 1 times [2025-02-07 19:48:36,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 19:48:36,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954095133] [2025-02-07 19:48:36,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 19:48:36,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 19:48:36,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 19:48:36,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 19:48:36,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-07 19:48:36,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 19:48:36,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 19:48:36,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 19:48:36,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 19:48:36,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-07 19:48:36,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 19:48:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 19:48:36,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 19:48:36,578 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 19:48:36,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954095133] [2025-02-07 19:48:36,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954095133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 19:48:36,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 19:48:36,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 19:48:36,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909376789] [2025-02-07 19:48:36,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 19:48:36,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 19:48:36,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 19:48:36,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 19:48:36,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 19:48:36,607 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-02-07 19:48:36,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 19:48:36,618 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2025-02-07 19:48:36,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 19:48:36,620 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2025-02-07 19:48:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 19:48:36,625 INFO L225 Difference]: With dead ends: 28 [2025-02-07 19:48:36,625 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 19:48:36,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 19:48:36,632 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 19:48:36,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 19:48:36,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 19:48:36,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-07 19:48:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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-02-07 19:48:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2025-02-07 19:48:36,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 8 [2025-02-07 19:48:36,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 19:48:36,661 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2025-02-07 19:48:36,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-02-07 19:48:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2025-02-07 19:48:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-07 19:48:36,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 19:48:36,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 19:48:36,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-02-07 19:48:36,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 19:48:36,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 19:48:36,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 19:48:36,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1130201768, now seen corresponding path program 1 times [2025-02-07 19:48:36,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 19:48:36,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820482919] [2025-02-07 19:48:36,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 19:48:36,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 19:48:36,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 19:48:36,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 19:48:36,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-07 19:48:36,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-07 19:48:37,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-07 19:48:37,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 19:48:37,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 19:48:37,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 19:48:37,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 19:48:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 19:48:37,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 19:48:37,086 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 19:48:37,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820482919] [2025-02-07 19:48:37,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820482919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 19:48:37,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 19:48:37,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 19:48:37,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965143160] [2025-02-07 19:48:37,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 19:48:37,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 19:48:37,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 19:48:37,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 19:48:37,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 19:48:37,091 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-02-07 19:48:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 19:48:37,985 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2025-02-07 19:48:38,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 19:48:38,000 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), 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) Word has length 8 [2025-02-07 19:48:38,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 19:48:38,001 INFO L225 Difference]: With dead ends: 19 [2025-02-07 19:48:38,001 INFO L226 Difference]: Without dead ends: 14 [2025-02-07 19:48:38,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 19:48:38,002 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 19:48:38,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 16 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 19:48:38,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-07 19:48:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2025-02-07 19:48:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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-02-07 19:48:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2025-02-07 19:48:38,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 8 [2025-02-07 19:48:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 19:48:38,006 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2025-02-07 19:48:38,006 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), 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-02-07 19:48:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2025-02-07 19:48:38,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 19:48:38,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 19:48:38,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 19:48:38,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-07 19:48:38,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 19:48:38,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 19:48:38,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 19:48:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash 487928043, now seen corresponding path program 1 times [2025-02-07 19:48:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 19:48:38,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033025741] [2025-02-07 19:48:38,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 19:48:38,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 19:48:38,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 19:48:38,211 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 19:48:38,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-07 19:48:38,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 19:48:38,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 19:48:38,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 19:48:38,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 19:48:38,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 19:48:38,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 19:48:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 19:48:38,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 19:48:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 19:48:38,455 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 19:48:38,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033025741] [2025-02-07 19:48:38,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033025741] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 19:48:38,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 19:48:38,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-02-07 19:48:38,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687634872] [2025-02-07 19:48:38,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 19:48:38,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 19:48:38,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 19:48:38,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 19:48:38,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 19:48:38,457 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-02-07 19:48:38,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 19:48:38,873 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2025-02-07 19:48:38,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 19:48:38,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) Word has length 11 [2025-02-07 19:48:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 19:48:38,893 INFO L225 Difference]: With dead ends: 23 [2025-02-07 19:48:38,893 INFO L226 Difference]: Without dead ends: 18 [2025-02-07 19:48:38,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 19:48:38,894 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 19:48:38,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 27 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 19:48:38,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-07 19:48:38,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-02-07 19:48:38,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 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-02-07 19:48:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2025-02-07 19:48:38,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 11 [2025-02-07 19:48:38,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 19:48:38,898 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-02-07 19:48:38,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-02-07 19:48:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2025-02-07 19:48:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 19:48:38,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 19:48:38,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 19:48:38,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-07 19:48:39,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 19:48:39,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 19:48:39,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 19:48:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash -6755893, now seen corresponding path program 2 times [2025-02-07 19:48:39,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 19:48:39,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373950392] [2025-02-07 19:48:39,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 19:48:39,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 19:48:39,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 19:48:39,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 19:48:39,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-07 19:48:39,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-02-07 19:48:39,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 17 statements. [2025-02-07 19:48:39,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 19:48:39,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 19:48:39,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 19:48:39,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 19:48:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 19:48:39,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 19:48:39,303 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 19:48:39,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373950392] [2025-02-07 19:48:39,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373950392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 19:48:39,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 19:48:39,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 19:48:39,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679291877] [2025-02-07 19:48:39,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 19:48:39,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 19:48:39,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 19:48:39,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 19:48:39,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 19:48:39,304 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-02-07 19:48:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 19:48:39,792 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2025-02-07 19:48:39,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 19:48:39,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 17 [2025-02-07 19:48:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 19:48:39,793 INFO L225 Difference]: With dead ends: 24 [2025-02-07 19:48:39,793 INFO L226 Difference]: Without dead ends: 20 [2025-02-07 19:48:39,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 19:48:39,794 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 19:48:39,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 17 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 19:48:39,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-07 19:48:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-02-07 19:48:39,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-02-07 19:48:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-02-07 19:48:39,798 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 17 [2025-02-07 19:48:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 19:48:39,798 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-02-07 19:48:39,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-02-07 19:48:39,798 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-02-07 19:48:39,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 19:48:39,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 19:48:39,798 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 19:48:39,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-07 19:48:40,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 19:48:40,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 19:48:40,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 19:48:40,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2128090059, now seen corresponding path program 1 times [2025-02-07 19:48:40,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 19:48:40,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498692121] [2025-02-07 19:48:40,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 19:48:40,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 19:48:40,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 19:48:40,006 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 19:48:40,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-07 19:48:40,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 19:48:40,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 19:48:40,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 19:48:40,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 19:48:40,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 19:48:40,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 19:48:40,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 19:48:40,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 19:48:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 19:48:40,518 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 19:48:40,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498692121] [2025-02-07 19:48:40,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498692121] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 19:48:40,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 19:48:40,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-07 19:48:40,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57376651] [2025-02-07 19:48:40,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 19:48:40,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 19:48:40,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 19:48:40,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 19:48:40,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-07 19:48:40,520 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-02-07 19:48:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 19:48:43,511 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2025-02-07 19:48:43,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 19:48:43,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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) Word has length 19 [2025-02-07 19:48:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 19:48:43,512 INFO L225 Difference]: With dead ends: 31 [2025-02-07 19:48:43,512 INFO L226 Difference]: Without dead ends: 26 [2025-02-07 19:48:43,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-07 19:48:43,513 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-07 19:48:43,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 29 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-07 19:48:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-07 19:48:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-07 19:48:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 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-02-07 19:48:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-02-07 19:48:43,519 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 19 [2025-02-07 19:48:43,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 19:48:43,519 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-02-07 19:48:43,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 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-02-07 19:48:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-02-07 19:48:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 19:48:43,520 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 19:48:43,520 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 19:48:43,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-07 19:48:43,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 19:48:43,720 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 19:48:43,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 19:48:43,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1022363317, now seen corresponding path program 2 times [2025-02-07 19:48:43,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 19:48:43,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959285803] [2025-02-07 19:48:43,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 19:48:43,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 19:48:43,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-07 19:48:43,725 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-07 19:48:43,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-07 19:48:43,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-02-07 19:48:45,889 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 19:48:45,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 19:48:45,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 19:48:45,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 19:48:45,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-07 19:48:46,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 19:48:46,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 19:48:46,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 19:48:46,970 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-07 19:48:46,971 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 19:48:46,971 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 19:48:47,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-07 19:48:47,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-07 19:48:47,180 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-02-07 19:48:47,218 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 19:48:47,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:48:47 BoogieIcfgContainer [2025-02-07 19:48:47,221 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 19:48:47,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 19:48:47,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 19:48:47,222 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 19:48:47,222 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 07:48:36" (3/4) ... [2025-02-07 19:48:47,224 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 19:48:47,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 19:48:47,225 INFO L158 Benchmark]: Toolchain (without parser) took 13078.65ms. Allocated memory is still 117.4MB. Free memory was 90.7MB in the beginning and 45.1MB in the end (delta: 45.6MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2025-02-07 19:48:47,225 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 83.9MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 19:48:47,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 756.88ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 80.4MB in the end (delta: 9.8MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2025-02-07 19:48:47,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.94ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 77.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 19:48:47,226 INFO L158 Benchmark]: Boogie Preprocessor took 57.21ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 75.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 19:48:47,226 INFO L158 Benchmark]: IcfgBuilder took 1271.72ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 61.4MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 19:48:47,226 INFO L158 Benchmark]: TraceAbstraction took 10932.16ms. Allocated memory is still 117.4MB. Free memory was 60.6MB in the beginning and 45.1MB in the end (delta: 15.5MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2025-02-07 19:48:47,226 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 117.4MB. Free memory was 45.1MB in the beginning and 45.1MB in the end (delta: 7.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 19:48:47,228 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.38ms. Allocated memory is still 83.9MB. Free memory was 61.8MB in the beginning and 61.8MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 756.88ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 80.4MB in the end (delta: 9.8MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.94ms. Allocated memory is still 117.4MB. Free memory was 80.4MB in the beginning and 77.9MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.21ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 75.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1271.72ms. Allocated memory is still 117.4MB. Free memory was 75.5MB in the beginning and 61.4MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10932.16ms. Allocated memory is still 117.4MB. Free memory was 60.6MB in the beginning and 45.1MB in the end (delta: 15.5MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 117.4MB. Free memory was 45.1MB in the beginning and 45.1MB in the end (delta: 7.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 870]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of expf at line 854, overapproximation of __builtin_isinf_sign at line 868. Possible FailurePath: [L863] float x[4], y[4]; [L864] x[0] = __VERIFIER_nondet_float() [L865] EXPR x[0] [L865] x[1] = x[0] + 1e-5f [L866] x[2] = 0.123456f [L867] x[3] = 0.654321f [L868] EXPR x[0] [L868] COND FALSE !(!(!__builtin_isnan (x[0]) && !__builtin_isinf_sign (x[0]))) [L869] CALL softmax(x, y, 4) [L847] int i; [L848] EXPR x[0] [L848] float max = x[0]; [L849] i = 1 VAL [i=1, max=-0.000000000000000000000000000000000000009405666632782319, n=4, x={-2147483648:0}, y={3:0}] [L849] COND TRUE i < n [L850] EXPR x[i] [L850] COND TRUE x[i] > max [L851] EXPR x[i] [L851] max = x[i] VAL [i=1, max=0.000009999999747378752, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=2, max=0.000009999999747378752, n=4, x={-2147483648:0}, y={3:0}] [L849] COND TRUE i < n [L850] EXPR x[i] [L850] COND TRUE x[i] > max [L851] EXPR x[i] [L851] max = x[i] VAL [i=2, max=0.12345600128173828, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=3, max=0.12345600128173828, n=4, x={-2147483648:0}, y={3:0}] [L849] COND TRUE i < n [L850] EXPR x[i] [L850] COND TRUE x[i] > max [L851] EXPR x[i] [L851] max = x[i] VAL [i=3, max=0.654321014881134, n=4, x={-2147483648:0}, y={3:0}] [L849] ++i VAL [i=4, max=0.654321014881134, n=4, x={-2147483648:0}, y={3:0}] [L849] COND FALSE !(i < n) [L852] float sum = 0.0f; [L853] i = 0 VAL [i=0, max=0.654321014881134, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=1, max=0.654321014881134, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=2, max=0.654321014881134, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=3, max=0.654321014881134, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND TRUE i < n [L854] EXPR x[i] [L854] float z = expf(x[i] - max); [L855] sum += z [L856] y[i] = z [L853] ++i VAL [i=4, max=0.654321014881134, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L853] COND FALSE !(i < n) [L858] i = 0 VAL [i=0, max=0.654321014881134, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=1, max=0.654321014881134, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=2, max=0.654321014881134, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=3, max=0.654321014881134, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND TRUE i < n [L859] EXPR y[i] [L859] y[i] /= sum [L858] ++i VAL [i=4, max=0.654321014881134, n=4, sum=0.0, x={-2147483648:0}, y={3:0}] [L858] COND FALSE !(i < n) [L869] RET softmax(x, y, 4) [L870] EXPR y[0] [L870] EXPR y[1] [L870] COND TRUE !(__builtin_islessequal(y[0], y[1])) [L870] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 55 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=5, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 88 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 214 SizeOfPredicates, 0 NumberOfNonLiveVariables, 402 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 38/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-07 19:48:47,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample