./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3d24e4c1c847e769127c38fbc1869029d0f9f97538d9231a2c03e206a85bd0f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 22:03:52,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 22:03:52,868 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 22:03:52,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 22:03:52,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 22:03:52,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 22:03:52,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 22:03:52,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 22:03:52,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 22:03:52,907 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 22:03:52,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 22:03:52,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 22:03:52,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 22:03:52,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 22:03:52,911 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 22:03:52,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 22:03:52,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 22:03:52,912 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 22:03:52,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 22:03:52,916 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 22:03:52,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 22:03:52,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 22:03:52,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 22:03:52,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 22:03:52,917 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 22:03:52,917 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 22:03:52,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 22:03:52,918 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 22:03:52,918 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 22:03:52,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 22:03:52,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 22:03:52,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 22:03:52,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:03:52,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 22:03:52,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 22:03:52,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 22:03:52,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 22:03:52,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 22:03:52,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 22:03:52,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 22:03:52,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 22:03:52,921 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 22:03:52,922 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3d24e4c1c847e769127c38fbc1869029d0f9f97538d9231a2c03e206a85bd0f [2024-10-23 22:03:53,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 22:03:53,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 22:03:53,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 22:03:53,204 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 22:03:53,205 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 22:03:53,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i [2024-10-23 22:03:54,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 22:03:54,995 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 22:03:54,996 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i [2024-10-23 22:03:55,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfdf608cd/45685e27ef87412d875521a06bf0b108/FLAG6394ac094 [2024-10-23 22:03:55,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfdf608cd/45685e27ef87412d875521a06bf0b108 [2024-10-23 22:03:55,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 22:03:55,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 22:03:55,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 22:03:55,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 22:03:55,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 22:03:55,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:03:55" (1/1) ... [2024-10-23 22:03:55,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a47405b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:03:55, skipping insertion in model container [2024-10-23 22:03:55,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:03:55" (1/1) ... [2024-10-23 22:03:55,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 22:03:55,680 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: fpclassify at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:627) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:2969) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:253) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1587) 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:1204) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:280) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2541) 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:789) 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:2541) 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:2541) 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:1737) 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:1151) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1134) 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:387) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1614) 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:3460) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2485) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:640) 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) [2024-10-23 22:03:55,688 INFO L158 Benchmark]: Toolchain (without parser) took 661.81ms. Allocated memory is still 188.7MB. Free memory was 128.3MB in the beginning and 159.3MB in the end (delta: -31.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-23 22:03:55,690 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:03:55,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 660.04ms. Allocated memory is still 188.7MB. Free memory was 128.3MB in the beginning and 159.3MB in the end (delta: -31.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-23 22:03:55,692 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 50.9MB in the beginning and 50.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 660.04ms. Allocated memory is still 188.7MB. Free memory was 128.3MB in the beginning and 159.3MB in the end (delta: -31.0MB). Peak memory consumption was 14.7MB. 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: fpclassify de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: fpclassify: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:627) 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3d24e4c1c847e769127c38fbc1869029d0f9f97538d9231a2c03e206a85bd0f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 22:03:57,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 22:03:57,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-23 22:03:57,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 22:03:57,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 22:03:57,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 22:03:57,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 22:03:57,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 22:03:57,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 22:03:57,787 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 22:03:57,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 22:03:57,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 22:03:57,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 22:03:57,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 22:03:57,791 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 22:03:57,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 22:03:57,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 22:03:57,792 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 22:03:57,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 22:03:57,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 22:03:57,796 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 22:03:57,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 22:03:57,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 22:03:57,797 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-23 22:03:57,798 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-23 22:03:57,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 22:03:57,798 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-23 22:03:57,798 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 22:03:57,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 22:03:57,799 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 22:03:57,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 22:03:57,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 22:03:57,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 22:03:57,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 22:03:57,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:03:57,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 22:03:57,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 22:03:57,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 22:03:57,802 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-23 22:03:57,803 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-23 22:03:57,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 22:03:57,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 22:03:57,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 22:03:57,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 22:03:57,805 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-23 22:03:57,805 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3d24e4c1c847e769127c38fbc1869029d0f9f97538d9231a2c03e206a85bd0f [2024-10-23 22:03:58,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 22:03:58,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 22:03:58,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 22:03:58,157 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 22:03:58,158 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 22:03:58,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i [2024-10-23 22:03:59,695 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 22:03:59,952 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 22:03:59,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i [2024-10-23 22:03:59,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7373070be/beed27009a474a62ac4b0c6cac4de8dc/FLAGccb0ab9ee [2024-10-23 22:04:00,270 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7373070be/beed27009a474a62ac4b0c6cac4de8dc [2024-10-23 22:04:00,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 22:04:00,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 22:04:00,274 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 22:04:00,274 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 22:04:00,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 22:04:00,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:04:00" (1/1) ... [2024-10-23 22:04:00,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@772cdbe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:00, skipping insertion in model container [2024-10-23 22:04:00,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 10:04:00" (1/1) ... [2024-10-23 22:04:00,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 22:04:00,857 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[40548,40561] [2024-10-23 22:04:00,864 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[40793,40806] [2024-10-23 22:04:00,865 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41044,41057] [2024-10-23 22:04:00,868 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41293,41306] [2024-10-23 22:04:00,869 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41371,41384] [2024-10-23 22:04:00,869 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41469,41482] [2024-10-23 22:04:00,870 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41539,41552] [2024-10-23 22:04:00,870 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41607,41620] [2024-10-23 22:04:00,871 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41705,41718] [2024-10-23 22:04:00,875 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41799,41812] [2024-10-23 22:04:00,877 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41906,41919] [2024-10-23 22:04:00,878 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41974,41987] [2024-10-23 22:04:00,881 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[42220,42233] [2024-10-23 22:04:00,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:04:00,899 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 22:04:00,926 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[40548,40561] [2024-10-23 22:04:00,927 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[40793,40806] [2024-10-23 22:04:00,928 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41044,41057] [2024-10-23 22:04:00,929 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41293,41306] [2024-10-23 22:04:00,930 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41371,41384] [2024-10-23 22:04:00,930 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41469,41482] [2024-10-23 22:04:00,931 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41539,41552] [2024-10-23 22:04:00,931 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41607,41620] [2024-10-23 22:04:00,932 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41705,41718] [2024-10-23 22:04:00,932 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41799,41812] [2024-10-23 22:04:00,934 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41906,41919] [2024-10-23 22:04:00,934 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41974,41987] [2024-10-23 22:04:00,936 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[42220,42233] [2024-10-23 22:04:00,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 22:04:01,046 INFO L204 MainTranslator]: Completed translation [2024-10-23 22:04:01,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:01 WrapperNode [2024-10-23 22:04:01,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 22:04:01,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 22:04:01,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 22:04:01,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 22:04:01,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:01" (1/1) ... [2024-10-23 22:04:01,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:01" (1/1) ... [2024-10-23 22:04:01,101 INFO L138 Inliner]: procedures = 449, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2024-10-23 22:04:01,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 22:04:01,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 22:04:01,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 22:04:01,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 22:04:01,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:01" (1/1) ... [2024-10-23 22:04:01,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:01" (1/1) ... [2024-10-23 22:04:01,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:01" (1/1) ... [2024-10-23 22:04:01,140 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-23 22:04:01,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:01" (1/1) ... [2024-10-23 22:04:01,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:01" (1/1) ... [2024-10-23 22:04:01,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:01" (1/1) ... [2024-10-23 22:04:01,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:01" (1/1) ... [2024-10-23 22:04:01,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:01" (1/1) ... [2024-10-23 22:04:01,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:01" (1/1) ... [2024-10-23 22:04:01,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 22:04:01,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 22:04:01,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 22:04:01,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 22:04:01,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:01" (1/1) ... [2024-10-23 22:04:01,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 22:04:01,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 22:04:01,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 22:04:01,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 22:04:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-23 22:04:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 22:04:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 22:04:01,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 22:04:01,235 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-23 22:04:01,236 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-23 22:04:01,319 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 22:04:01,323 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 22:04:06,842 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-23 22:04:06,842 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 22:04:06,865 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 22:04:06,866 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-23 22:04:06,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:04:06 BoogieIcfgContainer [2024-10-23 22:04:06,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 22:04:06,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 22:04:06,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 22:04:06,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 22:04:06,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 10:04:00" (1/3) ... [2024-10-23 22:04:06,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e291f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:04:06, skipping insertion in model container [2024-10-23 22:04:06,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 10:04:01" (2/3) ... [2024-10-23 22:04:06,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e291f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 10:04:06, skipping insertion in model container [2024-10-23 22:04:06,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:04:06" (3/3) ... [2024-10-23 22:04:06,875 INFO L112 eAbstractionObserver]: Analyzing ICFG float21.i [2024-10-23 22:04:06,892 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 22:04:06,892 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-10-23 22:04:06,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 22:04:06,961 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;@21e0e8c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 22:04:06,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-10-23 22:04:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 47 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 22:04:06,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-23 22:04:06,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:04:06,971 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-23 22:04:06,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-23 22:04:06,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:04:06,976 INFO L85 PathProgramCache]: Analyzing trace with hash 157765, now seen corresponding path program 1 times [2024-10-23 22:04:06,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:04:06,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982951837] [2024-10-23 22:04:06,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:04:06,990 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 [2024-10-23 22:04:06,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:04:06,994 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:04:06,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-23 22:04:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:04:07,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 22:04:07,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:04:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:04:07,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:04:07,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:04:07,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982951837] [2024-10-23 22:04:07,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982951837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:04:07,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:04:07,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 22:04:07,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922744530] [2024-10-23 22:04:07,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:04:07,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 22:04:07,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:04:07,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 22:04:07,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:04:07,197 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 47 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-10-23 22:04:09,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-23 22:04:10,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-23 22:04:10,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:04:10,959 INFO L93 Difference]: Finished difference Result 98 states and 130 transitions. [2024-10-23 22:04:10,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 22:04:10,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-23 22:04:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:04:10,966 INFO L225 Difference]: With dead ends: 98 [2024-10-23 22:04:10,967 INFO L226 Difference]: Without dead ends: 46 [2024-10-23 22:04:10,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:04:10,972 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-23 22:04:10,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 50 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-23 22:04:10,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-23 22:04:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-23 22:04:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 41 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 22:04:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2024-10-23 22:04:11,004 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 3 [2024-10-23 22:04:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:04:11,004 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2024-10-23 22:04:11,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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) [2024-10-23 22:04:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2024-10-23 22:04:11,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-23 22:04:11,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:04:11,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:04:11,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-23 22:04:11,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:04:11,209 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-23 22:04:11,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:04:11,209 INFO L85 PathProgramCache]: Analyzing trace with hash -819681217, now seen corresponding path program 1 times [2024-10-23 22:04:11,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:04:11,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831436234] [2024-10-23 22:04:11,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:04:11,210 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 [2024-10-23 22:04:11,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:04:11,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:04:11,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-23 22:04:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:04:11,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-23 22:04:11,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:04:11,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:04:11,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:04:11,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:04:11,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831436234] [2024-10-23 22:04:11,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831436234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:04:11,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:04:11,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 22:04:11,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579325321] [2024-10-23 22:04:11,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:04:11,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 22:04:11,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:04:11,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 22:04:11,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 22:04:11,482 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:04:14,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-23 22:04:16,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-23 22:04:17,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:04:17,984 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-10-23 22:04:17,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-23 22:04:17,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-23 22:04:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:04:17,993 INFO L225 Difference]: With dead ends: 46 [2024-10-23 22:04:17,994 INFO L226 Difference]: Without dead ends: 44 [2024-10-23 22:04:17,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 22:04:17,995 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-10-23 22:04:17,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 113 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-10-23 22:04:17,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-23 22:04:18,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-23 22:04:18,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.3) internal successors, (39), 39 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 22:04:18,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2024-10-23 22:04:18,002 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 10 [2024-10-23 22:04:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:04:18,003 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2024-10-23 22:04:18,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:04:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2024-10-23 22:04:18,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-23 22:04:18,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:04:18,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:04:18,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-23 22:04:18,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:04:18,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-23 22:04:18,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:04:18,206 INFO L85 PathProgramCache]: Analyzing trace with hash 359690134, now seen corresponding path program 1 times [2024-10-23 22:04:18,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:04:18,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475981716] [2024-10-23 22:04:18,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:04:18,207 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 [2024-10-23 22:04:18,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:04:18,210 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:04:18,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-23 22:04:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:04:18,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 22:04:18,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:04:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 22:04:18,362 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:04:18,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:04:18,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475981716] [2024-10-23 22:04:18,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475981716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:04:18,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:04:18,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 22:04:18,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684242981] [2024-10-23 22:04:18,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:04:18,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 22:04:18,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:04:18,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 22:04:18,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:04:18,364 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:04:21,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-23 22:04:21,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:04:21,826 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2024-10-23 22:04:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 22:04:21,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-23 22:04:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:04:21,832 INFO L225 Difference]: With dead ends: 44 [2024-10-23 22:04:21,832 INFO L226 Difference]: Without dead ends: 40 [2024-10-23 22:04:21,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:04:21,834 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-23 22:04:21,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 37 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-23 22:04:21,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-23 22:04:21,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-23 22:04:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 35 states have internal predecessors, (35), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 22:04:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2024-10-23 22:04:21,842 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 11 [2024-10-23 22:04:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:04:21,843 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-10-23 22:04:21,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-23 22:04:21,843 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2024-10-23 22:04:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-23 22:04:21,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:04:21,844 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:04:21,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-23 22:04:22,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:04:22,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-23 22:04:22,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:04:22,045 INFO L85 PathProgramCache]: Analyzing trace with hash -767790062, now seen corresponding path program 1 times [2024-10-23 22:04:22,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:04:22,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665174492] [2024-10-23 22:04:22,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:04:22,046 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 [2024-10-23 22:04:22,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:04:22,049 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:04:22,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-23 22:04:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:04:22,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-23 22:04:22,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:04:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-23 22:04:22,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:04:22,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:04:22,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665174492] [2024-10-23 22:04:22,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665174492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:04:22,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:04:22,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 22:04:22,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691447793] [2024-10-23 22:04:22,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:04:22,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 22:04:22,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:04:22,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 22:04:22,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 22:04:22,415 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:04:26,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-23 22:04:27,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:04:27,809 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-10-23 22:04:27,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-23 22:04:27,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-23 22:04:27,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:04:27,820 INFO L225 Difference]: With dead ends: 40 [2024-10-23 22:04:27,820 INFO L226 Difference]: Without dead ends: 38 [2024-10-23 22:04:27,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 22:04:27,823 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-23 22:04:27,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 62 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-23 22:04:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-23 22:04:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-23 22:04:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 33 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 22:04:27,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2024-10-23 22:04:27,830 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 18 [2024-10-23 22:04:27,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:04:27,830 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2024-10-23 22:04:27,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:04:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2024-10-23 22:04:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-23 22:04:27,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:04:27,831 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:04:27,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-23 22:04:28,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:04:28,032 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-23 22:04:28,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:04:28,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1968315957, now seen corresponding path program 1 times [2024-10-23 22:04:28,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:04:28,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2030630429] [2024-10-23 22:04:28,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:04:28,034 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 [2024-10-23 22:04:28,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:04:28,037 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:04:28,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-23 22:04:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:04:28,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:04:28,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:04:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-23 22:04:28,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:04:28,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:04:28,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2030630429] [2024-10-23 22:04:28,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2030630429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:04:28,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:04:28,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 22:04:28,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132687334] [2024-10-23 22:04:28,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:04:28,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 22:04:28,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:04:28,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 22:04:28,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:04:28,224 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:04:30,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-23 22:04:31,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-23 22:04:34,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-23 22:04:34,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:04:34,273 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2024-10-23 22:04:34,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 22:04:34,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-10-23 22:04:34,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:04:34,280 INFO L225 Difference]: With dead ends: 38 [2024-10-23 22:04:34,280 INFO L226 Difference]: Without dead ends: 34 [2024-10-23 22:04:34,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:04:34,281 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:04:34,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 32 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-23 22:04:34,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-23 22:04:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-23 22:04:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.16) internal successors, (29), 29 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 22:04:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-10-23 22:04:34,287 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 19 [2024-10-23 22:04:34,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:04:34,287 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-10-23 22:04:34,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:04:34,287 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-10-23 22:04:34,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-23 22:04:34,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:04:34,288 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:04:34,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-23 22:04:34,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:04:34,489 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-23 22:04:34,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:04:34,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1766155997, now seen corresponding path program 1 times [2024-10-23 22:04:34,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:04:34,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748429270] [2024-10-23 22:04:34,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:04:34,490 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 [2024-10-23 22:04:34,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:04:34,491 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:04:34,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-23 22:04:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:04:34,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:04:34,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:04:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-23 22:04:34,717 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:04:34,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:04:34,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748429270] [2024-10-23 22:04:34,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748429270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:04:34,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:04:34,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 22:04:34,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234314015] [2024-10-23 22:04:34,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:04:34,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 22:04:34,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:04:34,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 22:04:34,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:04:34,719 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:04:36,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-23 22:04:38,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-23 22:04:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:04:38,945 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-10-23 22:04:38,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 22:04:38,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-23 22:04:38,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:04:38,956 INFO L225 Difference]: With dead ends: 34 [2024-10-23 22:04:38,957 INFO L226 Difference]: Without dead ends: 32 [2024-10-23 22:04:38,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:04:38,958 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-23 22:04:38,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-23 22:04:38,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-23 22:04:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-23 22:04:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 27 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 22:04:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2024-10-23 22:04:38,963 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 21 [2024-10-23 22:04:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:04:38,963 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2024-10-23 22:04:38,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:04:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2024-10-23 22:04:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-23 22:04:38,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:04:38,964 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:04:38,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-23 22:04:39,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:04:39,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-23 22:04:39,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:04:39,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1083734814, now seen corresponding path program 1 times [2024-10-23 22:04:39,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:04:39,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097336015] [2024-10-23 22:04:39,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:04:39,167 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 [2024-10-23 22:04:39,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:04:39,168 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:04:39,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-23 22:04:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:04:39,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-23 22:04:39,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:04:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-23 22:04:39,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:04:39,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:04:39,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097336015] [2024-10-23 22:04:39,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097336015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:04:39,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:04:39,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 22:04:39,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362735785] [2024-10-23 22:04:39,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:04:39,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 22:04:39,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:04:39,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 22:04:39,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:04:39,386 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:04:42,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:04:42,060 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2024-10-23 22:04:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 22:04:42,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-23 22:04:42,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:04:42,076 INFO L225 Difference]: With dead ends: 32 [2024-10-23 22:04:42,076 INFO L226 Difference]: Without dead ends: 30 [2024-10-23 22:04:42,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:04:42,076 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-23 22:04:42,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-23 22:04:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-23 22:04:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-23 22:04:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 22:04:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-10-23 22:04:42,083 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 22 [2024-10-23 22:04:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:04:42,083 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-10-23 22:04:42,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:04:42,084 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-10-23 22:04:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-23 22:04:42,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:04:42,087 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:04:42,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-23 22:04:42,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:04:42,288 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-23 22:04:42,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:04:42,289 INFO L85 PathProgramCache]: Analyzing trace with hash -270573523, now seen corresponding path program 1 times [2024-10-23 22:04:42,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:04:42,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745193327] [2024-10-23 22:04:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:04:42,289 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 [2024-10-23 22:04:42,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:04:42,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:04:42,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-23 22:04:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:04:42,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-23 22:04:42,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:04:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-23 22:04:42,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:04:42,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:04:42,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745193327] [2024-10-23 22:04:42,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745193327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:04:42,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:04:42,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 22:04:42,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946635336] [2024-10-23 22:04:42,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:04:42,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 22:04:42,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:04:42,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 22:04:42,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:04:42,795 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:04:45,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:04:45,801 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-10-23 22:04:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 22:04:45,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-10-23 22:04:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:04:45,810 INFO L225 Difference]: With dead ends: 30 [2024-10-23 22:04:45,810 INFO L226 Difference]: Without dead ends: 28 [2024-10-23 22:04:45,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 22:04:45,811 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-23 22:04:45,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-23 22:04:45,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-23 22:04:45,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-23 22:04:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 22:04:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-10-23 22:04:45,817 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2024-10-23 22:04:45,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:04:45,817 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-10-23 22:04:45,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:04:45,817 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-10-23 22:04:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-23 22:04:45,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:04:45,818 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:04:45,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-23 22:04:46,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:04:46,019 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-23 22:04:46,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:04:46,020 INFO L85 PathProgramCache]: Analyzing trace with hash 202159538, now seen corresponding path program 1 times [2024-10-23 22:04:46,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:04:46,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008776240] [2024-10-23 22:04:46,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:04:46,020 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 [2024-10-23 22:04:46,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:04:46,022 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:04:46,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-23 22:04:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:04:46,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-23 22:04:46,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:04:46,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-23 22:04:46,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:04:46,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:04:46,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008776240] [2024-10-23 22:04:46,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008776240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:04:46,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:04:46,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 22:04:46,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305840395] [2024-10-23 22:04:46,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:04:46,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 22:04:46,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:04:46,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 22:04:46,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:04:46,461 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:04:48,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-23 22:04:48,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:04:48,934 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-10-23 22:04:48,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 22:04:48,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-10-23 22:04:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:04:48,944 INFO L225 Difference]: With dead ends: 28 [2024-10-23 22:04:48,944 INFO L226 Difference]: Without dead ends: 26 [2024-10-23 22:04:48,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 22:04:48,945 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-23 22:04:48,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-23 22:04:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-23 22:04:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-23 22:04:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 22:04:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2024-10-23 22:04:48,949 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 26 [2024-10-23 22:04:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:04:48,949 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2024-10-23 22:04:48,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-23 22:04:48,949 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2024-10-23 22:04:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-23 22:04:48,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 22:04:48,950 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:04:48,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-23 22:04:49,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:04:49,151 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-10-23 22:04:49,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 22:04:49,152 INFO L85 PathProgramCache]: Analyzing trace with hash -858595910, now seen corresponding path program 1 times [2024-10-23 22:04:49,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-23 22:04:49,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455445290] [2024-10-23 22:04:49,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 22:04:49,152 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 [2024-10-23 22:04:49,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-23 22:04:49,154 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-23 22:04:49,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-23 22:04:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 22:04:49,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-23 22:04:49,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 22:04:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-23 22:04:51,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 22:04:51,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-23 22:04:51,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455445290] [2024-10-23 22:04:51,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455445290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 22:04:51,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 22:04:51,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 22:04:51,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875289420] [2024-10-23 22:04:51,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 22:04:51,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 22:04:51,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-23 22:04:51,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 22:04:51,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-23 22:04:51,536 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-23 22:04:54,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-23 22:04:55,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 22:04:55,213 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2024-10-23 22:04:55,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-23 22:04:55,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-10-23 22:04:55,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 22:04:55,214 INFO L225 Difference]: With dead ends: 26 [2024-10-23 22:04:55,214 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 22:04:55,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-23 22:04:55,215 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-23 22:04:55,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-23 22:04:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 22:04:55,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 22:04:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 22:04:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 22:04:55,216 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2024-10-23 22:04:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 22:04:55,216 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 22:04:55,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-23 22:04:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 22:04:55,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 22:04:55,218 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2024-10-23 22:04:55,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2024-10-23 22:04:55,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2024-10-23 22:04:55,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2024-10-23 22:04:55,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2024-10-23 22:04:55,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2024-10-23 22:04:55,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2024-10-23 22:04:55,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2024-10-23 22:04:55,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2024-10-23 22:04:55,219 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2024-10-23 22:04:55,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2024-10-23 22:04:55,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2024-10-23 22:04:55,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2024-10-23 22:04:55,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-23 22:04:55,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-23 22:04:55,423 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 22:04:55,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 22:04:55,619 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 22:04:55,631 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-23 22:04:55,632 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-23 22:04:55,634 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-23 22:04:55,634 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-23 22:04:55,636 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NAN [2024-10-23 22:04:55,637 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_INFINITE [2024-10-23 22:04:55,637 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_ZERO [2024-10-23 22:04:55,637 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_SUBNORMAL [2024-10-23 22:04:55,637 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NORMAL [2024-10-23 22:04:55,637 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_IEEE_ [2024-10-23 22:04:55,637 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_SVID_ [2024-10-23 22:04:55,637 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_XOPEN_ [2024-10-23 22:04:55,638 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_POSIX_ [2024-10-23 22:04:55,638 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_ISOC_ [2024-10-23 22:04:55,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 10:04:55 BoogieIcfgContainer [2024-10-23 22:04:55,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 22:04:55,640 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 22:04:55,641 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 22:04:55,641 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 22:04:55,641 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 10:04:06" (3/4) ... [2024-10-23 22:04:55,643 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 22:04:55,646 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-23 22:04:55,650 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-23 22:04:55,651 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-23 22:04:55,651 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 22:04:55,652 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 22:04:55,745 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 22:04:55,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 22:04:55,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 22:04:55,747 INFO L158 Benchmark]: Toolchain (without parser) took 55473.74ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 47.9MB in the beginning and 39.0MB in the end (delta: 8.8MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-10-23 22:04:55,747 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 48.2MB. Free memory was 27.1MB in the beginning and 27.0MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 22:04:55,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 772.72ms. Allocated memory is still 77.6MB. Free memory was 47.6MB in the beginning and 43.1MB in the end (delta: 4.6MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-10-23 22:04:55,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.75ms. Allocated memory is still 77.6MB. Free memory was 43.1MB in the beginning and 40.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:04:55,748 INFO L158 Benchmark]: Boogie Preprocessor took 57.45ms. Allocated memory is still 77.6MB. Free memory was 40.3MB in the beginning and 38.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 22:04:55,749 INFO L158 Benchmark]: RCFGBuilder took 5705.30ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 38.3MB in the beginning and 67.8MB in the end (delta: -29.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-10-23 22:04:55,749 INFO L158 Benchmark]: TraceAbstraction took 48771.36ms. Allocated memory is still 98.6MB. Free memory was 67.2MB in the beginning and 44.1MB in the end (delta: 23.2MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-10-23 22:04:55,750 INFO L158 Benchmark]: Witness Printer took 105.97ms. Allocated memory is still 98.6MB. Free memory was 44.1MB in the beginning and 39.0MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-23 22:04:55,751 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 48.2MB. Free memory was 27.1MB in the beginning and 27.0MB in the end (delta: 52.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 772.72ms. Allocated memory is still 77.6MB. Free memory was 47.6MB in the beginning and 43.1MB in the end (delta: 4.6MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.75ms. Allocated memory is still 77.6MB. Free memory was 43.1MB in the beginning and 40.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.45ms. Allocated memory is still 77.6MB. Free memory was 40.3MB in the beginning and 38.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 5705.30ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 38.3MB in the beginning and 67.8MB in the end (delta: -29.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * TraceAbstraction took 48771.36ms. Allocated memory is still 98.6MB. Free memory was 67.2MB in the beginning and 44.1MB in the end (delta: 23.2MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Witness Printer took 105.97ms. Allocated memory is still 98.6MB. Free memory was 44.1MB in the beginning and 39.0MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NAN - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_INFINITE - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_ZERO - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_SUBNORMAL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NORMAL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_IEEE_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_SVID_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_XOPEN_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_POSIX_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_ISOC_ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 384]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 387]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 388]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 391]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 392]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 393]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 394]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 395]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 396]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 397]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 398]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 399]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 402]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 48.5s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 41.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 124 SdHoareTripleChecker+Valid, 41.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 120 mSDsluCounter, 421 SdHoareTripleChecker+Invalid, 40.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 377 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 207 mSDtfsCounter, 377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 178 ConstructedInterpolants, 19 QuantifiedInterpolants, 1139 SizeOfPredicates, 22 NumberOfNonLiveVariables, 352 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 36/36 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 - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - ProcedureContractResult [Line: 2]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && ((signgam == \old(signgam)) && (_LIB_VERSION == \old(_LIB_VERSION)))) RESULT: Ultimate proved your program to be correct! [2024-10-23 22:04:55,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE