./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-cbmc-regression/float21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-cbmc-regression/float21.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3d24e4c1c847e769127c38fbc1869029d0f9f97538d9231a2c03e206a85bd0f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:25:49,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:25:49,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 20:25:49,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:25:49,266 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:25:49,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:25:49,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:25:49,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:25:49,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:25:49,289 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:25:49,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:25:49,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:25:49,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:25:49,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:25:49,292 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:25:49,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:25:49,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:25:49,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:25:49,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 20:25:49,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:25:49,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:25:49,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:25:49,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:25:49,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:25:49,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:25:49,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:25:49,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:25:49,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:25:49,299 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:25:49,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:25:49,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:25:49,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:25:49,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:25:49,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:25:49,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:25:49,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:25:49,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 20:25:49,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 20:25:49,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:25:49,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:25:49,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:25:49,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:25:49,302 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3d24e4c1c847e769127c38fbc1869029d0f9f97538d9231a2c03e206a85bd0f [2024-11-09 20:25:49,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:25:49,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:25:49,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:25:49,542 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:25:49,542 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:25:49,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float21.i [2024-11-09 20:25:50,842 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:25:51,072 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:25:51,072 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i [2024-11-09 20:25:51,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95d681c27/008b200bd1ee41b781d16be0c21b6864/FLAG9893034ae [2024-11-09 20:25:51,100 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95d681c27/008b200bd1ee41b781d16be0c21b6864 [2024-11-09 20:25:51,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:25:51,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:25:51,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:25:51,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:25:51,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:25:51,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:25:51" (1/1) ... [2024-11-09 20:25:51,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262e4184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:51, skipping insertion in model container [2024-11-09 20:25:51,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:25:51" (1/1) ... [2024-11-09 20:25:51,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:25:51,510 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: fpclassify at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:627) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:3125) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:255) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1611) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:271) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:280) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2564) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:791) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:286) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2564) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2564) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:307) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1761) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:233) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleCompoundStatement(CHandler.java:1167) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1150) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:236) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:388) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1638) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:159) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3519) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2508) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:642) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:189) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:116) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:145) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 20:25:51,516 INFO L158 Benchmark]: Toolchain (without parser) took 409.84ms. Allocated memory is still 151.0MB. Free memory was 78.7MB in the beginning and 119.9MB in the end (delta: -41.2MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-09 20:25:51,516 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:25:51,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.01ms. Allocated memory is still 151.0MB. Free memory was 78.6MB in the beginning and 119.9MB in the end (delta: -41.4MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-09 20:25:51,518 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.15ms. Allocated memory is still 151.0MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.01ms. Allocated memory is still 151.0MB. Free memory was 78.6MB in the beginning and 119.9MB in the end (delta: -41.4MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: fpclassify de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: fpclassify: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:627) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-cbmc-regression/float21.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b3d24e4c1c847e769127c38fbc1869029d0f9f97538d9231a2c03e206a85bd0f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:25:53,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:25:53,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 20:25:53,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:25:53,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:25:53,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:25:53,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:25:53,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:25:53,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:25:53,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:25:53,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:25:53,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:25:53,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:25:53,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:25:53,278 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:25:53,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:25:53,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:25:53,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:25:53,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:25:53,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:25:53,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:25:53,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:25:53,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:25:53,282 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 20:25:53,283 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 20:25:53,283 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:25:53,283 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 20:25:53,283 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:25:53,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:25:53,283 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:25:53,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:25:53,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:25:53,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:25:53,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:25:53,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:25:53,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:25:53,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:25:53,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:25:53,285 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 20:25:53,285 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 20:25:53,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:25:53,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:25:53,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:25:53,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:25:53,288 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b3d24e4c1c847e769127c38fbc1869029d0f9f97538d9231a2c03e206a85bd0f [2024-11-09 20:25:53,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:25:53,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:25:53,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:25:53,537 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:25:53,537 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:25:53,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float21.i [2024-11-09 20:25:54,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:25:55,054 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:25:55,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i [2024-11-09 20:25:55,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b17027ffa/0a57b937341a44fa885890e3e3ef42df/FLAGc656a6bf2 [2024-11-09 20:25:55,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b17027ffa/0a57b937341a44fa885890e3e3ef42df [2024-11-09 20:25:55,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:25:55,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:25:55,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:25:55,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:25:55,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:25:55,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:25:55" (1/1) ... [2024-11-09 20:25:55,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ace4d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:55, skipping insertion in model container [2024-11-09 20:25:55,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:25:55" (1/1) ... [2024-11-09 20:25:55,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:25:55,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[40548,40561] [2024-11-09 20:25:55,871 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[40793,40806] [2024-11-09 20:25:55,873 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41044,41057] [2024-11-09 20:25:55,875 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41293,41306] [2024-11-09 20:25:55,875 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41371,41384] [2024-11-09 20:25:55,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41469,41482] [2024-11-09 20:25:55,876 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41539,41552] [2024-11-09 20:25:55,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41607,41620] [2024-11-09 20:25:55,877 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41705,41718] [2024-11-09 20:25:55,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41799,41812] [2024-11-09 20:25:55,879 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41906,41919] [2024-11-09 20:25:55,879 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41974,41987] [2024-11-09 20:25:55,881 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[42220,42233] [2024-11-09 20:25:55,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:25:55,896 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 20:25:55,930 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[40548,40561] [2024-11-09 20:25:55,935 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[40793,40806] [2024-11-09 20:25:55,936 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41044,41057] [2024-11-09 20:25:55,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41293,41306] [2024-11-09 20:25:55,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41371,41384] [2024-11-09 20:25:55,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41469,41482] [2024-11-09 20:25:55,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41539,41552] [2024-11-09 20:25:55,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41607,41620] [2024-11-09 20:25:55,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41705,41718] [2024-11-09 20:25:55,941 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41799,41812] [2024-11-09 20:25:55,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41906,41919] [2024-11-09 20:25:55,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[41974,41987] [2024-11-09 20:25:55,944 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float21.i[42220,42233] [2024-11-09 20:25:55,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:25:56,066 INFO L204 MainTranslator]: Completed translation [2024-11-09 20:25:56,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:56 WrapperNode [2024-11-09 20:25:56,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 20:25:56,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 20:25:56,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 20:25:56,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 20:25:56,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:56" (1/1) ... [2024-11-09 20:25:56,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:56" (1/1) ... [2024-11-09 20:25:56,121 INFO L138 Inliner]: procedures = 449, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2024-11-09 20:25:56,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 20:25:56,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 20:25:56,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 20:25:56,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 20:25:56,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:56" (1/1) ... [2024-11-09 20:25:56,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:56" (1/1) ... [2024-11-09 20:25:56,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:56" (1/1) ... [2024-11-09 20:25:56,152 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 20:25:56,153 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:56" (1/1) ... [2024-11-09 20:25:56,153 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:56" (1/1) ... [2024-11-09 20:25:56,157 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:56" (1/1) ... [2024-11-09 20:25:56,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:56" (1/1) ... [2024-11-09 20:25:56,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:56" (1/1) ... [2024-11-09 20:25:56,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:56" (1/1) ... [2024-11-09 20:25:56,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 20:25:56,172 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 20:25:56,172 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 20:25:56,172 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 20:25:56,172 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:56" (1/1) ... [2024-11-09 20:25:56,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:25:56,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:25:56,216 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-09 20:25:56,226 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-09 20:25:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 20:25:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 20:25:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 20:25:56,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 20:25:56,259 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 20:25:56,259 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 20:25:56,340 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 20:25:56,342 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 20:26:02,780 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-09 20:26:02,780 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 20:26:02,792 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 20:26:02,792 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 20:26:02,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:26:02 BoogieIcfgContainer [2024-11-09 20:26:02,792 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 20:26:02,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 20:26:02,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 20:26:02,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 20:26:02,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:25:55" (1/3) ... [2024-11-09 20:26:02,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6b7b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:26:02, skipping insertion in model container [2024-11-09 20:26:02,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:25:56" (2/3) ... [2024-11-09 20:26:02,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f6b7b75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:26:02, skipping insertion in model container [2024-11-09 20:26:02,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:26:02" (3/3) ... [2024-11-09 20:26:02,799 INFO L112 eAbstractionObserver]: Analyzing ICFG float21.i [2024-11-09 20:26:02,809 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 20:26:02,809 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-09 20:26:02,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 20:26:02,858 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;@3f466d5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 20:26:02,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-09 20:26:02,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 50 states have (on average 1.54) internal successors, (77), 63 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 20:26:02,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 20:26:02,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:26:02,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 20:26:02,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 20:26:02,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:26:02,869 INFO L85 PathProgramCache]: Analyzing trace with hash 3231263, now seen corresponding path program 1 times [2024-11-09 20:26:02,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:26:02,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101765734] [2024-11-09 20:26:02,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:26:02,877 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-09 20:26:02,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:26:02,879 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-09 20:26:02,880 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-09 20:26:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:26:02,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 20:26:02,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:26:02,992 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-09 20:26:02,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:26:02,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:26:02,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101765734] [2024-11-09 20:26:02,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101765734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:26:02,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:26:02,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:26:02,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447022807] [2024-11-09 20:26:02,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:26:03,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:26:03,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:26:03,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:26:03,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:26:03,021 INFO L87 Difference]: Start difference. First operand has 68 states, 50 states have (on average 1.54) internal successors, (77), 63 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:26:06,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:26:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:26:06,155 INFO L93 Difference]: Finished difference Result 116 states and 148 transitions. [2024-11-09 20:26:06,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:26:06,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 20:26:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:26:06,165 INFO L225 Difference]: With dead ends: 116 [2024-11-09 20:26:06,165 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 20:26:06,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:26:06,169 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 28 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 20:26:06,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 20:26:06,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 20:26:06,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-09 20:26:06,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.3125) internal successors, (42), 42 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 20:26:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-11-09 20:26:06,196 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 4 [2024-11-09 20:26:06,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:26:06,197 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-11-09 20:26:06,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:26:06,197 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-11-09 20:26:06,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 20:26:06,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:26:06,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:26:06,204 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-09 20:26:06,400 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-09 20:26:06,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 20:26:06,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:26:06,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1056022782, now seen corresponding path program 1 times [2024-11-09 20:26:06,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:26:06,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192084907] [2024-11-09 20:26:06,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:26:06,402 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-09 20:26:06,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:26:06,404 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-09 20:26:06,406 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-09 20:26:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:26:06,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 20:26:06,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:26:06,611 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-09 20:26:06,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:26:06,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:26:06,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192084907] [2024-11-09 20:26:06,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192084907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:26:06,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:26:06,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 20:26:06,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892172521] [2024-11-09 20:26:06,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:26:06,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 20:26:06,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:26:06,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 20:26:06,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 20:26:06,615 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 20:26:09,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:26:11,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:26:11,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:26:11,939 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2024-11-09 20:26:11,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 20:26:11,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-09 20:26:11,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:26:11,941 INFO L225 Difference]: With dead ends: 47 [2024-11-09 20:26:11,941 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 20:26:11,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 20:26:11,942 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 24 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-09 20:26:11,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 110 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-09 20:26:11,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 20:26:11,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-09 20:26:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 40 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 20:26:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-11-09 20:26:11,947 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 11 [2024-11-09 20:26:11,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:26:11,948 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-11-09 20:26:11,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 20:26:11,948 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-11-09 20:26:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 20:26:11,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:26:11,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:26:11,954 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-09 20:26:12,151 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-09 20:26:12,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 20:26:12,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:26:12,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1623031230, now seen corresponding path program 1 times [2024-11-09 20:26:12,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:26:12,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026717980] [2024-11-09 20:26:12,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:26:12,153 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-09 20:26:12,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:26:12,156 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-09 20:26:12,158 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-09 20:26:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:26:12,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 20:26:12,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:26:12,230 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-09 20:26:12,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:26:12,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:26:12,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026717980] [2024-11-09 20:26:12,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026717980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:26:12,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:26:12,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:26:12,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626701340] [2024-11-09 20:26:12,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:26:12,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:26:12,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:26:12,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:26:12,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:26:12,232 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 20:26:14,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:26:16,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:26:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:26:16,300 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2024-11-09 20:26:16,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:26:16,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-09 20:26:16,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:26:16,305 INFO L225 Difference]: With dead ends: 45 [2024-11-09 20:26:16,305 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 20:26:16,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:26:16,306 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 20:26:16,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 40 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 20:26:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 20:26:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-09 20:26:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 36 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 20:26:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2024-11-09 20:26:16,310 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 12 [2024-11-09 20:26:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:26:16,311 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2024-11-09 20:26:16,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 20:26:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2024-11-09 20:26:16,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 20:26:16,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:26:16,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:26:16,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 20:26:16,514 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-09 20:26:16,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 20:26:16,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:26:16,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1104842743, now seen corresponding path program 1 times [2024-11-09 20:26:16,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:26:16,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498104321] [2024-11-09 20:26:16,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:26:16,515 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-09 20:26:16,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:26:16,527 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-09 20:26:16,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 (5)] Waiting until timeout for monitored process [2024-11-09 20:26:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:26:16,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 20:26:16,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:26:16,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 20:26:16,798 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:26:16,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:26:16,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498104321] [2024-11-09 20:26:16,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498104321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:26:16,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:26:16,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 20:26:16,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995454572] [2024-11-09 20:26:16,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:26:16,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 20:26:16,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:26:16,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 20:26:16,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 20:26:16,800 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 20:26:20,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 20:26:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:26:20,899 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-11-09 20:26:20,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 20:26:20,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-09 20:26:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:26:20,908 INFO L225 Difference]: With dead ends: 41 [2024-11-09 20:26:20,908 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 20:26:20,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 20:26:20,910 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 20:26:20,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 63 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 20:26:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 20:26:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 20:26:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 34 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 20:26:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-11-09 20:26:20,915 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 19 [2024-11-09 20:26:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:26:20,915 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-11-09 20:26:20,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 20:26:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-11-09 20:26:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 20:26:20,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:26:20,916 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:26:20,925 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-09 20:26:21,119 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-09 20:26:21,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 20:26:21,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:26:21,119 INFO L85 PathProgramCache]: Analyzing trace with hash -109612451, now seen corresponding path program 1 times [2024-11-09 20:26:21,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:26:21,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401585984] [2024-11-09 20:26:21,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:26:21,120 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-09 20:26:21,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:26:21,122 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-09 20:26:21,124 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-09 20:26:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:26:21,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 20:26:21,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:26:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 20:26:21,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:26:21,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:26:21,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401585984] [2024-11-09 20:26:21,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401585984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:26:21,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:26:21,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:26:21,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112842109] [2024-11-09 20:26:21,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:26:21,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:26:21,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:26:21,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:26:21,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:26:21,248 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 20:26:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:26:24,790 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-11-09 20:26:24,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:26:24,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-09 20:26:24,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:26:24,795 INFO L225 Difference]: With dead ends: 39 [2024-11-09 20:26:24,795 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 20:26:24,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:26:24,796 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 20:26:24,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 35 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 20:26:24,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 20:26:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 20:26:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 30 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 20:26:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-11-09 20:26:24,800 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 20 [2024-11-09 20:26:24,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:26:24,800 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-11-09 20:26:24,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 20:26:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-11-09 20:26:24,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 20:26:24,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:26:24,801 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:26:24,805 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-09 20:26:25,005 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-09 20:26:25,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 20:26:25,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:26:25,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2036645112, now seen corresponding path program 1 times [2024-11-09 20:26:25,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:26:25,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427469755] [2024-11-09 20:26:25,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:26:25,007 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-09 20:26:25,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:26:25,009 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-09 20:26:25,010 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-09 20:26:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:26:25,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 20:26:25,041 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:26:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 20:26:25,121 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:26:25,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:26:25,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427469755] [2024-11-09 20:26:25,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427469755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:26:25,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:26:25,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:26:25,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832391746] [2024-11-09 20:26:25,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:26:25,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:26:25,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:26:25,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:26:25,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:26:25,122 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 20:26:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:26:28,369 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-11-09 20:26:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:26:28,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-09 20:26:28,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:26:28,378 INFO L225 Difference]: With dead ends: 35 [2024-11-09 20:26:28,378 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 20:26:28,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:26:28,379 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 20:26:28,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-09 20:26:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 20:26:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-09 20:26:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 20:26:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-11-09 20:26:28,389 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 22 [2024-11-09 20:26:28,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:26:28,389 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-11-09 20:26:28,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 20:26:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-11-09 20:26:28,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 20:26:28,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:26:28,390 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:26:28,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 20:26:28,590 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-09 20:26:28,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 20:26:28,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:26:28,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1288510099, now seen corresponding path program 1 times [2024-11-09 20:26:28,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:26:28,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425693786] [2024-11-09 20:26:28,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:26:28,592 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-09 20:26:28,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:26:28,593 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-09 20:26:28,594 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-09 20:26:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:26:28,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 20:26:28,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:26:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 20:26:28,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:26:28,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:26:28,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425693786] [2024-11-09 20:26:28,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425693786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:26:28,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:26:28,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:26:28,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251493500] [2024-11-09 20:26:28,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:26:28,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:26:28,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:26:28,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:26:28,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:26:28,801 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 20:26:30,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 20:26:31,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 20:26:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:26:32,869 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-11-09 20:26:32,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:26:32,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-09 20:26:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:26:32,882 INFO L225 Difference]: With dead ends: 33 [2024-11-09 20:26:32,882 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 20:26:32,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:26:32,883 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-09 20:26:32,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-09 20:26:32,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 20:26:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 20:26:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 20:26:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-11-09 20:26:32,899 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2024-11-09 20:26:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:26:32,899 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-09 20:26:32,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 20:26:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-11-09 20:26:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 20:26:32,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:26:32,900 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:26:32,904 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-09 20:26:33,103 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-09 20:26:33,104 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 20:26:33,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:26:33,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1880777170, now seen corresponding path program 1 times [2024-11-09 20:26:33,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:26:33,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313746987] [2024-11-09 20:26:33,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:26:33,105 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-09 20:26:33,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:26:33,107 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-09 20:26:33,108 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-09 20:26:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:26:33,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 20:26:33,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:26:33,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 20:26:33,669 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:26:33,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:26:33,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313746987] [2024-11-09 20:26:33,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313746987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:26:33,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:26:33,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:26:33,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118807762] [2024-11-09 20:26:33,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:26:33,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:26:33,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:26:33,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:26:33,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:26:33,670 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 20:26:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:26:35,986 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-11-09 20:26:35,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 20:26:35,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-09 20:26:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:26:35,996 INFO L225 Difference]: With dead ends: 31 [2024-11-09 20:26:35,997 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 20:26:35,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:26:35,998 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 20:26:35,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 20:26:35,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 20:26:36,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 20:26:36,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 20:26:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2024-11-09 20:26:36,001 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2024-11-09 20:26:36,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:26:36,002 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2024-11-09 20:26:36,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 20:26:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2024-11-09 20:26:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 20:26:36,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:26:36,002 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:26:36,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 20:26:36,206 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-09 20:26:36,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 20:26:36,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:26:36,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1825450723, now seen corresponding path program 1 times [2024-11-09 20:26:36,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:26:36,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848324765] [2024-11-09 20:26:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:26:36,208 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-09 20:26:36,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:26:36,210 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-09 20:26:36,211 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-09 20:26:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:26:36,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 20:26:36,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:26:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 20:26:36,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:26:36,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:26:36,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848324765] [2024-11-09 20:26:36,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848324765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:26:36,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:26:36,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:26:36,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245898398] [2024-11-09 20:26:36,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:26:36,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:26:36,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:26:36,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:26:36,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:26:36,564 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 20:26:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:26:39,105 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2024-11-09 20:26:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 20:26:39,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2024-11-09 20:26:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:26:39,114 INFO L225 Difference]: With dead ends: 29 [2024-11-09 20:26:39,114 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 20:26:39,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:26:39,114 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 20:26:39,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 20:26:39,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 20:26:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 20:26:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0) internal successors, (22), 22 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 20:26:39,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-11-09 20:26:39,119 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 27 [2024-11-09 20:26:39,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:26:39,119 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-11-09 20:26:39,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 20:26:39,119 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-11-09 20:26:39,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 20:26:39,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:26:39,120 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:26:39,129 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 (10)] Ended with exit code 0 [2024-11-09 20:26:39,324 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-09 20:26:39,325 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2024-11-09 20:26:39,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:26:39,325 INFO L85 PathProgramCache]: Analyzing trace with hash -499999662, now seen corresponding path program 1 times [2024-11-09 20:26:39,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:26:39,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615431494] [2024-11-09 20:26:39,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:26:39,326 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-09 20:26:39,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:26:39,329 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-09 20:26:39,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 20:26:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:26:39,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 20:26:39,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:26:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 20:26:41,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:26:41,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:26:41,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615431494] [2024-11-09 20:26:41,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615431494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:26:41,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:26:41,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 20:26:41,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665411055] [2024-11-09 20:26:41,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:26:41,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 20:26:41,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:26:41,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 20:26:41,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 20:26:41,559 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 20:26:45,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 20:26:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:26:45,276 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-11-09 20:26:45,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 20:26:45,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-11-09 20:26:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:26:45,277 INFO L225 Difference]: With dead ends: 27 [2024-11-09 20:26:45,277 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 20:26:45,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 20:26:45,278 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 20:26:45,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 20:26:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 20:26:45,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 20:26:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:26:45,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 20:26:45,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-11-09 20:26:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:26:45,279 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 20:26:45,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 20:26:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 20:26:45,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 20:26:45,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 13 remaining) [2024-11-09 20:26:45,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2024-11-09 20:26:45,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2024-11-09 20:26:45,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2024-11-09 20:26:45,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2024-11-09 20:26:45,282 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2024-11-09 20:26:45,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2024-11-09 20:26:45,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2024-11-09 20:26:45,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2024-11-09 20:26:45,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2024-11-09 20:26:45,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2024-11-09 20:26:45,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2024-11-09 20:26:45,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2024-11-09 20:26:45,293 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-09 20:26:45,487 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-09 20:26:45,490 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:26:45,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 20:26:45,605 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 20:26:45,616 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 20:26:45,616 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-09 20:26:45,618 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-09 20:26:45,618 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-09 20:26:45,619 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NAN [2024-11-09 20:26:45,619 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_INFINITE [2024-11-09 20:26:45,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_ZERO [2024-11-09 20:26:45,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_SUBNORMAL [2024-11-09 20:26:45,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NORMAL [2024-11-09 20:26:45,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_IEEE_ [2024-11-09 20:26:45,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_SVID_ [2024-11-09 20:26:45,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_XOPEN_ [2024-11-09 20:26:45,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_POSIX_ [2024-11-09 20:26:45,620 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_ISOC_ [2024-11-09 20:26:45,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:26:45 BoogieIcfgContainer [2024-11-09 20:26:45,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 20:26:45,622 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 20:26:45,622 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 20:26:45,622 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 20:26:45,622 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:26:02" (3/4) ... [2024-11-09 20:26:45,624 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 20:26:45,627 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 20:26:45,629 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-09 20:26:45,630 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 20:26:45,630 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 20:26:45,630 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 20:26:45,695 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 20:26:45,695 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 20:26:45,695 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 20:26:45,696 INFO L158 Benchmark]: Toolchain (without parser) took 50299.84ms. Allocated memory was 73.4MB in the beginning and 113.2MB in the end (delta: 39.8MB). Free memory was 32.5MB in the beginning and 69.7MB in the end (delta: -37.2MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-11-09 20:26:45,696 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 73.4MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:26:45,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 655.47ms. Allocated memory was 73.4MB in the beginning and 113.2MB in the end (delta: 39.8MB). Free memory was 53.6MB in the beginning and 61.6MB in the end (delta: -8.1MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-11-09 20:26:45,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.34ms. Allocated memory is still 113.2MB. Free memory was 61.6MB in the beginning and 59.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 20:26:45,697 INFO L158 Benchmark]: Boogie Preprocessor took 48.68ms. Allocated memory is still 113.2MB. Free memory was 59.2MB in the beginning and 57.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 20:26:45,697 INFO L158 Benchmark]: IcfgBuilder took 6620.70ms. Allocated memory is still 113.2MB. Free memory was 57.1MB in the beginning and 77.2MB in the end (delta: -20.2MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2024-11-09 20:26:45,698 INFO L158 Benchmark]: TraceAbstraction took 42827.93ms. Allocated memory is still 113.2MB. Free memory was 75.9MB in the beginning and 74.9MB in the end (delta: 990.9kB). Peak memory consumption was 184.2kB. Max. memory is 16.1GB. [2024-11-09 20:26:45,698 INFO L158 Benchmark]: Witness Printer took 73.24ms. Allocated memory is still 113.2MB. Free memory was 74.9MB in the beginning and 69.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 20:26:45,699 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.66ms. Allocated memory is still 73.4MB. Free memory is still 53.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 655.47ms. Allocated memory was 73.4MB in the beginning and 113.2MB in the end (delta: 39.8MB). Free memory was 53.6MB in the beginning and 61.6MB in the end (delta: -8.1MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.34ms. Allocated memory is still 113.2MB. Free memory was 61.6MB in the beginning and 59.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.68ms. Allocated memory is still 113.2MB. Free memory was 59.2MB in the beginning and 57.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 6620.70ms. Allocated memory is still 113.2MB. Free memory was 57.1MB in the beginning and 77.2MB in the end (delta: -20.2MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42827.93ms. Allocated memory is still 113.2MB. Free memory was 75.9MB in the beginning and 74.9MB in the end (delta: 990.9kB). Peak memory consumption was 184.2kB. Max. memory is 16.1GB. * Witness Printer took 73.24ms. Allocated memory is still 113.2MB. Free memory was 74.9MB in the beginning and 69.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NAN - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_INFINITE - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_ZERO - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_SUBNORMAL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed0~0~FP_NORMAL - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_IEEE_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_SVID_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_XOPEN_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_POSIX_ - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~unnamed1~0~_ISOC_ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 402]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 399]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 398]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 397]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 396]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 395]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 394]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 393]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 392]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 391]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 388]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 387]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 384]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 42.7s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 36.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 133 SdHoareTripleChecker+Valid, 36.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 433 SdHoareTripleChecker+Invalid, 35.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 211 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 366 IncrementalHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 222 mSDtfsCounter, 366 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 188 ConstructedInterpolants, 19 QuantifiedInterpolants, 1216 SizeOfPredicates, 22 NumberOfNonLiveVariables, 352 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 36/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - ProcedureContractResult [Line: 2]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && ((signgam == \old(signgam)) && (_LIB_VERSION == \old(_LIB_VERSION)))) RESULT: Ultimate proved your program to be correct! [2024-11-09 20:26:45,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE