./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/nearbyint.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-esbmc-regression/nearbyint.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 69ee9fe46649b3b552609f3ec360bfaabd8d7bfa2167c3567b409de7910df01a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 05:01:41,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 05:01:41,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 05:01:41,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 05:01:41,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 05:01:41,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 05:01:41,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 05:01:41,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 05:01:41,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 05:01:41,948 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 05:01:41,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 05:01:41,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 05:01:41,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 05:01:41,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 05:01:41,952 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 05:01:41,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 05:01:41,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 05:01:41,953 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 05:01:41,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 05:01:41,953 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 05:01:41,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 05:01:41,954 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 05:01:41,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 05:01:41,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 05:01:41,955 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 05:01:41,955 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 05:01:41,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 05:01:41,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 05:01:41,956 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 05:01:41,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 05:01:41,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 05:01:41,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 05:01:41,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:01:41,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 05:01:41,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 05:01:41,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 05:01:41,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 05:01:41,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 05:01:41,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 05:01:41,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 05:01:41,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 05:01:41,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 05:01:41,963 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 -> 69ee9fe46649b3b552609f3ec360bfaabd8d7bfa2167c3567b409de7910df01a [2024-11-16 05:01:42,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 05:01:42,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 05:01:42,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 05:01:42,273 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 05:01:42,274 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 05:01:42,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/nearbyint.i [2024-11-16 05:01:43,714 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 05:01:43,975 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 05:01:43,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/nearbyint.i [2024-11-16 05:01:43,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/798427743/33cb8d9dd88846918f1ebe7416078d07/FLAGef8c5fe6d [2024-11-16 05:01:44,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/798427743/33cb8d9dd88846918f1ebe7416078d07 [2024-11-16 05:01:44,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 05:01:44,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 05:01:44,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 05:01:44,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 05:01:44,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 05:01:44,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:01:44" (1/1) ... [2024-11-16 05:01:44,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e1059f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:44, skipping insertion in model container [2024-11-16 05:01:44,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:01:44" (1/1) ... [2024-11-16 05:01:44,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 05:01:44,467 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-esbmc-regression/nearbyint.i[38068,38081] [2024-11-16 05:01:44,483 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: fesetround not supported in non-bitprecise translation at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructBuiltinFesetround(IntegerTranslation.java:736) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleBuiltinFesetround(StandardFunctionHandler.java:2798) 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:1516) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:224) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java: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.handleLoopBody(CHandler.java:3614) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1563) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:227) 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 05:01:44,491 INFO L158 Benchmark]: Toolchain (without parser) took 477.20ms. Allocated memory is still 182.5MB. Free memory was 149.1MB in the beginning and 133.6MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 05:01:44,492 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 107.0MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:01:44,492 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.19ms. Allocated memory is still 182.5MB. Free memory was 149.1MB in the beginning and 133.6MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 05:01:44,494 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.18ms. Allocated memory is still 107.0MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 475.19ms. Allocated memory is still 182.5MB. Free memory was 149.1MB in the beginning and 133.6MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: fesetround not supported in non-bitprecise translation de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: fesetround not supported in non-bitprecise translation: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructBuiltinFesetround(IntegerTranslation.java:736) 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-esbmc-regression/nearbyint.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 69ee9fe46649b3b552609f3ec360bfaabd8d7bfa2167c3567b409de7910df01a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 05:01:46,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 05:01:46,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 05:01:46,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 05:01:46,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 05:01:46,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 05:01:46,628 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 05:01:46,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 05:01:46,629 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 05:01:46,629 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 05:01:46,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 05:01:46,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 05:01:46,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 05:01:46,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 05:01:46,631 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 05:01:46,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 05:01:46,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 05:01:46,632 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 05:01:46,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 05:01:46,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 05:01:46,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 05:01:46,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 05:01:46,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 05:01:46,638 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 05:01:46,638 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 05:01:46,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 05:01:46,639 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 05:01:46,639 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 05:01:46,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 05:01:46,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 05:01:46,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 05:01:46,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 05:01:46,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 05:01:46,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 05:01:46,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:01:46,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 05:01:46,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 05:01:46,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 05:01:46,643 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 05:01:46,643 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 05:01:46,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 05:01:46,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 05:01:46,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 05:01:46,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 05:01:46,645 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 -> 69ee9fe46649b3b552609f3ec360bfaabd8d7bfa2167c3567b409de7910df01a [2024-11-16 05:01:46,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 05:01:46,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 05:01:46,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 05:01:46,963 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 05:01:46,963 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 05:01:46,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/nearbyint.i [2024-11-16 05:01:48,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 05:01:48,792 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 05:01:48,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/nearbyint.i [2024-11-16 05:01:48,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4137390b9/a3a42ecf1113449ab5c59768b0db12a0/FLAGac855d6cd [2024-11-16 05:01:48,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4137390b9/a3a42ecf1113449ab5c59768b0db12a0 [2024-11-16 05:01:48,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 05:01:48,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 05:01:48,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 05:01:48,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 05:01:48,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 05:01:48,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:01:48" (1/1) ... [2024-11-16 05:01:48,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63eb5dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:48, skipping insertion in model container [2024-11-16 05:01:48,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:01:48" (1/1) ... [2024-11-16 05:01:48,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 05:01:49,403 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-esbmc-regression/nearbyint.i[38068,38081] [2024-11-16 05:01:49,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:01:49,445 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 05:01:49,478 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-esbmc-regression/nearbyint.i[38068,38081] [2024-11-16 05:01:49,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:01:49,631 INFO L204 MainTranslator]: Completed translation [2024-11-16 05:01:49,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:49 WrapperNode [2024-11-16 05:01:49,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 05:01:49,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 05:01:49,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 05:01:49,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 05:01:49,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:49" (1/1) ... [2024-11-16 05:01:49,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:49" (1/1) ... [2024-11-16 05:01:49,705 INFO L138 Inliner]: procedures = 463, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 138 [2024-11-16 05:01:49,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 05:01:49,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 05:01:49,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 05:01:49,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 05:01:49,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:49" (1/1) ... [2024-11-16 05:01:49,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:49" (1/1) ... [2024-11-16 05:01:49,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:49" (1/1) ... [2024-11-16 05:01:49,743 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2024-11-16 05:01:49,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:49" (1/1) ... [2024-11-16 05:01:49,743 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:49" (1/1) ... [2024-11-16 05:01:49,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:49" (1/1) ... [2024-11-16 05:01:49,755 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:49" (1/1) ... [2024-11-16 05:01:49,757 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:49" (1/1) ... [2024-11-16 05:01:49,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:49" (1/1) ... [2024-11-16 05:01:49,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 05:01:49,768 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 05:01:49,768 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 05:01:49,768 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 05:01:49,769 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:49" (1/1) ... [2024-11-16 05:01:49,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:01:49,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 05:01:49,802 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 05:01:49,806 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 05:01:49,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 05:01:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 05:01:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 05:01:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-16 05:01:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-16 05:01:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 05:01:49,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 05:01:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 05:01:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 05:01:49,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 05:01:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 05:01:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 05:01:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 05:01:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2024-11-16 05:01:49,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2024-11-16 05:01:49,981 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 05:01:49,983 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 05:01:50,239 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1000: call ULTIMATE.dealloc(main_~#modes~0#1.base, main_~#modes~0#1.offset);havoc main_~#modes~0#1.base, main_~#modes~0#1.offset; [2024-11-16 05:01:50,301 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-16 05:01:50,302 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 05:01:50,318 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 05:01:50,318 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 05:01:50,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:01:50 BoogieIcfgContainer [2024-11-16 05:01:50,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 05:01:50,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 05:01:50,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 05:01:50,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 05:01:50,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:01:48" (1/3) ... [2024-11-16 05:01:50,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572a8b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:01:50, skipping insertion in model container [2024-11-16 05:01:50,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:01:49" (2/3) ... [2024-11-16 05:01:50,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@572a8b59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:01:50, skipping insertion in model container [2024-11-16 05:01:50,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:01:50" (3/3) ... [2024-11-16 05:01:50,327 INFO L112 eAbstractionObserver]: Analyzing ICFG nearbyint.i [2024-11-16 05:01:50,344 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 05:01:50,344 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 05:01:50,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 05:01:50,420 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;@728ca12c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 05:01:50,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 05:01:50,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 40 states have (on average 1.3) internal successors, (52), 45 states have internal predecessors, (52), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 05:01:50,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-16 05:01:50,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:01:50,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:01:50,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:01:50,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:01:50,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2030561320, now seen corresponding path program 1 times [2024-11-16 05:01:50,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:01:50,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895319621] [2024-11-16 05:01:50,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:01:50,447 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 05:01:50,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:01:50,451 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 05:01:50,452 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 05:01:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:01:50,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 05:01:50,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:01:50,572 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 05:01:50,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:01:50,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:01:50,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895319621] [2024-11-16 05:01:50,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895319621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:01:50,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:01:50,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 05:01:50,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048112265] [2024-11-16 05:01:50,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:01:50,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 05:01:50,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:01:50,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 05:01:50,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 05:01:50,606 INFO L87 Difference]: Start difference. First operand has 65 states, 40 states have (on average 1.3) internal successors, (52), 45 states have internal predecessors, (52), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:50,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:01:50,631 INFO L93 Difference]: Finished difference Result 127 states and 201 transitions. [2024-11-16 05:01:50,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 05:01:50,633 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-16 05:01:50,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:01:50,647 INFO L225 Difference]: With dead ends: 127 [2024-11-16 05:01:50,647 INFO L226 Difference]: Without dead ends: 60 [2024-11-16 05:01:50,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 05:01:50,654 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:01:50,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:01:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-16 05:01:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-16 05:01:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 41 states have internal predecessors, (46), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 05:01:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 87 transitions. [2024-11-16 05:01:50,694 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 87 transitions. Word has length 14 [2024-11-16 05:01:50,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:01:50,695 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 87 transitions. [2024-11-16 05:01:50,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:50,696 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 87 transitions. [2024-11-16 05:01:50,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 05:01:50,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:01:50,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:01:50,702 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 05:01:50,898 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 05:01:50,899 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:01:50,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:01:50,900 INFO L85 PathProgramCache]: Analyzing trace with hash 939726054, now seen corresponding path program 1 times [2024-11-16 05:01:50,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:01:50,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461910681] [2024-11-16 05:01:50,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:01:50,901 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 05:01:50,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:01:50,904 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 05:01:50,905 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 05:01:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:01:50,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 05:01:50,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:01:50,989 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 05:01:50,989 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:01:50,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:01:50,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461910681] [2024-11-16 05:01:50,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461910681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:01:50,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:01:50,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 05:01:50,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675684485] [2024-11-16 05:01:50,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:01:50,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 05:01:50,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:01:50,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 05:01:50,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 05:01:50,995 INFO L87 Difference]: Start difference. First operand 60 states and 87 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:51,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:01:51,040 INFO L93 Difference]: Finished difference Result 118 states and 172 transitions. [2024-11-16 05:01:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 05:01:51,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-16 05:01:51,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:01:51,043 INFO L225 Difference]: With dead ends: 118 [2024-11-16 05:01:51,043 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 05:01:51,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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 05:01:51,045 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 14 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:01:51,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 165 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:01:51,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 05:01:51,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 62. [2024-11-16 05:01:51,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.263157894736842) internal successors, (48), 43 states have internal predecessors, (48), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 17 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-16 05:01:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 89 transitions. [2024-11-16 05:01:51,064 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 89 transitions. Word has length 15 [2024-11-16 05:01:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:01:51,064 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 89 transitions. [2024-11-16 05:01:51,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 89 transitions. [2024-11-16 05:01:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 05:01:51,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:01:51,066 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:01:51,071 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 05:01:51,269 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 05:01:51,269 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:01:51,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:01:51,270 INFO L85 PathProgramCache]: Analyzing trace with hash 221997637, now seen corresponding path program 1 times [2024-11-16 05:01:51,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:01:51,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049545617] [2024-11-16 05:01:51,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:01:51,271 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 05:01:51,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:01:51,274 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 05:01:51,275 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 05:01:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:01:51,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 05:01:51,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:01:51,431 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 05:01:51,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:01:51,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:01:51,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049545617] [2024-11-16 05:01:51,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049545617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:01:51,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:01:51,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 05:01:51,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129587414] [2024-11-16 05:01:51,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:01:51,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 05:01:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:01:51,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 05:01:51,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 05:01:51,435 INFO L87 Difference]: Start difference. First operand 62 states and 89 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:01:51,706 INFO L93 Difference]: Finished difference Result 138 states and 207 transitions. [2024-11-16 05:01:51,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 05:01:51,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-16 05:01:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:01:51,710 INFO L225 Difference]: With dead ends: 138 [2024-11-16 05:01:51,711 INFO L226 Difference]: Without dead ends: 80 [2024-11-16 05:01:51,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 05:01:51,716 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 11 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 05:01:51,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 379 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 05:01:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-16 05:01:51,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2024-11-16 05:01:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 46 states have internal predecessors, (52), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 18 states have call predecessors, (21), 20 states have call successors, (21) [2024-11-16 05:01:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2024-11-16 05:01:51,738 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 15 [2024-11-16 05:01:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:01:51,738 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2024-11-16 05:01:51,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2024-11-16 05:01:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-16 05:01:51,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:01:51,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:01:51,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 05:01:51,944 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 05:01:51,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:01:51,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:01:51,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1846475340, now seen corresponding path program 1 times [2024-11-16 05:01:51,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:01:51,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470131252] [2024-11-16 05:01:51,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:01:51,946 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 05:01:51,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:01:51,949 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 05:01:51,952 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 05:01:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:01:52,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 05:01:52,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:01:52,105 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 05:01:52,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:01:52,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:01:52,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470131252] [2024-11-16 05:01:52,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470131252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:01:52,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:01:52,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 05:01:52,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201560056] [2024-11-16 05:01:52,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:01:52,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 05:01:52,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:01:52,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 05:01:52,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 05:01:52,112 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:52,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:01:52,297 INFO L93 Difference]: Finished difference Result 140 states and 201 transitions. [2024-11-16 05:01:52,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 05:01:52,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-16 05:01:52,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:01:52,299 INFO L225 Difference]: With dead ends: 140 [2024-11-16 05:01:52,299 INFO L226 Difference]: Without dead ends: 77 [2024-11-16 05:01:52,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 05:01:52,301 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 9 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:01:52,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 365 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:01:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-16 05:01:52,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2024-11-16 05:01:52,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 47 states have internal predecessors, (53), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 18 states have call predecessors, (21), 20 states have call successors, (21) [2024-11-16 05:01:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2024-11-16 05:01:52,318 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 16 [2024-11-16 05:01:52,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:01:52,320 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2024-11-16 05:01:52,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2024-11-16 05:01:52,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-16 05:01:52,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:01:52,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:01:52,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 05:01:52,522 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 05:01:52,523 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:01:52,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:01:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash 296201003, now seen corresponding path program 1 times [2024-11-16 05:01:52,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:01:52,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967589839] [2024-11-16 05:01:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:01:52,524 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 05:01:52,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:01:52,525 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 05:01:52,527 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 05:01:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:01:52,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 05:01:52,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:01:52,650 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 05:01:52,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:01:52,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:01:52,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967589839] [2024-11-16 05:01:52,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967589839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:01:52,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:01:52,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 05:01:52,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112088004] [2024-11-16 05:01:52,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:01:52,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 05:01:52,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:01:52,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 05:01:52,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 05:01:52,655 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:01:52,858 INFO L93 Difference]: Finished difference Result 151 states and 220 transitions. [2024-11-16 05:01:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 05:01:52,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-16 05:01:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:01:52,860 INFO L225 Difference]: With dead ends: 151 [2024-11-16 05:01:52,860 INFO L226 Difference]: Without dead ends: 87 [2024-11-16 05:01:52,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 05:01:52,861 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 12 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 05:01:52,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 429 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 05:01:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-16 05:01:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2024-11-16 05:01:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 51 states have internal predecessors, (58), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-11-16 05:01:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 101 transitions. [2024-11-16 05:01:52,870 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 101 transitions. Word has length 16 [2024-11-16 05:01:52,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:01:52,870 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 101 transitions. [2024-11-16 05:01:52,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 101 transitions. [2024-11-16 05:01:52,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 05:01:52,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:01:52,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:01:52,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-16 05:01:53,072 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 05:01:53,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:01:53,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:01:53,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1662838875, now seen corresponding path program 1 times [2024-11-16 05:01:53,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:01:53,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672885434] [2024-11-16 05:01:53,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:01:53,074 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 05:01:53,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:01:53,075 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 05:01:53,076 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 05:01:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:01:53,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 05:01:53,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:01:53,192 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 05:01:53,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:01:53,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:01:53,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672885434] [2024-11-16 05:01:53,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672885434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:01:53,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:01:53,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:01:53,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333595901] [2024-11-16 05:01:53,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:01:53,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:01:53,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:01:53,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:01:53,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:01:53,199 INFO L87 Difference]: Start difference. First operand 74 states and 101 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:53,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:01:53,286 INFO L93 Difference]: Finished difference Result 165 states and 234 transitions. [2024-11-16 05:01:53,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:01:53,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-16 05:01:53,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:01:53,288 INFO L225 Difference]: With dead ends: 165 [2024-11-16 05:01:53,288 INFO L226 Difference]: Without dead ends: 95 [2024-11-16 05:01:53,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 05:01:53,289 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 14 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:01:53,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 304 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:01:53,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-16 05:01:53,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2024-11-16 05:01:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 52 states have internal predecessors, (58), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (24), 19 states have call predecessors, (24), 21 states have call successors, (24) [2024-11-16 05:01:53,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2024-11-16 05:01:53,299 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 17 [2024-11-16 05:01:53,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:01:53,299 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2024-11-16 05:01:53,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2024-11-16 05:01:53,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 05:01:53,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:01:53,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:01:53,305 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 05:01:53,501 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 05:01:53,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:01:53,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:01:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash 453829006, now seen corresponding path program 1 times [2024-11-16 05:01:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:01:53,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143844817] [2024-11-16 05:01:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:01:53,503 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 05:01:53,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:01:53,505 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 05:01:53,506 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 05:01:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:01:53,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 05:01:53,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:01:53,617 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 05:01:53,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:01:53,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:01:53,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143844817] [2024-11-16 05:01:53,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143844817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:01:53,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:01:53,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:01:53,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963048599] [2024-11-16 05:01:53,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:01:53,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:01:53,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:01:53,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:01:53,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:01:53,620 INFO L87 Difference]: Start difference. First operand 75 states and 104 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:01:53,722 INFO L93 Difference]: Finished difference Result 163 states and 231 transitions. [2024-11-16 05:01:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:01:53,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-16 05:01:53,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:01:53,724 INFO L225 Difference]: With dead ends: 163 [2024-11-16 05:01:53,725 INFO L226 Difference]: Without dead ends: 93 [2024-11-16 05:01:53,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 05:01:53,727 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 15 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:01:53,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 309 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:01:53,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-16 05:01:53,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 75. [2024-11-16 05:01:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 52 states have internal predecessors, (58), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 19 states have call predecessors, (23), 21 states have call successors, (23) [2024-11-16 05:01:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2024-11-16 05:01:53,744 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 17 [2024-11-16 05:01:53,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:01:53,744 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2024-11-16 05:01:53,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:53,744 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2024-11-16 05:01:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 05:01:53,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:01:53,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:01:53,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-16 05:01:53,945 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 05:01:53,946 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:01:53,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:01:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1698927266, now seen corresponding path program 1 times [2024-11-16 05:01:53,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:01:53,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040848688] [2024-11-16 05:01:53,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:01:53,947 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 05:01:53,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:01:53,950 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 05:01:53,952 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 05:01:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:01:53,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 05:01:54,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:01:54,067 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 05:01:54,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:01:54,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:01:54,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040848688] [2024-11-16 05:01:54,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040848688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:01:54,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:01:54,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 05:01:54,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142775974] [2024-11-16 05:01:54,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:01:54,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 05:01:54,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:01:54,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 05:01:54,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 05:01:54,069 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:01:54,263 INFO L93 Difference]: Finished difference Result 165 states and 236 transitions. [2024-11-16 05:01:54,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 05:01:54,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-16 05:01:54,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:01:54,265 INFO L225 Difference]: With dead ends: 165 [2024-11-16 05:01:54,265 INFO L226 Difference]: Without dead ends: 95 [2024-11-16 05:01:54,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 05:01:54,266 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 13 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 05:01:54,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 396 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 05:01:54,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-16 05:01:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 80. [2024-11-16 05:01:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 56 states have internal predecessors, (62), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (25), 19 states have call predecessors, (25), 21 states have call successors, (25) [2024-11-16 05:01:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2024-11-16 05:01:54,280 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 17 [2024-11-16 05:01:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:01:54,280 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2024-11-16 05:01:54,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2024-11-16 05:01:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 05:01:54,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:01:54,281 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:01:54,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-16 05:01:54,482 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 05:01:54,483 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:01:54,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:01:54,483 INFO L85 PathProgramCache]: Analyzing trace with hash 988670199, now seen corresponding path program 1 times [2024-11-16 05:01:54,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:01:54,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081553863] [2024-11-16 05:01:54,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:01:54,484 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 05:01:54,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:01:54,485 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 05:01:54,486 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 05:01:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:01:54,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 05:01:54,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:01:54,614 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 05:01:54,615 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:01:54,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:01:54,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081553863] [2024-11-16 05:01:54,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081553863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:01:54,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:01:54,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 05:01:54,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894591063] [2024-11-16 05:01:54,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:01:54,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 05:01:54,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:01:54,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 05:01:54,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 05:01:54,618 INFO L87 Difference]: Start difference. First operand 80 states and 109 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:01:54,791 INFO L93 Difference]: Finished difference Result 164 states and 225 transitions. [2024-11-16 05:01:54,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 05:01:54,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-16 05:01:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:01:54,794 INFO L225 Difference]: With dead ends: 164 [2024-11-16 05:01:54,794 INFO L226 Difference]: Without dead ends: 89 [2024-11-16 05:01:54,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 05:01:54,795 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 9 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:01:54,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 447 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:01:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-16 05:01:54,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2024-11-16 05:01:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 59 states have internal predecessors, (66), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (25), 20 states have call predecessors, (25), 21 states have call successors, (25) [2024-11-16 05:01:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2024-11-16 05:01:54,808 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 113 transitions. Word has length 18 [2024-11-16 05:01:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:01:54,808 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 113 transitions. [2024-11-16 05:01:54,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:01:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2024-11-16 05:01:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 05:01:54,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:01:54,809 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:01:54,817 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 05:01:55,016 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 05:01:55,016 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:01:55,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:01:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1336190376, now seen corresponding path program 1 times [2024-11-16 05:01:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:01:55,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000064842] [2024-11-16 05:01:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:01:55,018 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 05:01:55,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:01:55,020 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 05:01:55,021 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 05:01:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 05:01:55,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 05:01:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 05:01:55,096 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-16 05:01:55,097 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 05:01:55,098 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 05:01:55,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-16 05:01:55,299 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 05:01:55,303 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:01:55,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 05:01:55,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:01:55 BoogieIcfgContainer [2024-11-16 05:01:55,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 05:01:55,328 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 05:01:55,328 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 05:01:55,328 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 05:01:55,329 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:01:50" (3/4) ... [2024-11-16 05:01:55,331 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 05:01:55,332 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 05:01:55,333 INFO L158 Benchmark]: Toolchain (without parser) took 6508.79ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 49.5MB in the beginning and 44.3MB in the end (delta: 5.2MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-11-16 05:01:55,333 INFO L158 Benchmark]: CDTParser took 1.94ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 38.9MB in the end (delta: 63.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:01:55,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 806.95ms. Allocated memory is still 79.7MB. Free memory was 49.5MB in the beginning and 43.6MB in the end (delta: 5.9MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-11-16 05:01:55,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.03ms. Allocated memory is still 79.7MB. Free memory was 43.6MB in the beginning and 40.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:01:55,334 INFO L158 Benchmark]: Boogie Preprocessor took 60.53ms. Allocated memory is still 79.7MB. Free memory was 40.6MB in the beginning and 38.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:01:55,334 INFO L158 Benchmark]: IcfgBuilder took 551.58ms. Allocated memory is still 79.7MB. Free memory was 38.1MB in the beginning and 44.4MB in the end (delta: -6.3MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-11-16 05:01:55,335 INFO L158 Benchmark]: TraceAbstraction took 5005.40ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 43.7MB in the beginning and 44.7MB in the end (delta: -997.2kB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-11-16 05:01:55,335 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 100.7MB. Free memory was 44.7MB in the beginning and 44.3MB in the end (delta: 408.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:01:55,337 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.94ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 38.9MB in the end (delta: 63.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 806.95ms. Allocated memory is still 79.7MB. Free memory was 49.5MB in the beginning and 43.6MB in the end (delta: 5.9MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.03ms. Allocated memory is still 79.7MB. Free memory was 43.6MB in the beginning and 40.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.53ms. Allocated memory is still 79.7MB. Free memory was 40.6MB in the beginning and 38.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 551.58ms. Allocated memory is still 79.7MB. Free memory was 38.1MB in the beginning and 44.4MB in the end (delta: -6.3MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5005.40ms. Allocated memory was 79.7MB in the beginning and 100.7MB in the end (delta: 21.0MB). Free memory was 43.7MB in the beginning and 44.7MB in the end (delta: -997.2kB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 100.7MB. Free memory was 44.7MB in the beginning and 44.3MB in the end (delta: 408.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 997]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of nearbyint at line 1006. Possible FailurePath: [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1000] int const modes[] = {0x400, 0, 0xc00, 0x800}; [L1002] int i = 0; VAL [i=0, modes={3:0}] [L1002] COND TRUE i < sizeof(modes) / sizeof(int) [L1003] EXPR modes[i] [L1003] FCALL fesetround(modes[i]) VAL [i=0, modes={3:0}] [L1004] modes[i] [L1005] case 0x400: [L1006] CALL __VERIFIER_assert(nearbyint(12.9) == 12.) VAL [\old(cond)=0] [L997] COND TRUE !(cond) VAL [\old(cond)=0] [L997] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 2885 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2105 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 507 IncrementalHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 780 mSDtfsCounter, 507 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=9, InterpolantAutomatonStates: 50, 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, 9 MinimizatonAttempts, 112 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 339 SizeOfPredicates, 38 NumberOfNonLiveVariables, 423 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 05:01:55,368 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: UNKNOWN: Overapproximated counterexample