./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-cbmc-regression/float21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 04:50:56,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 04:50:56,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 04:50:56,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 04:50:56,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 04:50:56,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 04:50:56,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 04:50:56,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 04:50:56,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 04:50:56,943 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 04:50:56,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 04:50:56,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 04:50:56,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 04:50:56,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 04:50:56,948 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 04:50:56,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 04:50:56,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 04:50:56,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 04:50:56,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 04:50:56,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 04:50:56,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 04:50:56,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 04:50:56,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 04:50:56,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 04:50:56,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 04:50:56,954 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 04:50:56,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 04:50:56,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 04:50:56,955 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 04:50:56,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 04:50:56,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 04:50:56,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 04:50:56,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:50:56,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 04:50:56,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 04:50:56,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 04:50:56,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 04:50:56,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 04:50:56,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 04:50:56,957 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 04:50:56,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 04:50:56,958 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 04:50:56,958 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-11-16 04:50:57,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 04:50:57,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 04:50:57,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 04:50:57,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 04:50:57,298 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 04:50:57,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float21.i [2024-11-16 04:50:58,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 04:50:58,947 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 04:50:58,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i [2024-11-16 04:50:58,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9decc501/f9e8aa01fa2d47018edeeda48de143c3/FLAG09eaf4513 [2024-11-16 04:50:58,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9decc501/f9e8aa01fa2d47018edeeda48de143c3 [2024-11-16 04:50:58,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 04:50:58,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 04:50:58,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 04:50:58,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 04:50:59,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 04:50:59,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:50:58" (1/1) ... [2024-11-16 04:50:59,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad3c339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:50:59, skipping insertion in model container [2024-11-16 04:50:59,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:50:58" (1/1) ... [2024-11-16 04:50:59,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 04:50:59,658 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:3125) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:255) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1611) 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:1220) 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:2564) 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:791) 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:2564) 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:2564) 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:1761) 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:1167) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1150) 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:388) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1638) 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:3519) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2508) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:642) 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-11-16 04:50:59,666 INFO L158 Benchmark]: Toolchain (without parser) took 672.93ms. Allocated memory is still 163.6MB. Free memory was 86.7MB in the beginning and 133.1MB in the end (delta: -46.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 04:50:59,667 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory was 134.7MB in the beginning and 134.6MB in the end (delta: 112.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 04:50:59,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.06ms. Allocated memory is still 163.6MB. Free memory was 86.7MB in the beginning and 133.1MB in the end (delta: -46.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 04:50:59,669 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.21ms. Allocated memory is still 163.6MB. Free memory was 134.7MB in the beginning and 134.6MB in the end (delta: 112.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 669.06ms. Allocated memory is still 163.6MB. Free memory was 86.7MB in the beginning and 133.1MB in the end (delta: -46.4MB). Peak memory consumption was 18.9MB. 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/11.0.12-open/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 ../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-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 04:51:01,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 04:51:01,848 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 04:51:01,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 04:51:01,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 04:51:01,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 04:51:01,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 04:51:01,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 04:51:01,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 04:51:01,890 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 04:51:01,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 04:51:01,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 04:51:01,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 04:51:01,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 04:51:01,893 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 04:51:01,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 04:51:01,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 04:51:01,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 04:51:01,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 04:51:01,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 04:51:01,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 04:51:01,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 04:51:01,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 04:51:01,896 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 04:51:01,897 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 04:51:01,897 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 04:51:01,897 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 04:51:01,898 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 04:51:01,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 04:51:01,898 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 04:51:01,898 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 04:51:01,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 04:51:01,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 04:51:01,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 04:51:01,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:51:01,900 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 04:51:01,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 04:51:01,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 04:51:01,902 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 04:51:01,902 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 04:51:01,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 04:51:01,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 04:51:01,903 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 04:51:01,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 04:51:01,904 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-11-16 04:51:02,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 04:51:02,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 04:51:02,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 04:51:02,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 04:51:02,258 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 04:51:02,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float21.i [2024-11-16 04:51:03,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 04:51:03,975 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 04:51:03,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i [2024-11-16 04:51:03,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae2726b2/2c8a90d0e32a43f8a1bed9b1c4989def/FLAG10e83be59 [2024-11-16 04:51:04,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae2726b2/2c8a90d0e32a43f8a1bed9b1c4989def [2024-11-16 04:51:04,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 04:51:04,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 04:51:04,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 04:51:04,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 04:51:04,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 04:51:04,304 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:51:04" (1/1) ... [2024-11-16 04:51:04,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592083d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:04, skipping insertion in model container [2024-11-16 04:51:04,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:51:04" (1/1) ... [2024-11-16 04:51:04,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 04:51:04,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[40548,40561] [2024-11-16 04:51:04,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[40793,40806] [2024-11-16 04:51:04,947 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41044,41057] [2024-11-16 04:51:04,949 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41293,41306] [2024-11-16 04:51:04,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41371,41384] [2024-11-16 04:51:04,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41469,41482] [2024-11-16 04:51:04,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41539,41552] [2024-11-16 04:51:04,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41607,41620] [2024-11-16 04:51:04,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41705,41718] [2024-11-16 04:51:04,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41799,41812] [2024-11-16 04:51:04,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41906,41919] [2024-11-16 04:51:04,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41974,41987] [2024-11-16 04:51:04,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[42220,42233] [2024-11-16 04:51:04,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:51:04,980 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 04:51:05,020 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[40548,40561] [2024-11-16 04:51:05,026 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[40793,40806] [2024-11-16 04:51:05,027 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41044,41057] [2024-11-16 04:51:05,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41293,41306] [2024-11-16 04:51:05,033 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41371,41384] [2024-11-16 04:51:05,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41469,41482] [2024-11-16 04:51:05,035 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41539,41552] [2024-11-16 04:51:05,035 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41607,41620] [2024-11-16 04:51:05,036 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41705,41718] [2024-11-16 04:51:05,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41799,41812] [2024-11-16 04:51:05,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41906,41919] [2024-11-16 04:51:05,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41974,41987] [2024-11-16 04:51:05,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[42220,42233] [2024-11-16 04:51:05,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:51:05,186 INFO L204 MainTranslator]: Completed translation [2024-11-16 04:51:05,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:05 WrapperNode [2024-11-16 04:51:05,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 04:51:05,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 04:51:05,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 04:51:05,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 04:51:05,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:05" (1/1) ... [2024-11-16 04:51:05,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:05" (1/1) ... [2024-11-16 04:51:05,260 INFO L138 Inliner]: procedures = 449, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2024-11-16 04:51:05,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 04:51:05,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 04:51:05,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 04:51:05,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 04:51:05,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:05" (1/1) ... [2024-11-16 04:51:05,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:05" (1/1) ... [2024-11-16 04:51:05,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:05" (1/1) ... [2024-11-16 04:51:05,305 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-11-16 04:51:05,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:05" (1/1) ... [2024-11-16 04:51:05,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:05" (1/1) ... [2024-11-16 04:51:05,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:05" (1/1) ... [2024-11-16 04:51:05,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:05" (1/1) ... [2024-11-16 04:51:05,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:05" (1/1) ... [2024-11-16 04:51:05,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:05" (1/1) ... [2024-11-16 04:51:05,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 04:51:05,332 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 04:51:05,332 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 04:51:05,332 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 04:51:05,333 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:05" (1/1) ... [2024-11-16 04:51:05,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:51:05,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:51:05,371 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-11-16 04:51:05,375 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-11-16 04:51:05,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 04:51:05,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 04:51:05,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 04:51:05,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 04:51:05,427 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 04:51:05,427 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 04:51:05,542 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 04:51:05,545 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 04:51:13,630 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-16 04:51:13,631 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 04:51:13,646 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 04:51:13,647 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 04:51:13,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:51:13 BoogieIcfgContainer [2024-11-16 04:51:13,648 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 04:51:13,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 04:51:13,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 04:51:13,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 04:51:13,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:51:04" (1/3) ... [2024-11-16 04:51:13,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585d4eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:51:13, skipping insertion in model container [2024-11-16 04:51:13,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:51:05" (2/3) ... [2024-11-16 04:51:13,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@585d4eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:51:13, skipping insertion in model container [2024-11-16 04:51:13,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:51:13" (3/3) ... [2024-11-16 04:51:13,657 INFO L112 eAbstractionObserver]: Analyzing ICFG float21.i [2024-11-16 04:51:13,671 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 04:51:13,671 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-16 04:51:13,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 04:51:13,740 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;@761f5779, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 04:51:13,744 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-16 04:51:13,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 50 states have (on average 1.54) internal successors, (77), 63 states have internal predecessors, (77), 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-11-16 04:51:13,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-16 04:51:13,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:51:13,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-16 04:51:13,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 04:51:13,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:51:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash 3231263, now seen corresponding path program 1 times [2024-11-16 04:51:13,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:51:13,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691747969] [2024-11-16 04:51:13,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:51:13,777 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-11-16 04:51:13,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:51:13,780 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-11-16 04:51:13,781 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-11-16 04:51:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:51:13,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 04:51:13,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:51:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:51:13,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:51:13,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:51:13,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691747969] [2024-11-16 04:51:13,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691747969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:51:13,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:51:13,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:51:13,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724962701] [2024-11-16 04:51:13,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:51:13,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:51:13,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:51:13,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:51:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:51:14,001 INFO L87 Difference]: Start difference. First operand has 68 states, 50 states have (on average 1.54) internal successors, (77), 63 states have internal predecessors, (77), 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.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-11-16 04:51:17,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:51:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:51:17,380 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2024-11-16 04:51:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:51:17,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-16 04:51:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:51:17,388 INFO L225 Difference]: With dead ends: 116 [2024-11-16 04:51:17,388 INFO L226 Difference]: Without dead ends: 47 [2024-11-16 04:51:17,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-16 04:51:17,394 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 28 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-16 04:51:17,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-16 04:51:17,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-16 04:51:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-16 04:51:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.3125) internal successors, (42), 42 states have internal predecessors, (42), 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-11-16 04:51:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-11-16 04:51:17,436 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 4 [2024-11-16 04:51:17,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:51:17,436 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-11-16 04:51:17,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-11-16 04:51:17,437 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-11-16 04:51:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 04:51:17,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:51:17,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:51:17,443 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-11-16 04:51:17,641 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-11-16 04:51:17,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 04:51:17,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:51:17,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1056022782, now seen corresponding path program 1 times [2024-11-16 04:51:17,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:51:17,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2083622054] [2024-11-16 04:51:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:51:17,644 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-11-16 04:51:17,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:51:17,645 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-11-16 04:51:17,646 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-11-16 04:51:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:51:17,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 04:51:17,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:51:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:51:17,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:51:17,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:51:17,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2083622054] [2024-11-16 04:51:17,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2083622054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:51:17,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:51:17,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 04:51:17,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589884541] [2024-11-16 04:51:17,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:51:17,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 04:51:17,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:51:17,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 04:51:17,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 04:51:17,977 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-11-16 04:51:21,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:51:24,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:51:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:51:24,455 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2024-11-16 04:51:24,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 04:51:24,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-11-16 04:51:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:51:24,458 INFO L225 Difference]: With dead ends: 47 [2024-11-16 04:51:24,458 INFO L226 Difference]: Without dead ends: 45 [2024-11-16 04:51:24,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-11-16 04:51:24,459 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 24 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-16 04:51:24,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 110 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-16 04:51:24,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-16 04:51:24,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-16 04:51:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 40 states have internal predecessors, (40), 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-11-16 04:51:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-11-16 04:51:24,471 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 11 [2024-11-16 04:51:24,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:51:24,472 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-11-16 04:51:24,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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-11-16 04:51:24,472 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-11-16 04:51:24,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 04:51:24,473 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:51:24,473 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:51:24,478 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-11-16 04:51:24,676 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-11-16 04:51:24,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 04:51:24,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:51:24,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1623031230, now seen corresponding path program 1 times [2024-11-16 04:51:24,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:51:24,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064588203] [2024-11-16 04:51:24,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:51:24,678 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-11-16 04:51:24,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:51:24,680 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-11-16 04:51:24,681 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-11-16 04:51:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:51:24,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 04:51:24,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:51:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:51:24,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:51:24,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:51:24,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064588203] [2024-11-16 04:51:24,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064588203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:51:24,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:51:24,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:51:24,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034415834] [2024-11-16 04:51:24,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:51:24,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:51:24,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:51:24,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:51:24,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:51:24,803 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (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-11-16 04:51:28,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:51:30,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:51:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:51:31,231 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2024-11-16 04:51:31,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:51:31,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (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 12 [2024-11-16 04:51:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:51:31,239 INFO L225 Difference]: With dead ends: 45 [2024-11-16 04:51:31,239 INFO L226 Difference]: Without dead ends: 41 [2024-11-16 04:51:31,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:51:31,241 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-16 04:51:31,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 40 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-16 04:51:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-16 04:51:31,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-16 04:51:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 36 states have internal predecessors, (36), 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-11-16 04:51:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-11-16 04:51:31,247 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 12 [2024-11-16 04:51:31,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:51:31,247 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-11-16 04:51:31,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (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-11-16 04:51:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-16 04:51:31,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-16 04:51:31,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:51:31,248 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:51:31,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 04:51:31,449 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-11-16 04:51:31,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 04:51:31,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:51:31,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1104842743, now seen corresponding path program 1 times [2024-11-16 04:51:31,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:51:31,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439241813] [2024-11-16 04:51:31,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:51:31,451 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-11-16 04:51:31,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:51:31,454 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-11-16 04:51:31,455 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-11-16 04:51:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:51:31,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 04:51:31,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:51:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 04:51:31,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:51:31,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:51:31,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439241813] [2024-11-16 04:51:31,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439241813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:51:31,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:51:31,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 04:51:31,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321027616] [2024-11-16 04:51:31,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:51:31,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 04:51:31,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:51:31,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 04:51:31,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 04:51:31,792 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-11-16 04:51:34,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 04:51:36,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 04:51:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:51:37,748 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-11-16 04:51:37,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 04:51:37,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 19 [2024-11-16 04:51:37,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:51:37,759 INFO L225 Difference]: With dead ends: 41 [2024-11-16 04:51:37,759 INFO L226 Difference]: Without dead ends: 39 [2024-11-16 04:51:37,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-11-16 04:51:37,760 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-16 04:51:37,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 63 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-16 04:51:37,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-16 04:51:37,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-16 04:51:37,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 34 states have internal predecessors, (34), 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-11-16 04:51:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-16 04:51:37,768 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 19 [2024-11-16 04:51:37,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:51:37,769 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-16 04:51:37,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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-11-16 04:51:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-16 04:51:37,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-16 04:51:37,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:51:37,770 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:51:37,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-16 04:51:37,970 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-11-16 04:51:37,971 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 04:51:37,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:51:37,971 INFO L85 PathProgramCache]: Analyzing trace with hash -109612451, now seen corresponding path program 1 times [2024-11-16 04:51:37,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:51:37,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712152936] [2024-11-16 04:51:37,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:51:37,972 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-11-16 04:51:37,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:51:37,975 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-11-16 04:51:37,976 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-11-16 04:51:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:51:38,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 04:51:38,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:51:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 04:51:38,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:51:38,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:51:38,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712152936] [2024-11-16 04:51:38,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712152936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:51:38,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:51:38,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:51:38,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100204226] [2024-11-16 04:51:38,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:51:38,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:51:38,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:51:38,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:51:38,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:51:38,208 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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-11-16 04:51:40,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:51:41,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:51:43,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:51:43,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:51:43,332 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-11-16 04:51:43,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:51:43,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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 20 [2024-11-16 04:51:43,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:51:43,340 INFO L225 Difference]: With dead ends: 39 [2024-11-16 04:51:43,340 INFO L226 Difference]: Without dead ends: 35 [2024-11-16 04:51:43,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:51:43,341 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-16 04:51:43,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 35 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-16 04:51:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-16 04:51:43,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-16 04:51:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 30 states have internal predecessors, (30), 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-11-16 04:51:43,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-16 04:51:43,346 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 20 [2024-11-16 04:51:43,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:51:43,347 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-16 04:51:43,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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-11-16 04:51:43,347 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-11-16 04:51:43,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 04:51:43,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:51:43,348 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-11-16 04:51:43,352 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-11-16 04:51:43,548 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-11-16 04:51:43,549 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-11-16 04:51:43,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:51:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash 2036645112, now seen corresponding path program 1 times [2024-11-16 04:51:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:51:43,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511887044] [2024-11-16 04:51:43,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:51:43,550 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-11-16 04:51:43,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:51:43,551 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-11-16 04:51:43,552 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-11-16 04:51:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:51:43,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 04:51:43,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:51:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 04:51:43,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:51:43,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:51:43,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511887044] [2024-11-16 04:51:43,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511887044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:51:43,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:51:43,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:51:43,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44749637] [2024-11-16 04:51:43,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:51:43,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:51:43,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:51:43,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:51:43,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:51:43,820 INFO L87 Difference]: Start difference. First operand 35 states and 36 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-11-16 04:51:45,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 04:51:47,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 04:51:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:51:48,219 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-11-16 04:51:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:51:48,227 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-11-16 04:51:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:51:48,228 INFO L225 Difference]: With dead ends: 35 [2024-11-16 04:51:48,228 INFO L226 Difference]: Without dead ends: 33 [2024-11-16 04:51:48,228 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-11-16 04:51:48,229 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 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.4s IncrementalHoareTripleChecker+Time [2024-11-16 04:51:48,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-16 04:51:48,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-16 04:51:48,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-16 04:51:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 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-11-16 04:51:48,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-16 04:51:48,234 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 22 [2024-11-16 04:51:48,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:51:48,235 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-16 04:51:48,235 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-11-16 04:51:48,235 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-16 04:51:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-16 04:51:48,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:51:48,236 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] [2024-11-16 04:51:48,240 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 (7)] Forceful destruction successful, exit code 0 [2024-11-16 04:51:48,436 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-11-16 04:51:48,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 04:51:48,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:51:48,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1288510099, now seen corresponding path program 1 times [2024-11-16 04:51:48,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:51:48,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505378632] [2024-11-16 04:51:48,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:51:48,438 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-11-16 04:51:48,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:51:48,441 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-11-16 04:51:48,442 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-11-16 04:51:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:51:48,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 04:51:48,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:51:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 04:51:48,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:51:48,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:51:48,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505378632] [2024-11-16 04:51:48,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505378632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:51:48,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:51:48,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:51:48,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821987228] [2024-11-16 04:51:48,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:51:48,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:51:48,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:51:48,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:51:48,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:51:48,671 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-11-16 04:51:50,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 04:51:51,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 04:51:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:51:52,173 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-11-16 04:51:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:51:52,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2024-11-16 04:51:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:51:52,184 INFO L225 Difference]: With dead ends: 33 [2024-11-16 04:51:52,184 INFO L226 Difference]: Without dead ends: 31 [2024-11-16 04:51:52,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-11-16 04:51:52,185 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 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.5s IncrementalHoareTripleChecker+Time [2024-11-16 04:51:52,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-16 04:51:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-16 04:51:52,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-16 04:51:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 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-11-16 04:51:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-11-16 04:51:52,191 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2024-11-16 04:51:52,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:51:52,191 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-16 04:51:52,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-11-16 04:51:52,192 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-11-16 04:51:52,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 04:51:52,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:51:52,193 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-11-16 04:51:52,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-16 04:51:52,394 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-11-16 04:51:52,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 04:51:52,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:51:52,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1880777170, now seen corresponding path program 1 times [2024-11-16 04:51:52,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:51:52,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816426740] [2024-11-16 04:51:52,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:51:52,395 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-11-16 04:51:52,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:51:52,396 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-11-16 04:51:52,397 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-11-16 04:51:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:51:52,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 04:51:52,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:51:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 04:51:52,914 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:51:52,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:51:52,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816426740] [2024-11-16 04:51:52,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816426740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:51:52,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:51:52,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:51:52,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772856421] [2024-11-16 04:51:52,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:51:52,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 04:51:52,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:51:52,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 04:51:52,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 04:51:52,915 INFO L87 Difference]: Start difference. First operand 31 states and 32 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-11-16 04:51:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:51:55,423 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-11-16 04:51:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 04:51:55,432 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-11-16 04:51:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:51:55,432 INFO L225 Difference]: With dead ends: 31 [2024-11-16 04:51:55,433 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 04:51:55,433 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-11-16 04:51:55,433 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-16 04:51:55,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-16 04:51:55,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 04:51:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-16 04:51:55,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 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-11-16 04:51:55,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-11-16 04:51:55,437 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2024-11-16 04:51:55,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:51:55,438 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-11-16 04:51:55,438 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-11-16 04:51:55,438 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-11-16 04:51:55,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-16 04:51:55,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:51:55,438 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, 1] [2024-11-16 04:51:55,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-16 04:51:55,639 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-11-16 04:51:55,640 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 04:51:55,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:51:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1825450723, now seen corresponding path program 1 times [2024-11-16 04:51:55,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:51:55,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550668134] [2024-11-16 04:51:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:51:55,641 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-11-16 04:51:55,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:51:55,642 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-11-16 04:51:55,645 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-11-16 04:51:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:51:55,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 04:51:55,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:51:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 04:51:56,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:51:56,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:51:56,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550668134] [2024-11-16 04:51:56,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550668134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:51:56,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:51:56,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:51:56,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851985286] [2024-11-16 04:51:56,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:51:56,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 04:51:56,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:51:56,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 04:51:56,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 04:51:56,071 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-16 04:51:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:51:59,007 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2024-11-16 04:51:59,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 04:51:59,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 27 [2024-11-16 04:51:59,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:51:59,018 INFO L225 Difference]: With dead ends: 29 [2024-11-16 04:51:59,019 INFO L226 Difference]: Without dead ends: 27 [2024-11-16 04:51:59,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 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-11-16 04:51:59,019 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-16 04:51:59,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-16 04:51:59,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-16 04:51:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-16 04:51:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0) internal successors, (22), 22 states have internal predecessors, (22), 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-11-16 04:51:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-16 04:51:59,026 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 27 [2024-11-16 04:51:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:51:59,026 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-16 04:51:59,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-11-16 04:51:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-11-16 04:51:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 04:51:59,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:51:59,027 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, 1] [2024-11-16 04:51:59,037 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-11-16 04:51:59,229 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-11-16 04:51:59,229 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-16 04:51:59,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:51:59,230 INFO L85 PathProgramCache]: Analyzing trace with hash -499999662, now seen corresponding path program 1 times [2024-11-16 04:51:59,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:51:59,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206251381] [2024-11-16 04:51:59,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:51:59,230 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-11-16 04:51:59,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:51:59,233 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-11-16 04:51:59,234 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-11-16 04:51:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:51:59,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 04:51:59,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:52:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 04:52:01,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:52:01,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:52:01,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206251381] [2024-11-16 04:52:01,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206251381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:52:01,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:52:01,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 04:52:01,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091801175] [2024-11-16 04:52:01,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:52:01,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 04:52:01,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:52:01,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 04:52:01,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 04:52:01,730 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 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-11-16 04:52:06,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 04:52:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:52:06,430 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-11-16 04:52:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 04:52:06,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 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 34 [2024-11-16 04:52:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:52:06,431 INFO L225 Difference]: With dead ends: 27 [2024-11-16 04:52:06,431 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 04:52:06,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 04:52:06,432 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-16 04:52:06,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-16 04:52:06,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 04:52:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 04:52:06,433 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-11-16 04:52:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 04:52:06,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-11-16 04:52:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:52:06,433 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 04:52:06,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 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-11-16 04:52:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 04:52:06,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 04:52:06,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2024-11-16 04:52:06,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2024-11-16 04:52:06,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2024-11-16 04:52:06,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2024-11-16 04:52:06,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2024-11-16 04:52:06,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2024-11-16 04:52:06,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2024-11-16 04:52:06,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2024-11-16 04:52:06,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2024-11-16 04:52:06,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2024-11-16 04:52:06,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2024-11-16 04:52:06,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2024-11-16 04:52:06,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2024-11-16 04:52:06,452 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 (11)] Forceful destruction successful, exit code 0 [2024-11-16 04:52:06,640 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-11-16 04:52:06,643 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:52:06,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 04:52:06,866 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 04:52:06,886 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-16 04:52:06,887 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-16 04:52:06,890 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-16 04:52:06,891 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-16 04:52:06,893 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NAN [2024-11-16 04:52:06,893 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_INFINITE [2024-11-16 04:52:06,894 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_ZERO [2024-11-16 04:52:06,894 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_SUBNORMAL [2024-11-16 04:52:06,894 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NORMAL [2024-11-16 04:52:06,894 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_IEEE_ [2024-11-16 04:52:06,894 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_SVID_ [2024-11-16 04:52:06,894 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_XOPEN_ [2024-11-16 04:52:06,894 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_POSIX_ [2024-11-16 04:52:06,895 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_ISOC_ [2024-11-16 04:52:06,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:52:06 BoogieIcfgContainer [2024-11-16 04:52:06,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 04:52:06,898 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 04:52:06,898 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 04:52:06,898 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 04:52:06,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:51:13" (3/4) ... [2024-11-16 04:52:06,901 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 04:52:06,904 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-16 04:52:06,909 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-16 04:52:06,910 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 04:52:06,910 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 04:52:06,910 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 04:52:07,007 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 04:52:07,008 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 04:52:07,008 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 04:52:07,009 INFO L158 Benchmark]: Toolchain (without parser) took 62714.22ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 36.9MB in the beginning and 41.0MB in the end (delta: -4.2MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-11-16 04:52:07,009 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 48.2MB. Free memory was 29.3MB in the beginning and 29.2MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 04:52:07,009 INFO L158 Benchmark]: CACSL2BoogieTranslator took 891.07ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 36.7MB in the beginning and 45.8MB in the end (delta: -9.1MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-16 04:52:07,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.87ms. Allocated memory is still 73.4MB. Free memory was 45.8MB in the beginning and 43.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 04:52:07,010 INFO L158 Benchmark]: Boogie Preprocessor took 66.93ms. Allocated memory is still 73.4MB. Free memory was 43.1MB in the beginning and 41.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 04:52:07,010 INFO L158 Benchmark]: IcfgBuilder took 8315.82ms. Allocated memory is still 73.4MB. Free memory was 41.0MB in the beginning and 45.2MB in the end (delta: -4.2MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-11-16 04:52:07,010 INFO L158 Benchmark]: TraceAbstraction took 53247.67ms. Allocated memory is still 73.4MB. Free memory was 44.5MB in the beginning and 46.3MB in the end (delta: -1.8MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-11-16 04:52:07,010 INFO L158 Benchmark]: Witness Printer took 110.36ms. Allocated memory is still 73.4MB. Free memory was 46.3MB in the beginning and 41.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 04:52:07,015 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 48.2MB. Free memory was 29.3MB in the beginning and 29.2MB in the end (delta: 60.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 891.07ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 36.7MB in the beginning and 45.8MB in the end (delta: -9.1MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.87ms. Allocated memory is still 73.4MB. Free memory was 45.8MB in the beginning and 43.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.93ms. Allocated memory is still 73.4MB. Free memory was 43.1MB in the beginning and 41.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 8315.82ms. Allocated memory is still 73.4MB. Free memory was 41.0MB in the beginning and 45.2MB in the end (delta: -4.2MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * TraceAbstraction took 53247.67ms. Allocated memory is still 73.4MB. Free memory was 44.5MB in the beginning and 46.3MB in the end (delta: -1.8MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Witness Printer took 110.36ms. Allocated memory is still 73.4MB. Free memory was 46.3MB in the beginning and 41.0MB in the end (delta: 5.2MB). 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: 402]: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 384]: 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, 68 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 52.9s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 45.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 45.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 433 SdHoareTripleChecker+Invalid, 44.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 211 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 366 IncrementalHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 222 mSDtfsCounter, 366 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, InterpolantAutomatonStates: 41, 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, 4.2s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 188 ConstructedInterpolants, 19 QuantifiedInterpolants, 1216 SizeOfPredicates, 22 NumberOfNonLiveVariables, 352 ConjunctsInSsa, 37 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-11-16 04:52:07,091 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